Se connecter

Bibliographies thématiques / Computer network protocols / Thèses

Thèses sur le sujet « Computer network protocols »

Pour voir les autres types de publications sur ce sujet consultez le lien suivant : Computer network protocols.

Auteur : Grafiati

Publié le 4 juin 2021

Mis à jour le 6 septembre 2023

Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres

Choisissez une source :

Consultez les 50 meilleures thèses pour votre recherche sur le sujet « Computer network protocols ».

À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.

Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.

Parcourez les thèses sur diverses disciplines et organisez correctement votre bibliographie.

1

alyanbaawi, ashraf. « DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS ». OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.

Texte intégral

Résumé :

Multicasting can be done in two different ways: source based tree approach andshared tree approach. Shared tree approach is preferred over source-based treeapproach because in the later construction of minimum cost tree per source is neededunlike a single shared tree in the former approach. However, in shared tree approach asingle core needs to handle the entire traffic load resulting in degraded multicastperformance. Besides, it also suffers from „single point failure‟. Multicast is acommunication between one or multiple senders and multiple receivers, which used asa way of sending IP datagrams to a group of interested receivers in one transmission.Core-based trees major concerns are core selection and core as single point of failure.The problem of core selection is to choose the best core or cores in the network toimprove the network performance.In this dissertation we propose 1) a multiple core selection approach for core-based tree multicasting, senders can select different cores to have an efficient loadbalanced multicore multicasting. It will overcome any core failure as well. 2) Novel andefficient schemes for load shared multicore multicasting are presented. Multiple coresare selected statically, that is, independent of any existing multicast groups and also theselection process is independent of any underlying unicast protocol. Some of theselected cores can be used for fault- tolerant purpose also to guard against any possible core failures. 3) We have presented two novel and efficient schemes forgroup-based load shared multicore multicasting in which members of a multicast groupuse the same core tree for their multicasting. 4) We also presented two schemes aim atachieving low latency multicasting along with load sharing for delay sensitive multicastapplications. Besides, we have presented a unique approach for core migration, whichuses two very important parameters, namely, depth of a core tree and pseudo diameterof a core. One noteworthy point from the viewpoint of fault tolerance is that the degreeof fault-tolerance can be enhanced from covering single point-failure to any number ofcore failures.

Styles APA, Harvard, Vancouver, ISO, etc.

2

Lu, Ching-sung. « Automated validation of communication protocols / ». The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu148726702499786.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

3

Zissopoulos, Athanassios. « On buffer allocation in transport protocols ». Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66245.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

4

Dahlgren, Jeremy. « Efficient failure detection protocols for point-to-point communication networks / ». Online version of thesis, 2004. https://ritdml.rit.edu/dspace/handle/1850/2752.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

5

Sundaresan, Latha. « Simple network management protocol / ». Online version of thesis, 1995. http://hdl.handle.net/1850/12254.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

6

Jayakeerthy, Arunkumar Thippur Lim Alvin S. « Query-localized route repair mechanism for ad-hoc on-demand distance vector routing algorithm ». Auburn, Ala, 2009. http://hdl.handle.net/10415/1608.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

7

Ford, Daniel Alexander. « Semi-automatic implementation of network protocols ». Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/24665.

Texte intégral

Résumé :

A compiler which achieves automatic implementation of network protocols by transforming specifications written in FDT into C programs is presented. A brief introduction to the the fundamentals of FDT, a standard language developed by ISO/TC97/SC 16/WG 1 Subgroup B for specifying network protocols, is given. We then present an overview of the compiler and discuss the problem of PASCAL to C translation. Transformation of a FDT specification into code is explained and illustrated by two implementation examples. The first example illustrates the implementation strategy by tracing the processing of a simple protocol. The second example demonstrates the validity of using automatically generated implementations by showing how a communication path was established between two hosts using code generated for the alternating bit protocol.
Science, Faculty of
Computer Science, Department of
Graduate

Styles APA, Harvard, Vancouver, ISO, etc.

