Dissertations / Theses: 'BGP (Computer network protocol)'

1

Nguyen, Lien K. "Predicting catastrophic BGP routing instablities /." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FNguyen.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Nguyen, Lien K. "Predicting catastrophic BGP routing instabilities." Thesis, Monterey, California. Naval Postgraduate School, 2004. http://hdl.handle.net/10945/1642.

Full text

Abstract:

Approved for public release, distribution is unlimited
Inter-domain routing connects individual pieces of Internet topology, creating an integral, global data delivery infrastructure. Currently, this critical function is performed by the Border Gateway Protocol (BGP) version 4 [RFC1771]. Like all routing protocols, BGP is vulnerable to instabilities that reduce its effectiveness. Among the causes of these instabilities are those which are maliciously induced. Although there are other causes, e.g., natural events and network anomalies, this thesis will focus exclusively on maliciously induced instabilities. Most current models that attempt to predict a BGP routing instability confine their focus to either macro- or micro-level metrics, but not to both. The inherent limitations of each of these forms of metric gives rise to an excessive rate of spurious alerts, both false positives and false negatives. It is the original intent of this thesis to develop an improved BGP instability prediction model by statistically combining BGP instability metrics with user level performance metrics. The motivation for such a model is twofold. 1) To provide sufficient prior warning of impending failure to facilitate proactive protection measures. 2) To improve warning reliability beyond existing models, by demonstrably reducing both false positives and false negatives. However, our analysis of actual network trace data shows that a widely used BGP instability metric, the total number of update messages received in a time period, is not a good indicator of future user level performance.
Civilian, Department of Defense

APA, Harvard, Vancouver, ISO, and other styles

3

Lam, Fung. "Internet inter-domain traffic engineering and optimizatioon /." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk:8888/cgi-bin/hkuto%5Ftoc%5Fpdf?B23273173.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

White, Cory B. "A Neural Network Approach to Border Gateway Protocol Peer Failure Detection and Prediction." DigitalCommons@CalPoly, 2009. https://digitalcommons.calpoly.edu/theses/215.

Full text

Abstract:

The size and speed of computer networks continue to expand at a rapid pace, as do the corresponding errors, failures, and faults inherent within such extensive networks. This thesis introduces a novel approach to interface Border Gateway Protocol (BGP) computer networks with neural networks to learn the precursor connectivity patterns that emerge prior to a node failure. Details of the design and construction of a framework that utilizes neural networks to learn and monitor BGP connection states as a means of detecting and predicting BGP peer node failure are presented. Moreover, this framework is used to monitor a BGP network and a suite of tests are conducted to establish that this neural network approach as a viable strategy for predicting BGP peer node failure. For all performed experiments both of the proposed neural network architectures succeed in memorizing and utilizing the network connectivity patterns. Lastly, a discussion of this framework's generic design is presented to acknowledge how other types of networks and alternate machine learning techniques can be accommodated with relative ease.

APA, Harvard, Vancouver, ISO, and other styles

5

Lam, Fung, and 林峰. "Internet inter-domain traffic engineering and optimizatioon." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31224581.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Novák, Adrián. "Modelování a simulace BGP." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2019. http://www.nusl.cz/ntk/nusl-403147.

Full text

Abstract:

This Master's thesis deals with modeling and simulation of BGP protocol within the OMNeT++ environment. The BGP protocol is described with employed data structures and the finite state machine of BGP peering. Next, the basic configuration is outlined involving the setup of the BGP protocol on Cisco devices. Further, BGP for OMNeT++ state-of-the-art is investigated together with its lack of functionality and issues. The second part of this thesis deals with design, implementation, and testing of the new functionality of BGP protocol and simulation models. The last section describes the overall achieved results.

APA, Harvard, Vancouver, ISO, and other styles

7

Jacquemart, Quentin. "Déceler les attaques par détournement BGP." Thesis, Paris, ENST, 2015. http://www.theses.fr/2015ENST0063/document.

Full text

Abstract:

