Dissertations / Theses on the topic 'Computer network protocols – Testing'
To see the other types of publications on this topic, follow the link: Computer network protocols – Testing.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Computer network protocols – Testing.'
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
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.
Full textAbstract:
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
2
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 textAbstract:
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
3
Lo, Jeffrey Kin Hung. "Open systems interconnection passive monitor OSI-PM." Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/29418.
Full textAbstract:
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
4
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 textAbstract:
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
5
Wvong, Russil. "A new methodology for OSI conformance testing based on trace analysis." Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/29343.
Full textAbstract:
This thesis discusses the problems of the conventional ISO 9646 methodology for OSI conformance testing, and proposes a new methodology based on trace analysis. In the proposed methodology, a trace analyzer is used to determine whether the observed behavior of the implementation under test is valid or invalid. This simplifies test cases dramatically, since they now need only specify the expected behavior of the IUT; unexpected behavior is checked by the trace analyzer. Test suites become correspondingly smaller. Because of this reduction in size and complexity, errors in test suites can be found and corrected far more easily. As a result, the reliability and the usefulness of the conformance testing process are greatly enhanced.
In order to apply the proposed methodology, trace analyzers are needed. Existing trace analyzers are examined, and found to be unsuitable for OSI conformance testing. A family of new trace analysis algorithms is presented and proved.
To verify the feasibility of the proposed methodology, and to demonstrate
its benefits, it is applied to a particular protocol, the LAPB protocol specified by ISO 7776. The design and implementation of a trace analyzer
for LAPB are described. The conventional ISO 8882-2 test suite for LAPB, when rewritten to specify only the expected behavior of the IUT, is found to be more than an order of magnitude smaller.Science, Faculty of
Computer Science, Department of
Graduate
6
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
7
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 textAbstract:
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.
8
Foulkes, Philip James. "An investigation into the control of audio streaming across networks having diverse quality of service mechanisms." Thesis, Rhodes University, 2012. http://hdl.handle.net/10962/d1004865.
Full textAbstract:
The transmission of realtime audio data across digital networks is subject to strict quality of service requirements. These networks need to be able to guarantee network resources (e.g., bandwidth), ensure timely and deterministic data delivery, and provide time synchronisation mechanisms to ensure successful transmission of this data. Two open standards-based networking technologies, namely IEEE 1394 and the recently standardised Ethernet AVB, provide distinct methods for achieving these goals. Audio devices that are compatible with IEEE 1394 networks exist, and audio devices that are compatible with Ethernet AVB networks are starting to come onto the market. There is a need for mechanisms to provide compatibility between the audio devices that reside on these disparate networks such that existing IEEE 1394 audio devices are able to communicate with Ethernet AVB audio devices, and vice versa. The audio devices that reside on these networks may be remotely controlled by a diverse set of incompatible command and control protocols. It is desirable to have a common network-neutral method of control over the various parameters of the devices that reside on these networks. As part of this study, two Ethernet AVB systems were developed. One system acts as an Ethernet AVB audio endpoint device and another system acts as an audio gateway between IEEE 1394 and Ethernet AVB networks. These systems, along with existing IEEE 1394 audio devices, were used to demonstrate the ability to transfer audio data between the networking technologies. Each of the devices is remotely controllable via a network neutral command and control protocol, XFN. The IEEE 1394 and Ethernet AVB devices are used to demonstrate the use of the XFN protocol to allow for network neutral connection management to take place between IEEE 1394 and Ethernet AVB networks. User control over these diverse devices is achieved via the use of a graphical patchbay application, which aims to provide a consistent user interface to a diverse range of devices.
9
Mirza, Aamir Mehmood, and Mohtashim Khan. "Ethernet Network Functionality Testing." Thesis, Halmstad University, School of Information Science, Computer and Electrical Engineering (IDE), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-3720.
Full textAbstract:
Ethernet functionality testing as a generic term used for checking connectivity,throughput and capability to transfer packets over the network. Especially in the packet-switchenvironment, Ethernet testing has become an essential part for deploying a reliable network.Over a long distance Ethernet testing parameter for analyzing network performance must havetwo devices attached and synchronized.
Saab Microwave Systems is among the leading suppliers of radar systems developing groundbased,naval and air-borne radar systems. To ensure the correct functionality, the developerwants to verify the performance of computer network and looking for a suitable solution.
A software application is required to verify and test the functionality of the Ethernet network andto verify the functionality and performance of the TCP/IP stack of newly added node. Theprograms shall be easily ported to different operating systems and must not depend on specificproduct properties.A software application, “NetBurst”, is developed for Ethernet functionality testing. Theapplication is vendor and platform independent.
10
Shu, Guoqiang. "Formal Methods and Tools for Testing Communication Protocol System Security." The Ohio State University, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=osu1211333211.
Full text
11
Deng, Xianglin. "Security of VoIP : Analysis, Testing and Mitigation of SIP-based DDoS attacks on VoIP Networks." Thesis, University of Canterbury. Computer Science and Software Engineering, 2008. http://hdl.handle.net/10092/2227.
Full textAbstract:
Voice over IP (VoIP) is gaining more popularity in today‟s communications. The Session Initiation Protocol (SIP) is becoming one of the dominant VoIP signalling protocol[1, 2], however it is vulnerable to many kinds of attacks. Among these attacks, flood-based denial of service attacks have been identified as the major threat to SIP. Even though a great deal of research has been carried out to mitigate denial of service attacks, only a small proportion has been specific to SIP. This project examines the way denial of service attacks affect the performance of a SIP-based system and two evolutionary solutions to this problem that build on each other are proposed with experimental results to demonstrate the effectiveness of each solution. In stage one, this project proposes the Security-Enhanced SIP System (SESS), which contains a security-enhanced firewall, which evolved from the work of stage one and a security-enhanced SIP proxy server. This approach helps to improve the Quality-of-Service (QoS) of legitimate users during the SIP flooding attack, while maintaining a 100 percent success rate in blocking attack traffic. However, this system only mitigates SIP INVITE and REGISTER floods. In stage two, this project further advances SESS, and proposes an Improved Security-Enhanced SIP System (ISESS). ISESS advances the solution by blocking other SIP request floods, for example CANCEL, OK and BYE flood. JAIN Service Logic Execution Environment (JAIN SLEE) is a java-based application server specifically designed for event-driven applications. JAIN SLEE is used to implement enhancements of the SIP proxy server, as it is becoming a popular choice in implementing communication applications. The experimental results show that during a SIP flood, ISESS cannot only drop all attack packets but also the call setup delay of legitimate users can be improved substantially compared to and unsecured VoIP system.
12
Rana, Chirag N. "Enabling One-Phase Commit (1PC) Protocol for Web Service Atomic Transaction (WS-AT)." UNF Digital Commons, 2014. http://digitalcommons.unf.edu/etd/498.
Full textAbstract:
Business transactions (a.k.a., business conversations) are series of message exchanges that occur between software applications coordinating to achieve a business objective. Web service has been proven to be a promising technology in supporting business transactions. Business transaction can either be long-running or short-lived. A transaction whether in a database or web service paradigm consists of an “all-or-nothing” property. A transaction could either succeed or fail. Web Service Atomic Transactions (WS-AT) is a specification that currently supports Two-Phase Commit (2PC) protocol in a short-lived transaction. WS-AT is developed by OASIS–a standards development organization. However, not all business process scenarios require a 2PC, in that case, just a One-Phase Commit (1PC) would be sufficient. But unfortunately, WS-AT currently does not support 1PC optimization.
The ideal scenario where 1PC can be used instead of 2PC is when there is only a single participant. Short-lived transactions involving only one participant can commit without requiring initial “prepare” phase. Thus, there is no overhead to check whether the participant is prepared to either commit or rollback. This research focuses on designing a mechanism that can add 1PC support in WS-AT. The technical implementation of this mechanism is developed by using JBoss Transaction API. As a part of this thesis, 1PC mechanism for a single participant scenario was implemented. This mechanism optimizes the web service transaction process in terms of overhead and performance in terms of execution time. The technical implementation solution for 1PC mechanism was evaluated using three different business process scenarios in a controlled experiment as a presence or absence test. Evaluation results show that 1PC mechanism has a lower mean for execution time and performed significantly better than 2PC mechanism. Based on the contributions made by this thesis, we recommend OASIS to consider including 1PC mechanism as a part of the WS-AT specification.
13
Halfond, William G. J. "Program analysis to support quality assurance techniques for web applications." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/33930.
Full textAbstract:
As web applications occupy an increasingly important role in the day-to-day lives of millions of people, testing and analysis techniques that ensure that these applications function with a high level of quality are becoming even more essential. However, many software quality assurance techniques are not directly applicable to modern web applications. Certain characteristics, such as the use of HTTP and generated object programs, can make it difficult to identify software abstractions used by traditional quality assurance techniques. More generally, many of these abstractions are implemented differently in web applications, and the lack of techniques to identify them complicates the application of existing quality assurance techniques to web applications.
This dissertation describes the development of program analysis techniques for modern web applications and shows that these techniques can be used to improve quality assurance. The first part of the research focuses on the development of a suite of program analysis techniques that identifies useful abstractions in web applications. The second part of the research evaluates whether these program analysis techniques can be used to successfully adapt traditional quality assurance techniques to web applications, improve existing web application quality assurance techniques, and develop new techniques focused on web application-specific issues. The work in quality assurance techniques focuses on improving three different areas: generating test inputs, verifying interface invocations, and detecting vulnerabilities. The evaluations of the resulting techniques show that the use of the program analyses results in significant improvements in existing quality assurance techniques and facilitates the development of new useful techniques.
14
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 textAbstract:
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.
15
Perlman, Radia Joy. "Network layer protocols with Byzantine robustness." Thesis, Massachusetts Institute of Technology, 1988. http://hdl.handle.net/1721.1/14403.
Full text
16
Potnuru, Srinath. "Fuzzing Radio Resource Control messages in 5G and LTE systems : To test telecommunication systems with ASN.1 grammar rules based adaptive fuzzer." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-294140.
Full textAbstract:
5G telecommunication systems must be ultra-reliable to meet the needs of the next evolution in communication. The systems deployed must be thoroughly tested and must conform to their standards. Software and network protocols are commonly tested with techniques like fuzzing, penetration testing, code review, conformance testing. With fuzzing, testers can send crafted inputs to monitor the System Under Test (SUT) for a response. 3GPP, the standardization body for the telecom system, produces new versions of specifications as part of continuously evolving features and enhancements. This leads to many versions of specifications for a network protocol like Radio Resource Control (RRC), and testers need to constantly update the testing tools and the testing environment. In this work, it is shown that by using the generic nature of RRC specifications, which are given in Abstract Syntax Notation One (ASN.1) description language, one can design a testing tool to adapt to all versions of 3GPP specifications. This thesis work introduces an ASN.1 based adaptive fuzzer that can be used for testing RRC and other network protocols based on ASN.1 description language. The fuzzer extracts knowledge about ongoing RRC messages using protocol description files of RRC, i.e., RRC ASN.1 schema from 3GPP, and uses the knowledge to fuzz RRC messages. The adaptive fuzzer identifies individual fields, sub-messages, and custom data types according to specifications when mutating the content of existing messages. Furthermore, the adaptive fuzzer has identified a previously unidentified vulnerability in Evolved Packet Core (EPC) of srsLTE and openLTE, two open-source LTE implementations, confirming the applicability to robustness testing of RRC and other network protocols.5G-telekommunikationssystem måste vara extremt tillförlitliga för att möta behoven för den kommande utvecklingen inom kommunikation. Systemen som används måste testas noggrant och måste överensstämma med deras standarder. Programvara och nätverksprotokoll testas ofta med tekniker som fuzzing, penetrationstest, kodgranskning, testning av överensstämmelse. Med fuzzing kan testare skicka utformade input för att övervaka System Under Test (SUT) för ett svar. 3GPP, standardiseringsorganet för telekomsystemet, producerar ofta nya versioner av specifikationer för att möta kraven och bristerna från tidigare utgåvor. Detta leder till många versioner av specifikationer för ett nätverksprotokoll som Radio Resource Control (RRC) och testare behöver ständigt uppdatera testverktygen och testmiljön. I detta arbete visar vi att genom att använda den generiska karaktären av RRC-specifikationer, som ges i beskrivningsspråket Abstract Syntax Notation One (ASN.1), kan man designa ett testverktyg för att anpassa sig till alla versioner av 3GPP-specifikationer. Detta uppsatsarbete introducerar en ASN.1-baserad adaptiv fuzzer som kan användas för att testa RRC och andra nätverksprotokoll baserat på ASN.1- beskrivningsspråk. Fuzzer extraherar kunskap om pågående RRC meddelanden med användning av protokollbeskrivningsfiler för RRC, dvs RRC ASN.1 schema från 3GPP, och använder kunskapen för att fuzz RRC meddelanden. Den adaptiva fuzzer identifierar enskilda fält, delmeddelanden och anpassade datatyper enligt specifikationer när innehållet i befintliga meddelanden muteras. Dessutom har den adaptiva fuzzer identifierat en tidigare oidentifierad sårbarhet i Evolved Packet Core (EPC) för srsLTE och openLTE, två opensource LTE-implementeringar, vilket bekräftar tillämpligheten för robusthetsprovning av RRC och andra nätverksprotokoll.
17
Ford, Daniel Alexander. "Semi-automatic implementation of network protocols." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/24665.
Full textAbstract:
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
18
Myburgh, W. D. "Development of a tool to test computer protocols." Thesis, Stellenbosch : Stellenbosch University, 2003. http://hdl.handle.net/10019.1/53363.
Full textAbstract:
Thesis (MSc) -- Stellenbosch University, 2003.ENGLISH ABSTRACT: Software testing tools simplify and automate the menial work associated with testing. Moreover, for complex concurrent software such as computer protocols, testing tools allow testing on an abstract level that is independent of specific implementations. Standard conformance testing methodologies and a number of testing tools are commercially available, but detailed descriptions of the implementation of such testing tools are not widely available. This thesis investigates the development of a tool for automated protocol testing in the ETH Oberon development environment. The need to develop a protocol testing tool that automates the execution of specified test cases was identified in collaboration with a local company that develops protocols in the programming language Oberon. Oberon is a strongly typed secure language that supports modularisation and promotes a readable programming style. The required tool should translate specified test cases into executable test code supported by a runtime environment. A test case consists of a sequence of input actions to which the software under test is expected to respond by executing observable output actions. A number of issues are considered of which the first is concerned with the representation of test case specifications. For this, a notation was used that is basically a subset of the test specification language TTCN-3 as standardised by the European Telecommunications Standards Institute. The second issue is the format of executable test cases and a suitable runtime environment. A translator was developed that generates executable Oberon code from specified test cases. The compiled test code is supported by a runtime library, which is part of the tool. Due to the concurrent nature of a protocol environment, concurrent processes in the runtime environment are identified. Since ETH Oberon supports multitasking in a limited sense, test cases are executed as cooperating background tasks. The third issue is concerned with the interaction between an executing test case and a system under test. It is addressed by an implementation dependent interface that maps specified test interactions onto real interactions as required by the test context in which an implementation under test operates. A supporting protocol to access the service boundary of an implementation under test remotely and underlying protocol service providers are part of a test context. The ETH Oberon system provides a platform that simplifies the implementation of protocol test systems, due to its size and simple task mechanism. Operating system functionality considered as essential is pointed out in general terms since other systems could be used to support such testing tools. In conclusion, directions for future work are proposed.
AFRIKAANSE OPSOMMING: Toetsstelsels vir programmatuur vereenvoudig en outomatiseer die slaafse werk wat met toetsing assosieer word. 'n Toetsstelsel laat verder toe dat komplekse gelyklopende programmatuur, soos rekenaarprotokolle, op 'n abstrakte vlak getoets word, wat onafhanklik van spesifieke implementasies is. Daar bestaan standaard metodes vir konformeringstoetsing en 'n aantal toetsstelsels is kommersiëel beskikbaar. Uitvoerige beskrywings van die implementering van sulke stelsels is egter nie algemeen beskikbaar nie. Hierdie tesis ondersoek die ontwikkeling van 'n stelsel vir outomatiese toetsing van protokolle in die ontwikkelingsomgewing van ETH Oberon. Die behoefte om 'n protokoltoetsstelsel te ontwikkel, wat die uitvoering van gespesifiseerde toetsgevalle outomatiseer, is geïdentifiseer in oorleg met 'n plaaslike maatskappy wat protokolle ontwikkel in die Oberon programmeertaal. Oberon is 'n sterkgetipeerde taal wat modularisering ondersteun en a leesbare programmeerstyl bevorder. Die toestsstelsel moet gespesifiseerde toetsgevalle vertaal na uitvoerbare toetskode wat ondersteun word deur 'n looptydomgewing. 'n Toetsgeval bestaan uit 'n reeks van toevoeraksies waarop verwag word dat die programmatuur wat getoets word, sal reageer deur die uitvoering van afvoeraksies wat waargeneem kan word. 'n Aantal kwessies word aangeraak, waarvan die eerste te make het met die voorstelling van die spesifikasie van toetsgevalle. Hiervoor is 'n notasie gebruik wat in wese 'n subversameling van die toetsspesifikasietaal TTCN-3 is. TTCN-3 is gestandardiseer deur die European Telecommunications Standards Institute. Die tweede kwessie is die formaat van uitvoerbare toetsgevalle en 'n geskikte looptydomgewing. 'n Vertaler is ontwikkel wat uitvoerbare Oberon-kode genereer vanaf gespesifiseerde toetsgevalle. Die vertaalde toetskode word ondersteun deur 'n biblioteek van looptydfunksies, wat deel van die stelsel is. As gevolg van die eienskap dat 'n protokolomgewing uit gelyklopende prosesse bestaan, word daar verskillende tipes van gelyklopende prosesse in 'n protokoltoetsstelsel geïdentifiseer. Aangesien ETH Oberon 'n beperkte multitaakstelsel is, word toetsgevalle vertaal na eindige outomate wat uitgevoer word as samewerkende agtergrondtake. Die derde kwessie het te make met die interaksie tussen 'n toetsgeval wat uitgevoer word en die stelsel wat getoets word. Dit word aangespreek deur 'n koppelvlak wat gespesifiseerde interaksies afbeeld op werklike interaksies soos vereis deur die konteks waarin 'n implementasie onderworpe aan toetsing uitvoer. 'n Ondersteunende protokolom die dienskoppelvlak van die implementasie oor 'n afstand te bereik en ander onderliggende protokoldienste is deel van 'n toetskonteks. Die ETH Oberon-stelsel help in die vereenvoudiging van die implementasie van protokol toetsstelsels, as gevolg van die stelsel se grootte en die eenvoudige taakhanteerder . Die essensiële funksionaliteit van bedryfsstelsels word uitgelig in algemene terme omdat ander stelsels gebruik kan word om toetsstelsels te ondersteun. Ten slotte word voorstelle vir opvolgwerk gemaak.
19
Lu, Ching-sung. "Automated validation of communication protocols /." The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu148726702499786.
Full text
20
alyanbaawi, ashraf. "DESIGN OF EFFICIENT MULTICAST ROUTING PROTOCOLS FOR COMPUTER NETWORKS." OpenSIUC, 2020. https://opensiuc.lib.siu.edu/dissertations/1775.
Full textAbstract:
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.
21
Sundaresan, Latha. "Simple network management protocol /." Online version of thesis, 1995. http://hdl.handle.net/1850/12254.
Full text
22
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
23
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
24
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
25
Srivatsa, Mudhakar. "Security Architecture and Protocols for Overlay Network Services." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16284.
Full textAbstract:
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.
26
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
27
Micic, Aleksandar. "Initialization protocols for TDMA in single-hop wireless network." Thesis, University of Ottawa (Canada), 2003. http://hdl.handle.net/10393/26523.
Full textAbstract:
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.
28
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 textAbstract:
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.
29
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 textAbstract:
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.
30
Zhang, Lixia. "A new architecture for packet switching network protocols." Thesis, Massachusetts Institute of Technology, 1989. http://hdl.handle.net/1721.1/14184.
Full textAbstract:
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.
31
Liu, Changlei, and 劉長雷. "Bluetooth network design." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2003. http://hub.hku.hk/bib/B29188635.
Full text
32
Coudron, Matthew Ryan. "Entangled protocols and non-local games for testing quantum systems." Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/111879.
Full textAbstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 177-184).
The field of quantum computing investigates the extent to which one can design a quantum system that outperforms all known classical hardware at a certain task. But, to what extent can a human being, capable only (perhaps) of classical computation and of observing classical bit-string messages, verify that a quantum device in their possession is performing the task that they wish? This is a fundamental question about the nature of quantum mechanics, and the extent to which humans can harness it in a trustworthy manner. It is also a natural and important consideration when quantum devices may be used to perform sensitive cryptographic tasks which have no known efficient classical witness of correctness (Quantum Key Distribution, and Randomness Expansion are two examples of such tasks). It is remarkable that any quantum behavior at all can be tested by a verifier under such a constraint, without trusting any other quantum mechanical device in the process! But, intriguingly, when there are two or more quantum provers available in an interactive proof, there exist protocols to verify many interesting and useful quantum tasks in this setting. This thesis investigates multi-prover interactive proofs for verifying quantum behavior, and focuses on the stringent testing scenario in which the verifier in the interactive proof is completely classical as described above. It resolves the question of the maximum attainable expansion rate of a randomness expansion protocol by providing an adaptive randomness expansion protocol that achieves an arbitrary, or infinite rate of randomness expansion [29]. Secondly it presents a new rigidity result for the parallel repeated magic square game [24], which provides some improvements on previous rigidity results that play a pivotal role in existing interactive proofs for entangled provers, QKD, and randomness expansion results. This new rigidity result may be useful for improving such interactive proofs in the future. The second half of this thesis investigates the problem of bounding the role of quantum entanglement in non-local processes. This is important for understanding the upper limit on the power of multi-prover interactive proof systems with entangled provers. In particular it establishes that, assuming the Strong Kirchberg Conjecture, one can provide a doubly exponential upper bound on the class MIP* [25] (for comparison, the best known unconditional upper bound on MIP* is that its languages are recursively enumerable!). Finally this thesis presents a result which characterizes the type of entanglement that is useful in entanglement assisted quantum communication complexity by showing that any communication protocol using arbitrary shared entanglement can be simulated by a protocol using only EPR pairs for shared entanglement. Therefore all quantum communication protocols can be approximately simulated by a protocol using only the maximally entangled state as a shared resource.
by Matthew Ryan Coudron.
Ph. D.
33
Coudron, Matthew Ryan. "Entangled protocols and non-local games for testing quantum systems." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/111879.
Full textAbstract:
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.Cataloged from PDF version of thesis.
Includes bibliographical references (pages 177-184).
The field of quantum computing investigates the extent to which one can design a quantum system that outperforms all known classical hardware at a certain task. But, to what extent can a human being, capable only (perhaps) of classical computation and of observing classical bit-string messages, verify that a quantum device in their possession is performing the task that they wish? This is a fundamental question about the nature of quantum mechanics, and the extent to which humans can harness it in a trustworthy manner. It is also a natural and important consideration when quantum devices may be used to perform sensitive cryptographic tasks which have no known efficient classical witness of correctness (Quantum Key Distribution, and Randomness Expansion are two examples of such tasks). It is remarkable that any quantum behavior at all can be tested by a verifier under such a constraint, without trusting any other quantum mechanical device in the process! But, intriguingly, when there are two or more quantum provers available in an interactive proof, there exist protocols to verify many interesting and useful quantum tasks in this setting. This thesis investigates multi-prover interactive proofs for verifying quantum behavior, and focuses on the stringent testing scenario in which the verifier in the interactive proof is completely classical as described above. It resolves the question of the maximum attainable expansion rate of a randomness expansion protocol by providing an adaptive randomness expansion protocol that achieves an arbitrary, or infinite rate of randomness expansion [29]. Secondly it presents a new rigidity result for the parallel repeated magic square game [24], which provides some improvements on previous rigidity results that play a pivotal role in existing interactive proofs for entangled provers, QKD, and randomness expansion results. This new rigidity result may be useful for improving such interactive proofs in the future. The second half of this thesis investigates the problem of bounding the role of quantum entanglement in non-local processes. This is important for understanding the upper limit on the power of multi-prover interactive proof systems with entangled provers. In particular it establishes that, assuming the Strong Kirchberg Conjecture, one can provide a doubly exponential upper bound on the class MIP* [25] (for comparison, the best known unconditional upper bound on MIP* is that its languages are recursively enumerable!). Finally this thesis presents a result which characterizes the type of entanglement that is useful in entanglement assisted quantum communication complexity by showing that any communication protocol using arbitrary shared entanglement can be simulated by a protocol using only EPR pairs for shared entanglement. Therefore all quantum communication protocols can be approximately simulated by a protocol using only the maximally entangled state as a shared resource.
by Matthew Ryan Coudron.
Ph. D.
34
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 textAbstract:
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).
35
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
36
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
37
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
38
Alexander, David. "A Network Metadata Infrastructure for Locating Network Devices." Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1088176648.
Full text
39
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 textAbstract:
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.
40
Clayton, Richard Vincent. "Structuring and destructuring protocols." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/8492.
Full text
41
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
42
Chen, Nanxing. "Passive interoperability testing for communication protocols." Phd thesis, Université Rennes 1, 2013. http://tel.archives-ouvertes.fr/tel-00869819.
Full textAbstract:
In the field of networking, testing of communication protocols is an important activity to validate protocol applications before commercialisation. Generally, the services that must be provided by a protocol are described in its specification(s). A specification is generally a standard defined by standards bodies such as ISO (International Standards Organization), IETF (Internet Engineering Task Force), ITU (International Telecommunication Union), etc. The purpose of testing is to verify that the protocol implementations work correctly and guarantee the quality of the services in order to meet customers expectations. To achieve this goal, a variety of testing methods have been developed. Among them, interoperability testing is to verify that several network components cooperate correctly and provide expected services. Conformance testing verifies that a product conforms to its specification. Robustness testing determines the degree to which a system operates correctly in the presence of exceptional inputs or stressful environmental conditions. In this thesis, we focus on interoperability testing. The general architecture of interoperability testing involves a system under test (SUT), which consists of at least two implementations under test (IUT). The objectives of interoperability testing are to ensure that interconnected protocol implementations are able to interact correctly and, during their interaction, provide the services predefined in their specifications. In general, the methods of interoperability testing can be classified into two approaches: active and passive testing. Among them, active test is the most conventionally used technique, which aims to test the implementations (IUT) by injecting a series of test messages (stimuli) and observing the corresponding outputs. However, the intrusive nature of active testing is that the tester has the ability to control IUTS. This implies that the tester interrupts inevitably the normal operations of the system under test. In this sense, active testing is not a suitable technique for interoperability testing, which is often carried out in operational networks. In such context, it is difficult to insert arbitrary testing messages without affecting the normal behavior and the services of the system. On the contrary, passive testing is a technique based only on observation. The tester does not need to interact with the SUT. This allows the test to be carried out without disturbing the normal operations of the system under test. Besides, passive testing also has other advantages such as: for embedded systems to which the tester does not have direct access, test can still be performed by collecting the execution traces of the system and then detect errors by comparing the trace with the behavior of the system described in its specification. In addition, passive testing makes it possible to moniter a system over a long period, and report abnomality at any time.
43
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
44
Gandhi, Bhavin B. "On the coverage of grid information dissemination protocols." Diss., Online access via UMI:, 2005.
Find full text
45
McFaul, R. Elayne. "Findings of a comparison of five filing protocols /." Online version of thesis, 1991. http://hdl.handle.net/1850/11052.
Full text
46
Erdil, Değer Cenk. "Adaptive dissemination protocols for hybrid grid resource scheduling." Diss., Online access via UMI:, 2007.
Find full text
47
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
48
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
49
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 textAbstract:
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
50
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 textAbstract:
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