8

Berglund, Anders. « On the understanding of computer network protocols ». Licentiate thesis, Uppsala universitet, Avdelningen för datorteknik, 2002. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-86076.

Texte intégral

Résumé :

How students learn about network protocols is studied in a project-centred, internationally distributed, university course in computer systems taught jointly by two universities. Insights into students' understanding of basic concepts within computer networks are gained through an empirical phenomenographic research approach. The use of phenomenography as a research approach makes it possible to learn about computer science, as it is experienced by the students. The context in which the research is carried out and issues concerning by whom the context is experienced, are investigated and form a part of the methodological basis. Students' understanding of some protocols that are used within the project, as well as their experience of the general concept of network protocols are investigated, and different ways of experiencing the protocols are discerned. Some aspects that indicate good learning outcomes are identified, such as being capable of understanding a protocol in different ways and of making relevant choices between the ways it could be experienced according to the context in which it appears. Based on these results a discussion on learning and teaching is developed. It is argued that a variation in the context in which the protocol is experienced promotes good learning, since different ways of experiencing a protocol are useful with different tasks to hand. A student with a good understanding of network protocols can choose in a situationally relevant way between different ways of experiencing a protocol.

Styles APA, Harvard, Vancouver, ISO, etc.

9

Alexander, David. « A Network Metadata Infrastructure for Locating Network Devices ». Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1088176648.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

10

Baronikian, Haig. « Modelling and analysis of a computer conferencing system ». Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63756.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

11

Kou, Tian. « Conformance testing of OSI protocols : the class O transport protocol as an example ». Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26427.

Texte intégral

Résumé :

This thesis addresses the problem of conformance testing of communication protocol implementations. Test sequence generation techniques for finite state machines (FSM) have been developed to solve the problem of high costs of an exhaustive test. These techniques also guarantee a complete coverage of an implementation in terms of state transitions and output functions, and therefore provide a sound test of the implementation under test. In this thesis, we have modified and applied three test sequence generation techniques on the class 0 transport protocol. A local tester and executable test sequences for the ISO class 0 transport protocol have been developed on a portable protocol tester to demonstrate the practicality of the test methods and test methodologies. The local test is achieved by an upper tester residing on top of the implementation under test (IUT) and a lower tester residing at the bottom of the IUT. Tests are designed based on the state diagram of an IUT. Some methodologies of parameter variations have also been used to test primitive parameters of the implementation. Some problems encountered during the implementation of the testers and how they are resolved are also discussed in the thesis.
Science, Faculty of
Computer Science, Department of
Graduate

Styles APA, Harvard, Vancouver, ISO, etc.

12

Lundy, G. M. « Systems of communicating machines : a model for communication protocols ». Diss., Georgia Institute of Technology, 1988. http://hdl.handle.net/1853/8210.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

13

Kondareddy, Yogesh Reddy Agrawal Prathima. « MAC and routing protocols for multi-hop cognitive radio networks ». Auburn, Ala, 2008. http://repo.lib.auburn.edu/EtdRoot/2008/SUMMER/Electrical_and_Computer_Engineering/Thesis/Kondareddy_Yogesh_18.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

14

Zhou, Yuanyuan. « Energy-efficient protocols and topologies for sensor and personal-area networks ». Online access for everyone, 2007. http://www.dissertations.wsu.edu/Dissertations/Summer2007/y_zhou_072307.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

15

Rajagopal, Murali. « Protocol conversion : an algorithmic approach ». Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/13352.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

16

Li, Kang. « Modeling the bandwidth sharing behavior of congestion controlled flows / ». Full text open access at:, 2002. http://content.ohsu.edu/u?/etd,632.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

17

Lim, Kok Seng. « Analysis of network management protocols in optical networks ». Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FLim%5FK.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

18

Zhao, Xiaogeng. « An adaptive approach for optimized opportunistic routing over Delay Tolerant Mobile Ad hoc Networks ». Thesis, Rhodes University, 2008. http://hdl.handle.net/10962/d1004822.