Internet est constitué de milliers de systèmes autonomes (Autonomous Systems, AS) qui échangent des informations de routage grâce au protocole BGP (Border Gateway Protocol). Chaque AS attend des autres qu'il lui donne des informations de routage correctes, et leur accorde donc une confiance totale. Le détournement de préfixe (prefix hijacking) exploite cette confiance afin d'introduire des routes falsifiées. Les techniques qui détectent cette attaque génèrent un nombre important d'alertes, composé de faux positifs résultant d'opérations de routage courantes. Dans cette dissertation, nous cherchons à trouver la cause principale de ces alertes, de manière indubitable. A cette fin, d'une part, nous réduisons le nombre d'alertes en analysant en profondeur ces réseaux, dont nous dérivons une série de structures qui reflètent les pratiques standard de routage du monde réel, et en considérant le risque associé à ces structures lors une attaque par détournement. D'autre part, nous utilisons des bases de données auxiliaires qui nous permettent de connaître la raison derrière un évènement de routage, qui n'est, en général, connue que du propriétaire du réseau. Précisément, nous regardons les préfixes à origines multiples (Multiple Origin AS, MOAS), et mettons en évidence une classification nous permettant d'éliminer 80% des alertes. Nous présentons un cas réel où un MOAS coïncide avec du spam et des sites d'arnaque en ligne. Nous étudions les préfixes non-disjoints, et présentons un prototype permettant d'éliminer 50% des alertes sub-MOAS.Nous explorons l'espace IP non assigné, cherchons des adresses IP joignables, et localisons une grande quantité de spam et des sites d'arnaques en ligne
The Internet is composed of tens of thousands Autonomous Systems (ASes) that exchange routing information using the Border Gateway Protocol (BGP). Consequently, every AS implicitly trusts every other ASes to provide accurate routing information. Prefix hijacking is an attack against the inter-domain routing infrastructure that abuses mutual trust in order to propagate fallacious routes. The current detection techniques pathologically raise a large number of alerts, mostly composed of false positives resulting from benign routing practices. In this Dissertation, we seek the root cause of routing events beyond reasonable doubts. First, we reduce the global number of alerts by analyzing false positive alerts, from which we extract constructs that reflect real-world standard routing practices. We then consider the security threat associated with these constructs in a prefix hijacking scenario. Second, we use a variety of auxiliary datasets that reflect distinct facets of the networks involved in a suspicious routing event in order to closely approximate the ground-truth, which is traditionally only known by the network owner. Specifically, we investigate Multiple Origin AS (MOAS) prefixes, and introduce a classification that we use to discard up to 80% of false positive. Then we show a real-world case where a MOAS coincided with spam and web scam traffic. We look at prefix overlaps, clarify their global use, and present a prototype that discards around 50% of false positive sub-MOAS alerts. Finally, we explore the IP blackspace, study the routing-level characteristics of those networks, find live IP addresses, and uncover a large amount of spam and scam activities

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

Karlsson, Jimmy. "Border Gateway Protocol : Implementationer på stubnätverk." Thesis, University of Skövde, School of Humanities and Informatics, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-4062.

Full text

Abstract:

Arbetet tar upp BGP-multihoming för mindre organisationer. Den jämför ett kommersiell alternativ mot open source-alternativ. Detta är för att se vad som krävs en av open source-lösning för ge konkurrens på routermarknaden, samt besparingar för organisationer som ska använda denna lösning.Praktiska och teoretiska jämförelser görs där Cisco-lösningar jämförs med OpenBGPD. Datan utifrån dessa tester används för att svara på problemfrågan. Sammanfattningsvis har open source produkter en fördel hårdvarumässigt på grund av lägre kostnader medan kommersiella har stora fördelar då de förlitar sig på nyare standarder.

APA, Harvard, Vancouver, ISO, and other styles

10

Frisk, Johan. "Cross Continental Access of Information and the Boarder Gateway Protocol." Thesis, Linköpings universitet, Databas och informationsteknik, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153880.

Full text

Abstract:

The usage of technical equipment and the interconnection of all these devices has become essential to our every day life and to provide as good service as possible for the internet of today. However, many have the opportunity to inspect the data as it is being rushed across the globe to provide users with information at the press of a button. This study examines the routing patterns from hundred thousands of trace routes going from user to server around the globe. Using this trace data, we demonstrate not only the number of companies involved in data transfers on other continents then where they are currently not residing, but also give some insight into the amount of routes pertaining to same continent data transfers which takes paths not contained within that same continent. In doing so, we try to explain the inner workings of the protocols used within the process of data transfer, answer a number of security related questions regarding the protocols used, as well as discuss which other circumstances can affect the decision making process.

