Log in

Relevant bibliographies by topics / Computer network protocols – Specifications / Dissertations / Theses

Dissertations / Theses on the topic 'Computer network protocols – Specifications'

To see the other types of publications on this topic, follow the link: Computer network protocols – Specifications.

Author: Grafiati

Published: 4 June 2021

Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Computer network protocols – Specifications.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

2

Cwikla, Joseph J. "Specifying, Implementing and Verifying Layered Network Protocols." University of Akron / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=akron1217270536.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Tsiknis, George. "Specification-verification of protocols : the significant event temporal logic technique." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/25047.

Full text

Abstract:

This thesis addresses the problem of protocol verification. We first present a brief review of the existing specification methods for communication protocols, with emphasis on the hybrid techniques. The alternating bit protocol is specified in ISO/FDT, BBN/FST and UNISPEX to provide a comparison between three interesting hybrid models of protocol specification. A method for applying the unbounded state Temporal Logic to verify a protocol specified in a hybrid technique (in particular FDT) is outlined. Finally, a new specification and verification method called SETL is proposed, which is based on event sequences and temporal logic. To illustrate the method two data transfer protocols namely, the stop-wait and alternating bit protocols are specified in SETL and verified. We demonstrate that SETL is a generalization of the hybrid techniques, it is sound and that it can be semi-automated.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

4

Li, Zheng. "A pattern-based approach to the specification and validation of web services interactions." Australasian Digital Thesis Program, 2007. http://adt.lib.swin.edu.au/public/adt-VSWT20070618.115228/index.html.

Full text

Abstract:

Thesis (MSc) - Swinburne University of Technology, Faculty of Information & Communication Technologies, 2006.
A thesis submitted to Faculty of Information and Communication Technologies, Swinburne University of Technology for the degree of Master of Science by Research, 2007. Typescript. Bibliography p. 107-112.

APA, Harvard, Vancouver, ISO, and other styles

5

Nguyen, Quoc The. "Protocols specification and validation for the movement of Grades 2 and 3 Bitstream data through the Virtual Channel Link Control layer of the return link of the CCSDS Principal Network (CPN)." Thesis, Virginia Tech, 1989. http://hdl.handle.net/10919/43293.

Full text

Abstract:

Specification of data communication protocols requirements requires a formal approach to ensure that the requirements are correctly and unambiguously specified. This research examines a proposed protocols specification for the movement of bitstream data through space segment by applying a formal definition technique known as the Language of Temporal Ordering System (LOTOS). Successful generation of the LOTOS specification to detail sequence of events and their internal structures in an implementation independent manner clarifies the requirements and provides a framework from which possible cases or events in each process can be tested. In addition, a LOTOS software tool called HIPPO is used in the research. HIPPO identifies any deadlock that could happen in the protocols and allows sequence of events to be interactively simulated to ascertain of the specification consistency.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

6

Irey, Philip Musser IV. "From specification to realization: implementing the express transfer protocol." Thesis, Virginia Tech, 1989. http://hdl.handle.net/10919/43088.

Full text

Abstract:

The research described in this thesis deals with effective protocol specification. The primary question addressed is whether the Express Transfer Protocol (XTP), a "real-time" Transport layer protocol, is sufficiently specified or are there "holes" in its specification? A new protocol evaluation process is formulated and applied to XTP in order to answer this question. The evaluation process combines a detailed analysis of the XTP specification with an attempt to implement parts of the protocol from the specification. Special attention is given to those aspects of the protocol that affect "real-time" naval tactical communications. The detailed analysis of the specification and its effect on the specification revision process are presented. The analysis is described in formal comment papers and electronic mail transmitted to the protocol designer, Dr. Greg Chesson. Elements of the protocol most applicable to tactical communication are selected for implementation. A number of assumptions are made so that an implementation can be built. The design of the prototype implementation and the assumptions made to build it are discussed. Both the hardware and software being used to build the implementation are presented. The protocol evaluation process is found to be appropriate for evaluating XTP. A comparison is made between this technique of protocol evaluation and existing techniques (i.e., simulation, complete implementation, and protocol verification). The principal conclusion of the protocol valuation process is that a number of areas of the XTP Protocol Definition (prior to Revision 3.3) are not sufficiently specified. These areas must be properly specified before a complete implementation can be built. Without a complete specification, the communications support intended for XTP is unlikely to be realized.
Master of Science