Texte intégral

Résumé :

This thesis presents a framework for investigating opportunistic routing in Delay Tolerant Mobile Ad hoc Networks (DTMANETs), and introduces the concept of an Opportunistic Confidence Index (OCI). The OCI enables multiple opportunistic routing protocols to be applied as an adaptive group to improve DTMANET routing reliability, performance, and efficiency. The DTMANET is a recently acknowledged networkarchitecture, which is designed to address the challenging and marginal environments created by adaptive, mobile, and unreliable network node presence. Because of its ad hoc and autonomic nature, routing in a DTMANET is a very challenging problem. The design of routing protocols in such environments, which ensure a high percentage delivery rate (reliability), achieve a reasonable delivery time (performance), and at the same time maintain an acceptable communication overhead (efficiency), is of fundamental consequence to the usefulness of DTMANETs. In recent years, a number of investigations into DTMANET routing have been conducted, resulting in the emergence of a class of routing known as opportunistic routing protocols. Current research into opportunistic routing has exposed opportunities for positive impacts on DTMANET routing. To date, most investigations have concentrated upon one or other of the quality metrics of reliability, performance, or efficiency, while some approaches have pursued a balance of these metrics through assumptions of a high level of global knowledge and/or uniform mobile device behaviours. No prior research that we are aware of has studied the connection between multiple opportunistic elements and their influences upon one another, and none has demonstrated the possibility of modelling and using multiple different opportunistic elements as an adaptive group to aid the routing process in a DTMANET. This thesis investigates OCI opportunities and their viability through the design of an extensible simulation environment, which makes use of methods and techniques such as abstract modelling, opportunistic element simplification and isolation, random attribute generation and assignment, localized knowledge sharing, automated scenario generation, intelligent weight assignment and/or opportunistic element permutation. These methods and techniques are incorporated at both data acquisition and analysis phases. Our results show a significant improvement in all three metric categories. In one of the most applicable scenarios tested, OCI yielded a 31.05% message delivery increase (reliability improvement), 22.18% message delivery time reduction (performance improvement), and 73.64% routing depth decrement (efficiency improvement). We are able to conclude that the OCI approach is feasible across a range of scenarios, and that the use of multiple opportunistic elements to aid decision-making processes in DTMANET environments has value.

Styles APA, Harvard, Vancouver, ISO, etc.

19

Praveenkumar, Ramesh. « Investigation of routing protocols in a sensor network ». Birmingham, Ala. : University of Alabama at Birmingham, 2006. http://www.mhsl.uab.edu/dt/2006m/praveenkumar.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

20

Hui, Daniel Hang-Yan. « Protocol validation via reachability analysis : an implementation ». Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/24689.

Texte intégral

Résumé :

Reachability analysis is one of the earliest and most common techniques for protocol validation. It is well suited to checking the protocol syntactic properties since they are a direct consequence of the structure of the reachability tree. However, validations of unbounded protocols via reachability analysis always lead to the "state explosion" problem. To overcome this, a new approach in reachability analysis has been proposed by Vuong et al [Vuong 82a, 83a]. While not loosing any information on protocol syntactic properties, the Teachability tree constructed by the new approach for all non-FIFO and for a particular set of FIFO protocols (called well-ordered protocols) will become finite. This thesis is concerned with the implementation of an integrated package called VALIRA (VALIdation via Reachability Analysis) which bases on both the proposed technique and the conventional technique. Details and implementation of the various approaches used in VALIRA are presented in order to provide an insight to the package. Various features of the package are demonstrated with examples on different types of protocols, such as the FIFO, the non-FIFO, and the priority protocols. The use of VALIRA was found to be practical in general, despite some limitations of the package. Further enhancements on the VALIRA are also suggested.
Science, Faculty of
Computer Science, Department of
Graduate

Styles APA, Harvard, Vancouver, ISO, etc.

21