APA, Harvard, Vancouver, ISO, and other styles

11

Hsu, Yating. "Formal Analysis of Network Protocol Security." The Ohio State University, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=osu1317230784.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Dukach, Semyon. "SNPP--a Simple Network Payment Protocol." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/12629.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Johnson, Edwin N. (Edwin Neil) 1975. "A protocol for network level caching." Thesis, Massachusetts Institute of Technology, 1998. http://hdl.handle.net/1721.1/9860.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1998.
Includes bibliographical references (p. 44-45).
by Edwin N. Johnson.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

14

Du, Jingzhe. "Geometric routing protocol in Disruption tolerant network." Thesis, University of Ottawa (Canada), 2008. http://hdl.handle.net/10393/27680.

Full text

Abstract:

We describe Geometric Localized Routing (GLR) in Disruption (delay) tolerant networks (DTNs). Although DTNs do not guarantee the connectivity of the network all the time, geometric location information still could be used to make routing decisions in a store and forward way. When a message reaches a region where greedy forwarding is impossible for some time, geometric planar spanners, especially local Delaunay triangulation still could be used to provide a good routing graph with constant stretch factor and shorter paths during communication. Existing DTN routing protocols either focus on the improvement of message delivery latency and delivery ratio in an impractical way, or without achieving desirable delivery attributes. In this work, we design local distributed solutions to extract spanning trees from Delaunay triangulation (DT) in the direction from source to destination. Our protocol resorts to flooding packets along the trees and with high probability packets are delivered with low delay. The goals of Geometric Localized Routing are: (1) fast delivery with intelligence, (2) better storage utilization. (3) guaranteed delivery using face routing. Through the implementation in the NS-2 simulator, we have shown that the proposed routing protocol achieves high delivery ratio with satisfied attributes.

APA, Harvard, Vancouver, ISO, and other styles

15

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Suh, Kyungjoo. "CRYPTO-AD-HOC network an ad hoc network protocol embedded cryptography /." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000164.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2002.
Title from title page of source document. Document formatted into pages; contains x, 80 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

17

Falgert, Marcus. "Geo-distributed application deployment assistance based on past routing information." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-206970.

Full text

Abstract:

Cloud computing platforms allow users to deploy geographically distributed applications on servers around the world. Applications may be simple to deploy on these platforms, but it is up to the user and the application to decide which regions and servers to use for application placement. Furthermore, network conditions and routing between the geo-distributed servers change over time, which can lead to sub-optimal performance of applications deployed on such servers. A user could either employ a static deployment configuration of servers, or attempt to use a more dynamic configuration. However, both have inherent limitations. A static configuration will be sub-optimal, as it will be unable to adapt to changing network conditions. A more dynamic approach where an application could switch over or transition to a more suitable server could be beneficial, but this can be very complex in practice. Furthermore, such a solution is more about adapting to change as it happens, and not beforehand. This thesis will investigate the possibility of forecasting impending routing changes between servers, by leveraging messages generated by the Border Gateway Protocol (BGP) and past knowledge about routing changes. BGP routers can delay BGP updates due to factors such as the minimum route advertisement interval (MRAI). Thus, out proposed solution involves forwarding BGP updates downstream in the network, before BGP routers process them. As routing between servers changes, so does the latency, meaning that the latency then could be predicted to some degree. This observation could be applied to realize when the latency to a server increases or decreases past another server. This in turn facilitates the decision process of selecting the most optimal servers in terms of latency for application deployment. The solution presented in this thesis can successfully predict routing changes between end-points in an enclosed environment, and inform users ahead of time that the latency is about to change. The time gained by such predictions depend on factors such as the number of ASs between the end-points, the MRAI, and the update processing delay imposed on BGP routers. Time gains between tens of milliseconds to over 2 minutes has been observed.

APA, Harvard, Vancouver, ISO, and other styles

18

Pantoleon, Periklis K. "Reliable content delivery using persistent data sessions in a highly mobile environment." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FPantoleon.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Whateley, Brendon J. "The influence of protocol choice on network performance." Master's thesis, University of Cape Town, 1995. http://hdl.handle.net/11427/13529.

