Spelling suggestions: "subject:"eomputer network protocols"" "subject:"aomputer network protocols""
31 |
Hop integrity a defense against denial-of-service attacks /Huang, Chin-Tser, Gouda, Mohamed G., January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Supervisor: Mohamed G. Gouda. Vita. Includes bibliographical references. Available also from UMI Company.
|
32 |
Efficient protocol for live Web-based teachingSingh, Ravinder Pal, January 2002 (has links)
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.
|
33 |
A design comparison between IPv4 and IPv6 in the context of MYSEA, and implementation of an IPv6 MYSEA prototype /O'Neal, Matthew R. January 2003 (has links) (PDF)
Thesis (M.S. in Computer Science)--Naval Postgraduate School, June 2003. / Thesis advisor(s): Cynthia E. Irvine, Thuy D. Nguyen. Includes bibliographical references (p. 49-50). Also available online.
|
34 |
Protocol design for dynamic Delaunay triangulationLee, Dong-young, 1973- 28 September 2012 (has links)
Delaunay triangulation (DT) is a useful geometric structure for net-working applications. We define a distributed DT and present a necessary and sufficient condition for a distributed DT to be correct. This condition is used as a guide for protocol design. We investigate the design of join, leave, failure, and maintenance protocols for a set of nodes in d-dimension (d > 1) to construct and maintain a distributed DT in a dynamic environment. The join, leave, and failure protocols in the suite are proved to be correct for a single join, leave, and failure, respectively. For a system under churn, it is impossible to maintain a correct distributed DT continually. We define an accuracy metric such that accuracy is 100% if and only if the distributed DT is correct. The suite also includes a maintenance protocol designed to recover from incorrect system states and to improve accuracy. In designing the protocols, we make use of two novel observations to substantially improve protocol efficiency. First, in the neighbor discovery process of a node, many replies to the node's queries contain redundant information. Second, the use of a new failure protocol that employs a proactive approach to recovery is better than the reactive approaches used in prior work. Experimental results show that our new suite of protocols maintains high accuracy for systems under churn and each system converges to 100% accuracy after churning stopped. They are much more efficient than protocols in prior work. To illustrate the usefulness of distributed DT for networking applications, we also present several application protocols including greedy routing, finding a closest existing node, clustering, broadcast, and geocast. Bose and Morin proved in 2004 that greedy routing always succeeds to find the destination node on a DT. We prove that greedy routing always finds a closest existing node to a given point, and our broadcast and geocast protocols always deliver a message to every target node. Our broadcast and geocast protocols are also efficient in the sense that very few target nodes receive duplicate messages, and non-target nodes receive no message. Performance characteristics of greedy routing, broadcast, and geocast are investigated using simulation experiments. We also investigate the impact of inaccurate coordinates on the performance of greedy routing, broadcast, and geocast. / text
|
35 |
Bluetooth network designLiu, Changlei., 劉長雷. January 2003 (has links)
published_or_final_version / abstract / toc / Electrical and Electronic Engineering / Master / Master of Philosophy
|
36 |
On the interaction of internet routing protocolsAlim, M. Abdul January 2011 (has links)
No description available.
|
37 |
Modelling and analysis of a computer conferencing system / Modeling and analysis of a computer conferencing systemBaronikian, Haig January 1987 (has links)
No description available.
|
38 |
Systems of communicating machines : a model for communication protocolsLundy, G. M. January 1988 (has links)
No description available.
|
39 |
Protocol conversion : an algorithmic approachRajagopal, Murali 08 1900 (has links)
No description available.
|
40 |
Performance analysis of hybrid ARQ protocols in a slotted code division multiple-access networkHanratty, Joseph M. 08 1900 (has links)
No description available.
|
Page generated in 0.0713 seconds