Gong, Shujia. « Solutions to constrained path computation in multi-layer networks ». Fairfax, VA : George Mason University, 2007. http://hdl.handle.net/1920/2932.

Texte intégral

Résumé :

Thesis (Ph. D.)--George Mason University, 2007.
Title from PDF t.p. (viewed Jan. 18, 2008). Thesis director: Bijan Jabbari Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Electrical and Computer Engineering. Vita: p. 113. Includes bibliographical references (p. 109-112). Also available in print.

Styles APA, Harvard, Vancouver, ISO, etc.

22

Nematbakhsh, Mohammadali. « TCP/IP PROTOCOL BOARD USING SINGLE CHIP PROCESSOR ». Thesis, The University of Arizona, 1985. http://hdl.handle.net/10150/275389.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

23

AmirFaiz, Farhad 1959. « DESIGN OF A COMMUNICATION PORT AND IMPLEMENTATION OF A RECONFIGURABLE MEDIA TRANSLATION GATEWAY (COMPUTER, CONNECTION, NETWORK, BRIDGE, COMPATIBLE) ». Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/275529.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

24

Martina, Jean Everson. « Verification of security protocols based on multicast communication ». Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609650.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

25

Iyengar, Janardhan R. « End-to-end concurrent multipath transfer using transport layer multihoming ». Access to citation, abstract and download form provided by ProQuest Information and Learning Company ; downloadable PDF file 1.67 Mb., p. 123, 2006. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:3220807.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

26

Dany, Hendra. « Application of the ferry clip approach to multi-party and interoperability testing ». Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/28971.

Texte intégral

Résumé :

As communications protocols are becoming more complex and sophisticated, developing a test system that has the ability to provide a controlled environment for comprehensive protocol testing is essential to achieve a "real open system". This thesis advocates the need for a multi-party test method as currently identified by ISO, and discusses two important aspects of protocol testing: Conformance and Interoperability. They are complementary to each other and are necessary to ensure the conformity and interoperability of a protocol implementation. The proposed ferry clip based test architecture is presented. Both the concepts and design principles employed to achieve a flexible and generalized test system and the specific components which comprise the Ferry Clip based Test System are described. The test system is general and flexible not only with respect to the test configurations and test methods but also with respect to the protocol to be tested, the system under test, and the underlying communication system. Applications of the ferry clip approach to multi-party conformance and interoperability testing are discussed, followed by an example of MHS conformance testing which demonstrates the applicability of the ferry clip approach to multi-party testing.
Science, Faculty of
Computer Science, Department of
Graduate

Styles APA, Harvard, Vancouver, ISO, etc.

27

Ko, Kai-Chung. « Protocol test sequence generation and analysis using AI techniques ». Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/29192.

Texte intégral

Résumé :

This thesis addresses two major issues in protocol conformance testing: test sequence generation and test result analysis. For test sequence generation, a new approach based on the constraint satisfaction problem (CSP) techniques, which is widely used in the AI community, is presented. This method constructs a unique test sequence for a given FSM by using an initial test sequence, such as a transition tour or an UIO test sequence, and incrementally generating a set of test subsequences which together represent the constraints imposed on the overall structure of the FSM. The new method not only generates test sequence with fault coverage which is at least as good as the one provided by the existing methods, but also allows the implementation under test (IUT) to have a larger number of states than that in the specification. In addition, the new method also lends itself naturally to both test result analysis and fault coverage measurement. For test result analysis, the CSP method uses the observed sequence as the initial sequence, constructs all fault models which satisfy the initial sequence and introduces additional subsequences to pinpoint the IUT fault model. In addition, a second method for test result analysis is proposed, which is originated from a model of diagnostic reasoning from first principle, another well-known AI techniques which produces all minimal diagnoses by considering the overall consistency of the system together with the observation. Unlike the first method, the second method does not require the computation of all fault models explicitly, and hence is considered to be more suitable for large systems. To our knowledge, the proposed methods in this thesis represent the first attempt in applying AI techniques to the problem of protocol test sequence generation and analysis.
Science, Faculty of
Computer Science, Department of
Graduate