Full text

Abstract:

Bibliography: leaves 100-102.
Computer communication networks are a vital link in providing many of the services that we use daily, and our reliance on these networks is on the increase. The growing use of networks is driving network design towards greater performance. The greater need for network connectivity and increased performance makes the study of network performance constraints important. Networks consist of both hardware and software components. Currently great advances are being made in network hardware, resulting in advances in the available raw network performance. In this thesis, I will show through measurement that it is difficult to harness all the raw performance and to make it available to carry network services. I will also identify some of the factors limiting the full utilization of a high speed network.

APA, Harvard, Vancouver, ISO, and other styles

20

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

龍浩生 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

22

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

23

Nguyen, Long G. "Designing a higher layer protocol for small distributed microcontroller systems using the control area network protocol." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1998. https://ro.ecu.edu.au/theses/1603.

Full text

Abstract:

This thesis is concerned with designing a Higher Layer Protocol (HLP) for small distributed microcontroller systems using a well-established network protocol: the Controller Area Network (CAN) protocol which, currently, is widely used in the automation industries. Steps were taken to investigate three popular HLPs based on the CAN protocol: namely. Smart Distributed System (SDS), DeviceNet. and CAN Kingdom. Following the comparison of the three HLPs, the CAN Kingdom protocol was chosen for the task of designing the HLP in this project in order to satisfy the restrictions associated with small systems. Thus, the HLP (named the Small CAN Kingdom protocol) of this project was designed according to the principles of the CAN Kingdom protocol, which contains many advantages for open network solutions. This enables designers to enhance a system's performance relatively easily. A complete hardware and software design of a small CAN-based system, utilising the Motorola MC68HC 11 microcontrollers, the Intel 82527 CAN controller chips, and DS3695 (RS485 standard) transceivers has been described. This small system can be used to demonstrate the performance of the Small CAN Kingdom protocol. The development of the system software has also taken into account the rules associated with this protocol.

APA, Harvard, Vancouver, ISO, and other styles

24

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

25

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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

27

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

28

Abbott, Mark Bert. "A language-based approach to protocol implementation." Diss., The University of Arizona, 1993. http://hdl.handle.net/10150/186386.

Full text

Abstract:

This thesis explores two strategies for supporting the development of network communication software: imposing constraints on protocol design at the specification level, and using a special-purpose language for protocol implementation. It presents a protocol implementation language called Morpheus. Morpheus utilizes the new strategies to provide a higher level of abstraction, finer grain modularity, and greater software reusability than previous approaches. Morpheus is able to provide a high level of abstraction because of built-in knowledge about its problem domain. It has a narrow problem domain--network protocols--that is further narrowed by the application of specification-level constraints. One particular constraint--the shapes constraint, which partitions protocols into three basic kinds--is particularly effective in raising the level of abstraction. Morpheus's support for modularity and, indirectly, software reuse hinges on reducing the performance penalty for layering. When protocol layering entails a high performance cost, developers are motivated to build complex monolithic implementations that are hard to design, implement, debug, modify, and maintain. Morpheus reduces the performance costs of layering by applying optimizations based on common patterns of protocol execution. If the degree of modularity is held fixed, then the optimizations simply improve performance. An optimization based on Integrated Layer Processing is particularly noteworthy for its dramatic contribution to network throughput while preserving modularity.

APA, Harvard, Vancouver, ISO, and other styles

29

Tobler, Benjamin. "A Structured Approach to Network Security Protocol Implementation." Thesis, University of Cape Town, 2005. http://pubs.cs.uct.ac.za/archive/00000281/.

Full text

Abstract:

The implementation of network security protocols has not received the same level of attention in the literature as their analysis. Security protocol analysis has successfully used inference logics, like GNY and BAN, and attack analysis, employing state space examination techniques such as model checking and strand spaces, to verify security protocols. Tools, such as the multi-dimensional analysis environment SPEAR II, exist to help automate security protocol specification and verification, however actual implementation of the specification in executable code is a task still largely left to human programmers. Many vulnerabilities have been found in implementations of security protocols such as SSL, PPTP and RADIUS that are incorporated into widely used operating system software, web servers and other network aware applications. While some of these vulnerabilities may be a result of flawed or unclear specifications, many are the result of the failure of programmers to correctly interpret and implement them. The above indicates a gap between security protocol specifications and their concrete implementations, in that there are methodologies and tools that have been established for developing the former, but not the latter. This dissertation proposes an approach to bridging this gap, describes our implementation of that approach and attempts to evaluate its success. The approach is three-fold, providing different measures to improve current ad-hoc implementation approaches: 1. From Informal to Formal Specifications: If a security protocol has been specified using informal standard notation, it can be converted, using automatic translation, to a formal specification language with well defined semantics. The formal protocol specification can then be analysed using formal techniques, to verify that the desired security properties hold. The precise specification of the protocol behaviour further serves to facilitate the concrete implementation of the protocol in code. 2. Separate Implementation Concerns: When implementing security protocols, the what and the when of protocol actions are abstracted from the how. That is, protocol logic implementation concerns, such as when and what actions should be performed on messages, should be clearly and cleanly separated from the cryptographic and network communication implementation details that implement how the actions are performed. Such high level modularity allows code implementing protocol logic to be re-used with different cryptographic algorithm implementations and network communication protocols. It also allows errors in the implementation of the cryptography to be addressed by swapping cryptographic implementations without changing the protocol logic code. The abstraction of cryptographic and network implementation is analogous to the adoption of the Dolev-Yao style models by many analysis techniques, where the cryptography itself is viewed as a black box and assumed perfect, allowing the analysis to focus on the protocol logic. Finally, this separation allows the correctness of the protocol logic implementation and cryptographic primitives implementation to be addressed separately. 3. Automated Implementation Using Code Generation We use code generation to automate the security protocol implementation process, avoiding the risk of human error in interpreting the sometimes subtle semantics of security protocol specifications. The precise nature of formal specification languages provides a base from which to specify and implement an automatic code generation tool. Our approach follows requirements identified for high integrity code generation - where feasible - to give a high level of confidence in the correctness of the generated code. In implementing the approach, we adopt the Spi Calculus for the role of formal specification language. The Spi Calculus was developed by extending the -calculus, a process algebra for describing concurrent communicating systems, to cater for the special case of network security protocols. Spi Calculus specifications can be analysed manually, by developing correctness proofs by hand, and automatically, by using model checkers such as MMC. As Spi Calculus specifications explicitly describe the actions of a security protocol, they are also particularly suitable for use as input for code generation. The implementation of the approach is split across three components that correspond to each of the parts of the approach: 1. Sn2Spi is a translator that converts an informal standard notation specification to a Spi Calculus specification, thus implementing part 1 of our approach. The converted specification can be analysed using any of the formal techniques applicable to the Spi Calculus. Once verified, the specification can be used to generate a concrete implementation using Spi2Java. 2. The Security Protocol Primitives API abstracts cryptographic and network communication operations, decoupling code that implements protocol logic from code that implements cryptographic and network operations. It provides the basic cryptographic and network communications functionality required to implement a security protocol, including: symmetric and asymmetric encryption, message digest, nonce and timestamp generation, marshalling message component data and sending and receiving messages over a network. A provider model, much like that used in the Java Cryptography Extensions API, is employed to allow different implementations to be swapped without changing the SPP client code. 3. Spi2Java is a code generator, essentially implementing a compiler from the Spi Calculus to Java code. Spi2Java uses Prolog to implement a defined mapping from Spi Calculus constructs, i.e. terms and process actions, to Java code segments. These code segments call the SPP API to access cryptographic and network functionality where needed. The mapping was developed by refining Spi constructs to Java code segments that preserve the semantics of the Spi constructs In addition, assertions are made in the code segments to ensure certain conditions are met before the implementation can continue running. Part of evaluating the effectiveness of this automated approach to security protocol implementation, involved a case study where manual implementations of the CCITT Three Message X.509 Protocol, developed by 4th year Computer Science students, and a Spi2Java generated implementation are compared. The outcome of the study favoured the automatically generated implementation, indicating the potential of the approach. Further to demonstrating the utility of code generation, we describe an SPP provider implementation developed to allow a security protocol run, including legitimate and attacker roles, to be simulated in a controlled environment. Spi2Java allows the protocol engineer to quickly and automatically generate code for protocol roles. The code can be executed using this implementation allowing the protocol engineer to step through execution of all roles, both legitimate and attacker, to gain insight into the behaviour of the protocol. The approach is evaluated in terms of the class of attacks it prevents and how it meets the identified requirements for high integrity code generation. It is also compared to existing and current work in the field. Attack classes that exploit faulty protocol logic implementation, vulnerability to type flaws and buffer overflows are prevented. The Spi2Java code generator fully meets three of the five high integrity code generation requirements: formally defined source and target languages are used; the translation software is validated; and the generated code is well structured and documented and can be traced back to the specification. Spi2Java partially meets the requirement that the mapping from source to target language constructs be formally proven to preserve the specification semantics. However the arguments given are not strictly formal. The requirement related to rigorous testing are not met due to practical resource constraints. However, Spi2Java has been used to generate real world protocol implementations that have been verified by manual inspection. Sprite, incorporating the Sn2Spi translator and Spi2Java code generator, provides a structured approach to network security protocol implementation by implementing automated translation from informal to formal security protocol specifications, and by being able to automatically generate Java implementations of network security protocols in which the security protocol engineer can have a high degree of confidence.