APA, Harvard, Vancouver, ISO, and other styles

7

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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

8

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

10

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.

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

11

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

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

Full text

Abstract:

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.

APA, Harvard, Vancouver, ISO, and other styles

13

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

16

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

17

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

18

Chakravorty, Sham. "An optimization analysis of frame architecture in selected protocols." Master's thesis, This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-04272010-020044/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Srivatsa, Mudhakar. "Security Architecture and Protocols for Overlay Network Services." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16284.

Full text

Abstract:

Conventional wisdom suggests that in order to build a secure system, security must be an integral component in the system design. However, cost considerations drive most system designers to channel their efforts on the system's performance, scalability and usability. With little or no emphasis on security, such systems are vulnerable to a wide range of attacks that can potentially compromise confidentiality, integrity and availability of sensitive data. It is often cumbersome to redesign and implement massive systems with security as one of the primary design goals. This thesis advocates a proactive approach that cleanly retrofits security solutions into existing system architectures. The first step in this approach is to identify security threats, vulnerabilities and potential attacks on a system or an application. The second step is to develop security tools in the form of customizable and configurable plug-ins that address these security issues and minimally modify existing system code, while preserving its performance and scalability metrics. This thesis uses overlay network applications to shepherd through and address challenges involved in supporting security in large scale distributed systems. In particular, the focus is on two popular applications: publish/subscribe networks and VoIP networks. Our work on VoIP networks has for the first time identified and formalized caller identification attacks on VoIP networks. We have identified two attacks: a triangulation based timing attack on the VoIP network's route set up protocol and a flow analysis attack on the VoIP network's voice session protocol. These attacks allow an external observer (adversary) to uniquely (nearly) identify the true caller (and receiver) with high probability. Our work on the publish/subscribe networks has resulted in the development of an unified framework for handling event confidentiality, integrity, access control and DoS attacks, while incurring small overhead on the system. We have proposed a key isomorphism paradigm to preserve the confidentiality of events on publish/subscribe networks while permitting scalable content-based matching and routing. Our work on overlay network security has resulted in a novel information hiding technique on overlay networks. Our solution represents the first attempt to transparently hide the location of data items on an overlay network.

APA, Harvard, Vancouver, ISO, and other styles

20

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Micic, Aleksandar. "Initialization protocols for TDMA in single-hop wireless network." Thesis, University of Ottawa (Canada), 2003. http://hdl.handle.net/10393/26523.

Full text

Abstract:

Although collision free TDMA schemes have been proposed and used for more than two decades, an important ingredient of these schemes, the initialization of stations (that is, assigning ID numbers 1,2,...,N) was not investigated until recently. In this thesis, we propose several new randomized and deterministic initialization methods, and measure the performance of these new and some known methods. The main contributions of this thesis are new randomized hybrid algorithms for the cases of known and unknown number of users. Performance of these algorithms was evaluated by comparing it with improved versions of existing algorithms, and an improvement from e·N to approximately 2.2·N was obtained. We also proposed the first deterministic initialization algorithms, and showed that they have comparable performance to the corresponding randomized algorithms. The initialization algorithms are then incorporated into collision free TDMA schemes, which take into account the dynamic nature of network and dynamic bandwidth requirements.

APA, Harvard, Vancouver, ISO, and other styles

22

Wong, David H. (David Hsing-Wang) 1976. "Finite state analysis with tools for network protocols." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80577.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Includes bibliographical references (p. 147).
by David H. Wong.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

23