Styles APA, Harvard, Vancouver, ISO, etc.

28

Lo, Jeffrey Kin Hung. « Open systems interconnection passive monitor OSI-PM ». Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/29418.

Texte intégral

Résumé :

The Open Systems Interconnection Passive Monitor (OSI-PM), which is based on the principles of the OSI-Reference Model (OSI-RM), provides a framework for the development of multi-layer passive monitoring and testing. It adopts the same seven-layer architecture of the OSI-RM and provides the capability of selectively displaying, capturing, and analyzing the protocol events on single or multiple connections for any subset or all of the seven layers. Different from conventional monitors, the OSI-PM is able to detect protocol violation as they occur in addition to the monitoring functions. The current OSI-PM is able to monitor and test up to the transport layer of the OSI-RM. This thesis discusses the design, prototype implementation and testing of the OSI-PM.
Science, Faculty of
Computer Science, Department of
Graduate

Styles APA, Harvard, Vancouver, ISO, etc.

29

Perlman, Radia Joy. « Network layer protocols with Byzantine robustness ». Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14403.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

30

Yang, Junmo Sun Min-Te. « Practical consideration of routing protocols in ad hoc networks ». Auburn, Ala., 2006. http://repo.lib.auburn.edu/2006%20Fall/Dissertations/YANG_JUNMO_37.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

31

Zang, Joanna Q. « Design of a redundancy protocol / ». free to MU campus, to others for purchase, 2003. http://wwwlib.umi.com/cr/mo/fullcit?p1418080.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

32

Mustell, Eliot John. « Internet Protocol Version 6 : The Next Generation ? » [Milwaukee, Wis.] : e-Publications@Marquette, 2009. http://epublications.marquette.edu/theses_open/23.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

33

Wu, Chen. « A new TCP protocol based on end-to-end available bandwidth measurement / ». View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?ELEC%202005%20WU.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

34

Lu, Jing. « Semi-automatic protocol implementation using an Estelle-C compiler, LAPB and RTS protocols as examples ». Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/29419.

Texte intégral

Résumé :

Formal Description Techniques allow for the use of automated tools during the specification and development of communication protocols. Estelle is a standardized formal description technique developed by ISO to remove ambiguities in the specification of communication protocols and services. The UBC Estelle-C compiler automates the implementation of protocols by producing an executable C implementation directly from its Estelle specification. In this thesis, we investigate the automated protocol implementation methodology using the Estelle-C compiler. First, we describe the improvements made to the compiler to support the latest version of Estelle. Then, we present and discuss the semiautomated implementations of the LAPB protocol in the CCITT X.25 Recommendation and the RTS protocol in the CCITT X.400 MHS series using this compiler. Finally, we compare the automatic and manual protocol implementations of LAPB and RTS protocols in terms of functional coverage, development time, code size, and performance measure. The results strongly indicate the overall advantages of automatic protocol implementation method over the manual approach.
Science, Faculty of
Computer Science, Department of
Graduate

Styles APA, Harvard, Vancouver, ISO, etc.

35

Pelletier, Larry Edward. « Description of a file access protocol for computer networks ». Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9870.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

36

Jin, Jingren Lim Alvin S. « Improving geographic routing with neighbor sectoring ». Auburn, Ala., 2007. http://hdl.handle.net/10415/1337.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

37

Ho, Yao Hua. « Connectionless approach--a localized scheme to mobile ad hoc networks ». Orlando, Fla. : University of Central Florida, 2009. http://purl.fcla.edu/fcla/etd/CFE0002742.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

38

Dobson, Lucas E. « Security analysis of session initiation protocol ». Thesis, Monterey, California : Naval Postgraduate School, 2010. http://edocs.nps.edu/npspubs/scholarly/theses/2010/Jun/10Jun%5FDobson.pdf.

Texte intégral