APA, Harvard, Vancouver, ISO, and other styles

30

Savage, Stefan R. "Protocol design in an uncooperative Internet /." Thesis, Connect to this title online; UW restricted, 2002. http://hdl.handle.net/1773/6995.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Wan, Ching Leong. "A Protocol decoding accelerator (PDA)." Thesis, University of British Columbia, 1990. http://hdl.handle.net/2429/28727.

Full text

Abstract:

With the increasing need for distributed processing and computer networking, the demand for open systems interconnection (OSI) has also increased. In [Davis-88], Davis et al propose a new generation portable protocol tester that will be able to provide conformance testing for OSI protocol implementations. In this thesis report, a specialized programmable hardware module, called protocol decoding accelerator (PDA), is designed to be used as the PDU decoder engine being defined in the Davis architecture. PDU decoding is the process of parsing the PDU header fields into a data structure that can be more readily used by other processes. Decoding can be time consuming because there is a large variety of PDU fields and formats. Conventional approach to PDU decoding is often implemented as software program designed for general purpose processor architecture. However, most general purpose processors do not handle PDU decoding efficiently. There are other VLSI protocol controllers, but they all have limited programmability and flexibility. The PDA is developed based on a simple instruction set with dedicated hardware to optimize important functions. Using selected PDU types and decoding programs from OSI layer 2 to 4 protocols, the resulting PDA design shows a minimum of 16 times faster average execution time and about five times smaller program size when compared to a 68000 system.
Applied Science, Faculty of
Electrical and Computer Engineering, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

32

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

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

34

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

35

Carter, Steven Michael. "Implementation and analysis of the IP measurement protocol (IPMP)." Master's thesis, Mississippi State : Mississippi State University, 2001. http://library.msstate.edu/etd/show.asp?etd=etd-11152001-090121.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Peyravian, Mohammad. "An Algorithmic approach to constructing protocol converters." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/13526.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Ramasubramaniam, Venkata Lakshmanan. "A framework for reliable multicast protocol." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE0000599.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Sunderam, V. S. "A methodology for the synthesis of network protocol software." Thesis, University of Kent, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.372773.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Qian, Xiaolan 1977. "A protocol for a wireless network of mobile devices." Thesis, Massachusetts Institute of Technology, 2000. http://hdl.handle.net/1721.1/86494.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
Includes bibliographical references (leaf 53).
by Xiaolan Qian.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

40

Brownfield, Michael I. "Energy-efficient Wireless Sensor Network MAC Protocol." Diss., This resource online, 2006. http://scholar.lib.vt.edu/theses/available/etd-04102006-170423/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Patel, Sameer H. "Design of the Network Multimedia File System protocol : a protocol for remote access of networked multimedia files /." Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-07292009-090502/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Bickhart, Ryan W. "Transparent TCP-to-SCTP translation shim layer." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file 0.44 Mb, 82 p, 2005. http://wwwlib.umi.com/dissertations/fullcit/1428177.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Jonsson, Fredrik. "Arm-P : Almost Reliable Multicast protocol." Thesis, Linköping University, Department of Computer and Information Science, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-14954.