Josephson, Colleen A. "Anonymity properties of two network coded gossip protocols." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/100592.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 113-114).
This thesis documents the design and implementation of a new anonymous communications protocol, and an analysis of an existing protocol. NCGAB, proposed by Sergeev in 2013, eciently implements broadcast over unicast and requires no pre-existing infrastructure. We propose a second protocol, CHAP, which extends NCGAB and is designed to use wireless broadcast capabilities as well as wired links. We show anonymity for some information-theoretic measures under certain assumptions regarding adversaries and trac independence. Numerical results show that for some networks NCGAB fully anonymizes up to 90% of messages, with the remaining 10% having strong anonymity properties. NCGAB also improves up to 30% upon the baseline anonymity provided by a network coded gossip protocol not optimized for anonymity. We compare CHAP to NCGAB and show that CHAP is at least as anonymous as NCGAB and also exhibits interesting hierarchical separability that allows multiple anonymity protocols to operate simultaneously in dierent domains.
by Colleen A. Josephson.
M. Eng.

APA, Harvard, Vancouver, ISO, and other styles

24

Zhang, Lixia. "A new architecture for packet switching network protocols." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14184.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1989.
GRSN 409705
Includes bibliographical references (leaves 131-135).
by Lixia Zhang.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

25

Liu, Changlei, and 劉長雷. "Bluetooth network design." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B29188635.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Ren, Fei. "Performance improvements of automobile communication protocols in electromagnetic interference environments." Diss., Rolla, Mo. : University of Missouri-Rolla, 2007. http://scholarsmine.mst.edu/thesis/pdf/Ren_09007dcc80487aed.pdf.

Full text

Abstract:

Thesis (M.S.)--University of Missouri--Rolla, 2007.
Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed March 27, 2008) Includes bibliographical references (p. 55-56).

APA, Harvard, Vancouver, ISO, and other styles

27

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Livadas, Carolos. "Formally modeling, analyzing, and designing network protocols : a case study on retransmission-based reliable multicast protocols." Thesis, Massachusetts Institute of Technology, 2003. http://hdl.handle.net/1721.1/87451.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2003.
Includes bibliographical references (p. 247-250).
In this thesis, we conduct an extensive case study on formally modeling, analyzing, and designing retransmission-based reliable multicast protocols. We first present an abstract model of the communication service that several reliable multicast protocols [12, 13, 32-34] strive to provide. This model precisely specifies i) what it means to be a member of the reliable multicast group, ii) which packets are guaranteed delivery to which members of the group, and iii) how long it takes for a packet to be reliably multicast to the appropriate members of the reliable multicast group. We then model and analyze the correctness and performance of three retransmission-based reliable multicast protocols, namely the Scalable Reliable Multicast (SRM) protocol [12, 13], the novel Caching-Enhanced Scalable Reliable Multicast (CESRM) protocol [24], and the Light-weight Multicast Services (LMS) router-assisted protocol [32-34]. We show the each such protocol is correct by proving that it is a faithful implementation of our reliable multicast service model. These correctness proofs ensure the equivalence of the protocols in the sense that they guarantee the delivery of the same packets to the same members of the reliable multicast group. Under some timeliness assumptions and presuming a fixed number of per-recovery packet drops, we show that our model of SRM guarantees the timely delivery of packets. Our timeliness analysis of SRM reveals that the careless selection of SRM's scheduling parameters may introduce superfluous recovery traffic and may undermine the loss recovery process. This is an important observation that has, to date, been overlooked.
CESRM augments SRM with a caching-based expedited recovery scheme that exploits packet loss locality in IP multicast transmissions by attempting to recover from losses in the manner in which recent losses were recovered. We analytically show that the worst-case recovery latency for successful expedited recoveries in CESRM is roughly 1 round-trip time (RTT) where as that of successful first-round recoveries in SRM is 4 RTT (for typical scheduling parameter settings). Moreover, trace-driven simulations, which exhibit the packet loss locality of actual IP multicast transmissions, reveal that CESRM reduces the average recovery latency of SRM by roughly 50% and incurs less overhead in terms of recovery traffic. Finally, although LMS recovers promptly from packets in static membership and topology environments, we demonstrate several dynamic scenarios in which LMS does not perform well. Thus, CESRM is a preferable reliable multicast protocol to both SRM and LMS; CESRM inherits SRM's robustness to dynamic environments and, thanks to its caching-based expedited recovery scheme, drastically reduces the average recovery latency of SRM in static environments.
by Carolos Livadas.
Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