Résumé :

Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2010.
Thesis Advisor(s): Dinolt, George ; Eagle, Chris. "June 2010." Description based on title screen as viewed on July 13, 2010. Author(s) subject terms: Session initiation protocol, voice over IP, information security, siproxd, linphone, Qutecom, osip, eXosip Includes bibliographical references (p. 77-78). Also available in print.

Styles APA, Harvard, Vancouver, ISO, etc.

39

Mascarenhas, da Veiga Alves Manoel Eduardo. « Characterisation of end-to-end performance for web-based file server respositories ». Title page, contents and abstract only, 2001. http://web4.library.adelaide.edu.au/theses/09ENS/09ensm395.pdf.

Texte intégral

Résumé :

Bibliography: leaves 128-135. Investigates the behaviour of TCP bulk file transfer application sessions in a broadband access environment. Introduces some concepts for evaluating network behaviour: a path instability parameter for analyzing different TCP connections; a minimum RTT delay and a minimum typical path for estimating path characteristics between a client and application servers.

Styles APA, Harvard, Vancouver, ISO, etc.

40

Wibling, Oskar. « Creating Correct Network Protocols ». Doctoral thesis, Uppsala universitet, Avdelningen för datorteknik, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-9361.

Texte intégral

Résumé :

Network protocol construction is a complex and error prone task. The challenges originate both from the inherent complexity of developing correct program code and from the distributed nature of networked systems. Protocol errors can have devastating consequences. Even so, methods for ensuring protocol correctness are currently only used to a limited extent. A central reason for this is that they are often complex and expensive to employ. In this thesis, we develop methods to perform network protocol testing and verification, with the goal to make the techniques more accessible and readily adoptable. We examine how to formulate correctness requirements for ad hoc routing protocols used to set up forwarding paths in wireless networks. Model checking is a way to verify such requirements automatically. We investigate scalability of finite-state model checking, in terms of network size and topological complexity, and devise a manual abstraction technique to improve scalability. A methodology combining simulations, emulations, and real world experiments is developed for analyzing the performance of wireless protocol implementations. The technique is applied in a comparison of the ad hoc routing protocols AODV, DSR, and OLSR. Discrepancies between simulations and real world behavior are identified; these are due to absence of realistic radio propagation and mobility models in simulation. The issues are mainly related to how the protocols sense their network surroundings and we identify improvements to these capabilities. Finally, we develop a methodology and a tool for automatic verification of safety properties of infinite-state network protocols, modeled as graph transformation systems extended with negative application conditions. The verification uses symbolic backward reachability analysis. By introducing abstractions in the form of summary nodes, the method is extended to protocols with recursive data structures. Our tool automatically verifies correct routing of the DYMO ad hoc routing protocol and several nontrivial heap manipulating programs.

Styles APA, Harvard, Vancouver, ISO, etc.

41

Kulkarni, Shrinivas Bhalachandra. « The simulation studies on a behaviour based trust routing protocol for ad hoc networks ». Diss., Online access via UMI:, 2006.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

42

Shah, Subodh. « CAD-HOC a CAD like tool for generating mobility benchmarks in ad-hoc networks / ». [Gainesville, Fla.] : University of Florida, 2001. http://etd.fcla.edu/etd/uf/2001/anp1049/FinalETDCopy.pdf.

Texte intégral

Résumé :

Thesis (M.S.)--University of Florida, 2001.
Title from first page of PDF file. Document formatted into pages; contains xiii, 90 p.; also contains graphics. Vita. Includes bibliographical references (p. 85-89).

Styles APA, Harvard, Vancouver, ISO, etc.

43

Wong, Wan-Ching. « SALM : an efficient application-level multicast protocol for dynamic groups / ». View Abstract or Full-Text, 2003. http://library.ust.hk/cgi/db/thesis.pl?COMP%202003%20WONGW.

Texte intégral

Résumé :

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2003.
Includes bibliographical references (leaves 75-79). Also available in electronic version. Access restricted to campus users.

