Spelling suggestions: "subject:"eomputer network protocols"" "subject:"aomputer network protocols""
171 |
Service Trading Marketplace Network (STAMP-Net): service discovery and composition for customizable adaptive networkSookavatana, Pipat, Electrical Engineering & Telecommunications, Faculty of Engineering, UNSW January 2003 (has links)
This thesis presents a complete alternative service composition model named Service Trading Marketplace Network (STAMP-Net). The primary concept is to improve overall system scalability and introduce a fair business scheme for customers and providers. STAPM-Net focuses on designing an architecture based on both technical and business aspect. In STAMP-NET, users remain the ability to choose their preference service providers from potential-provider lists, and service providers are able to compete for the requested services that they can handle. For these purposes, STAMP-Net introduce a concept of 'Service Trading Marketplace Mechanism' which facilitates a problem of 'conflict of interest'; 'Indirect Service Discovery' which allows service providers to the learn existing of services being offered by other service providers; and 'Service Subcontract System' which allows service providers to subcontract any missing service to other potential service providers. In addition, this thesis also present monitor techniques, which are used to ensure the quality of services.
|
172 |
Anycast services and its applications.Yu, Shui, mikewood@deakin.edu.au January 2004 (has links)
Anycast in next generation Internet Protocol is a hot topic in the research of computer networks. It has promising potentials and also many challenges, such as architecture, routing, Quality-of-Service, anycast in ad hoc networks, application-layer anycast, etc. In this thesis, we tackle some important topics among them. The thesis at first presents an introduction about anycast, followed by the related work. Then, as our major contributions, a number of challenging issues are addressed in the following chapters. We tackled the anycast routing problem by proposing a requirement based probing algorithm at application layer for anycast routing. Compared with the existing periodical based probing routing algorithm, the proposed routing algorithm improves the performance in terms of delay. We addressed the reliable service problem by the design of a twin server model for the anycast servers, providing a transparent and reliable service for all anycast queries. We addressed the load balance problem of anycast servers by proposing new job deviation strategies, to provide a similar Quality-of-Service to all clients of anycast servers. We applied the mesh routing methodology in the anycast routing in ad hoc networking environment, which provides a reliable routing service and uses much less network resources. We combined the anycast protocol and the multicast protocol to provide a bidirectional service, and applied the service to Web-based database applications, achieving a better query efficiency and data synchronization. Finally, we proposed a new Internet based service, minicast, as the combination of the anycast and multicast protocols. Such a service has potential applications in information retrieval, parallel computing, cache queries, etc. We show that the minicast service consumes less network resources while providing the same services. The last chapter of the thesis presents the conclusions and discusses the future work.
|
173 |
Quality of service support in mobile Ad Hoc networksShao, Wenjian. January 2006 (has links)
Thesis (Ph. D.)--University of Hong Kong, 2006. / Title proper from title frame. Also available in printed format.
|
174 |
The simulation studies on a behaviour based trust routing protocol for ad hoc networksKulkarni, Shrinivas Bhalachandra. January 2006 (has links)
Thesis (M.S.)--State University of New York at Binghamton, Dept. of Electrical & Computer Engineering, 2006. / Includes bibliographical references.
|
175 |
Efficient key management protocols for mobile ad hoc networksErdem, Özkan M. 18 March 2005 (has links)
In this thesis, novel solutions are proposed for key management issues in
mobile ad hoc networks.
Presented Hierarchical Binary Tree (HBT) based model is distributed, self-organizing,
scalable and does not employ online key distribution authority or group
manager. Two different group authentication and group key establishment protocols
are proposed for the users who form an ad hoc group with distributed trust model.
Initially proposed protocols are based on public key cryptography and do not use
specific algorithm. However, members can establish the keys faster with proposed
customized hybrid scheme which combines elliptic curve cryptography, modular
squaring operations and secret key encryption algorithm. Proposed HBT based model
provides complete backward and forward security in case of modification in
membership and it has comparable efficiency to the other HBT based schemes which
employ real time key distribution authority.
Mutual authentication and link encryption can be achieved in wireless sensor
network only with public key cryptography if there are no pre-distributed keys.
However, constraints in resources make fully public key operations not affordable on
sensor. Three different authenticated key establishment protocols are proposed with an
objective of being respectful to constraints. Sensor needs to make only modular or
cyclic convolution multiplications, and expensive public key decryption operation is
executed at the data processing station side. Schemes require small size of code and
achieve the least sensor processing time in comparison with fully public key
cryptography based protocols. / Graduation date: 2005
|
176 |
Conserving energy in TCP for mobile ad-hoc networksAgarwal, Sandeep, 1973- 18 April 2000 (has links)
The widespread use of TCP as a transport layer protocol for mobile ad-hoc
networks and wireline networks has motivated the need to make its implementation
highly power efficient specially with respect to ad hoc radio networks. Over the
past years many researchers have developed energy efficient protocols for mobile
ad-hoc networks. This thesis deals with the various modifications and fine-tunings
in the TCP code which, when applied, help in conserving battery power at nodes by
saving on the software overhead at the mobile nodes. The various modifications
proposed have been tested with actual experiments done on two laptops with
Lucent WaveLan wireless cards. The results obtained from the experiments
indicate that with certain modifications made in the implementation of TCP code,
significant savings in power can be achieved along with an increase in the overall
efficiency of TCP over wireless links. Finally, a discussion of how other
modifications can be researched and tested as the hardware for mobile systems
change is proposed. / Graduation date: 2000
|
177 |
A recoverable protocol for loop-free distributed routingJanuary 1978 (has links)
A. Segall, P.M. Merlin and R.G. Gallager. / Bibliography: leaf 25. / "September 1978." Suppported in part by Codex Corporation. / Supported in part by the Advanced Research Project Agency (monitored by ONR) under Contract no. N00014-75-C-1183
|
178 |
A failsafe distributed routing protocolJanuary 1978 (has links)
Philip M. Merlin and Adrian Segall. / Bibliography: p. 63. / "Sep. 1977, revised May 1978." / Supported by the Advanced Research Project Agency (monitored by ONR) under Contract no. N00014-75-C-1183
|
179 |
Altruistic QoS routing and multi-path multimedia communicationLee, Chung-Wei, January 2001 (has links) (PDF)
Thesis (Ph. D.)--University of Florida, 2001. / Title from first page of PDF file. Document formatted into pages; contains xi, 86 p.; also contains graphics. Vita. Includes bibliographical references (p. 82-85).
|
180 |
Encryption of computer peripheral devices /Norman, Kelly Robert, January 2006 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. School of Technology, 2006. / Includes bibliographical references (p. 65-67).
|
Page generated in 0.0609 seconds