32

Clayton, Richard Vincent. "Structuring and destructuring protocols." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/8492.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Alim, M. Abdul. "On the interaction of internet routing protocols." Thesis, University of Cambridge, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.609846.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Gandhi, Bhavin B. "On the coverage of grid information dissemination protocols." Diss., Online access via UMI:, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

36

McFaul, R. Elayne. "Findings of a comparison of five filing protocols /." Online version of thesis, 1991. http://hdl.handle.net/1850/11052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Erdil, Değer Cenk. "Adaptive dissemination protocols for hybrid grid resource scheduling." Diss., Online access via UMI:, 2007.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

38

Gaines, Brian Lee. "A dual-agent approach for securing routing protocols." Master's thesis, Mississippi State : Mississippi State University, 2007. http://library.msstate.edu/etd/show.asp?etd=etd-11072007-165316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Clark, R. J. (Russell J. ). "Solutions for ubiquitous information services : multiple protocols and scalable servers." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/8489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Chan, Linda. "Implementation of the Cambridge ring protocols on the sun workstation." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/24591.

Full text

Abstract:

As Local Area Networks gain momentum in recent Computer Science research, implementation is generally characterized by various factors such as efficiency, reliability, error recovery, and synchronism; however, how well the above issues can be achieved is heavily dependent on the facilities available in an implementation environment. Due to the recent popularity of message passing and concurrent processes, the UNIX 4.2bsd operating system with its interprocess communication facility is chosen to be the implementation environment for the Cambridge Ring's Basic Block and Byte Stream Protocols. Basic Block Protocol, implemented as a device driver in the system kernel, is the lowest level protocol which provides an unreliable datagram service, while the Byte Stream Protocol, implemented using multi-concurrent processes in the user space, provides a reliable, full-duplex virtual circuit service based on the service provided by the Basic Block Protocol. This thesis describes the protocol implementation on a 68000 based SUN workstation, and discusses results learnt from the experiment. The multi-concurrent processes approach is found to work adequately well for a small number of clients, but incur high overhead when the number of clients is large.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

41

Sala, Dolors. "Design and evaluation of MAC protocols for hybrid fiber/coaxial systems." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/13268.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Yan, Wei. "Synchronization, buffer management, and multicast routing in multimedia networks." Diss., Georgia Institute of Technology, 1997. http://hdl.handle.net/1853/13426.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Hui, Pan, and 許彬. "UNO: enabling person-centered and person-based computing." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B30150681.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

龍浩生 and Ho-sang Anthony Loong. "Improvements on system support for network protocol infrastructure development." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1994. http://hub.hku.hk/bib/B31211719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Loong, Ho-sang Anthony. "Improvements on system support for network protocol infrastructure development /." [Hong Kong : University of Hong Kong], 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13730873.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Huang, Yan. "Efficient transaction processing in broadcast-based asymmetric communication environments." [Gainesville, Fla.] : University of Florida, 2001. http://purl.fcla.edu/fcla/etd/UFE0000323.

Full text

Abstract:

Thesis (Ph. D.)--University of Florida, 2001.
Title from title page of source document. Document formatted into pages; contains xvi, 186 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

47

Lim, Jaeyong. "Fast and scalable Internet service scheme for static and dynamic web data contents." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Tong, Darren Pong-Choi. "Implementation of a protocol validation and synthesis system." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/25061.

Full text

Abstract:

VALISYN, an automated system for the validation and synthesis of error-free protocols has been implemented in C language. It assists designers in the detection and prevention of various kinds of potential design errors, such as state deadlocks, non-executable interactions, unspecified receptions and state ambiguities. The technique employed is a stepwise application of a set of production rules which guarantee complete reception capability. These rules are implemented in a tracking algorithm, which prevents the formation of non-executable interactions and unspecified receptions, and which monitors the existence of state deadlocks and state ambiguities. The implementation of VALISYN is discussed and a number of protocol validation and synthesis examples are presented to illustrate its use and features.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

49

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!