Styles APA, Harvard, Vancouver, ISO, etc.

44

Vik, Knut-Helge. « Quality of service aware source initiated ad-hoc routing ». Online access for everyone, 2004. http://www.dissertations.wsu.edu/thesis/Spring2004/K%5FVik%5F050704.pdf.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

45

Miao, Jun. « Load balance in overlay multicast / ». View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20MIAO.

Texte intégral

Résumé :

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 59-62). Also available in electronic version. Access restricted to campus users.

Styles APA, Harvard, Vancouver, ISO, etc.

46

Cheuk, Kin-Wai. « Island multicast : the combination of IP-multicast with application-level multicast / ». View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20CHEUK.

Texte intégral

Résumé :

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 34-37). Also available in electronic version. Access restricted to campus users.

Styles APA, Harvard, Vancouver, ISO, etc.

47

Ahmed, Mahad A. (Mahad Mohamed) 1973 Carleton University Dissertation Engineering Systems and Computer. « Performance analysis and improvement of the Open Shortest Path First routing protocol ». Ottawa.:, 1999.

Trouver le texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

48

Penton, Jason Barry. « An empirical, in-depth investigation into service creation in H.323 Version 4 Networks ». Thesis, Rhodes University, 2003. http://hdl.handle.net/10962/d1007637.

Texte intégral

Résumé :

Over the past few years there has been an increasing tendency to carry voice on IP networks as opposed to the PSTN and other switched circuit networks. Initially this trend was favoured due to reduced costs but occurred at the expense of sacrificing the quality of the voice communications. Switched circuit networks have therefore remained the preferred carrier-grade voice communication network, but this is again changing. The advancement in improved quality of service (QoS) of real-time traffic on the IP network is a contributing factor to the anticipated future of the IP network supplying carrier-grade voice communications. Another contributing factor is the possibility of creating a new range of innovative, state-of-the-art telephony and communications services that acquire leverage through the intelligence and flexibility of the IP network. The latter has yet to be fully explored. Various protocols exist that facilitate the transport of voice and other media on IP networks. The most well known and widely supported of these is H.323. This work presents and discusses H.323 version 4 service creation. The work also categorises the various H.323 services and presents the mechanisms provided by H.323 version 4 that have facilitated the development of the three services I have developed, EmailReader, Telgo323 and CANS.

Styles APA, Harvard, Vancouver, ISO, etc.

49

Son, Chang Won. « Functional description and formal specification of a generic gateway ». Diss., The University of Arizona, 1988. http://hdl.handle.net/10150/184534.

Texte intégral

Résumé :

This dissertation is concerned with the design of a generic gateway which provides an interoperability between dissimilar computer networks. The generic gateway is decomposed with subnetwork dependent blocks and subnetwork independent blocks. The subnetwork dependent block is responsible to communicate with subnetwork nodes. The subnetwork independent block is responsible to interconnect the subnetwork dependent blocks. The communications between subnetwork dependent and independent blocks are done by service access points which defined independently to any specific subnetworks. Formal specification of a generic gateway is provided by LOTOS. The generic gateway specification is tested by a verifiable test method which is proposed in this dissertation. The correctness of the specification has been verified while the specified model is simulated. The major difference between conventional simulation and the verifiable test is in the objective of simulation. In the verifiable test method, the semantical properties are examined during the simulation process. The tester can be either human observer or other process.

Styles APA, Harvard, Vancouver, ISO, etc.

50

Tam, Wing-yan. « Quality of service routing with path information aggregation ». Click to view the E-thesis via HKUTO, 2006. http://sunzi.lib.hku.hk/hkuto/record/B36782956.

Texte intégral

Styles APA, Harvard, Vancouver, ISO, etc.

Nous offrons des réductions sur tous les plans premium pour les auteurs dont les œuvres sont incluses dans des sélections littéraires thématiques. Contactez-nous pour obtenir un code promo unique!