Full text

Abstract:

Distribution of information across IP based networks is today part of our everyday life. IP is the backbone of the Internet and most office networks. We use IP to access web pages, listen to radio, and to create computation clusters. All these examples use bandwidth, and bandwidth is a limited resource.

Many applications distribute the same information to multiple receivers, but in many cases the same information is sent to a single receiver at a time, thus multiple copies of the same information is sent, thus consuming bandwidth.

What if the information could be broadcasted to all the clients at the same time, similar to a television broadcast. TCP/IP provides some means to do that. For example UDP supports broadcasting; the problem faced when using UDP is that it’s not reliable. There is no guarantee that the information actually reaches the clients.

This Bachelor thesis in Computer Science aims to investigate the problems and solutions of how to achieve reliable distribution of fixed size data sets using a non reliable multicast communication channel, like UDP, in a LAN environment.

The thesis defines a protocol (Almost Reliable Multicast Protocol – Arm-P) that provides maximum scalability for delivery of versioned data sets that are designed to work in a LAN-environment. A proof-of-concept application is implemented for testing purposes.

APA, Harvard, Vancouver, ISO, and other styles

45

Singh, Ravinder Pal. "Efficient protocol for live Web-based teaching." [Gainesville, Fla.] : University of Florida, 2002. http://purl.fcla.edu/fcla/etd/UFE1000163.

Full text

Abstract:

Thesis (M.S.)--University of Florida, 2002.
Title from title page of source document. Document formatted into pages; contains xi, 74 p.; also contains graphics. Includes vita. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

46

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

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

48

Jourjon, Guillaume Electrical Engineering &amp Telecommunications Faculty of Engineering UNSW. "Towards a versatile transport protocol." Awarded by:University of New South Wales. Electrical Engineering & Telecommunications, 2008. http://handle.unsw.edu.au/1959.4/41480.

Full text

Abstract:

This thesis presents three main contributions that aim to improve the transport layer of the current networking architecture. The transport layer is nowadays dominated by the use of TCP and its congestion control. Recently new congestion control mechanisms have been proposed. Among them, TCP Friendly Hate Control (TFRC) appears to be one of the most complete. Nevertheless this congestion control mechanism, as with TCP, does not take into account either the evolution of the network in terms of Quality of Service and mobility or the evolution of the applications. The first contribution of this thesis is a specialisation of TFRC congestion control to provide a QoS-aware Transport Protocol specifically designed to operate over QoS-enabled networks with bandwidth guarantee mechanisms. This protocol combines a QoS-aware congestion control, which takes into account network-level bandwidth reservations, with full ordered reliability mechanism to provide a transport service similar to TCP. As a result, we obtain the guaranteed throughput at the application level where TCP fails. This protocol is t he first transport protocol compliant with bandwidth guaranteed networks. At the same time the set of network services expands, new technologies have been proposed and deployed at the physical layer. These new technologies are mainly characterised by communications done without wire constraint and the mobility of the end-systems. Furthermore, these technologies are usually deployed on entities where the CPU power and memory storage are limited. The second contribution of this thesis is therefore to propose an adaptation of TFHC to these entities. This is accomplished with the proposition of a new sender-based version of TFHC. This version has been implemented, evaluated and its numerous contributions and advantages compare to usual TFHC version have been demonstrated. Finally, we proposed an optimisation of actual implementations of TFHC. This optimisation first consists in the proposition of an algorithm based on a numerical analysis of the equation used in TFHC and the use of the Newton's algorithm. We furthermore give a first step, with the introduction of a new framework for TFRC, in order to better understand TFHC behaviour and to optimise the computation of the packet loss rate according to loss probability distributions.

APA, Harvard, Vancouver, ISO, and other styles

49

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

Find full text

APA, Harvard, Vancouver, ISO, and other styles

50

Kulkarni, Santosh B. Umphress David A. Agrawal Prathima. "Synergy MAC a cooperative MAC protocol /." Auburn, Ala, 2009. http://hdl.handle.net/10415/1609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'BGP (Computer network protocol)'

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