Thesis (Ph. D.)--Industrial and Systems Engineering, Georgia Institute of Technology, 2008. / Professor Michael D. Meyer, Committee Member ; Professor Ozlem Ergun, Committee Chair ; Professor Ellis Johnson, Committee Member ; Professor George L. Nemhauser, Committee Member ; Professor H. Venkateswaran, Committee Member.

Techn. Universiẗat, Diss., 2000--Berlin.

Thesis (M.S.)--Rochester Institute of Technology, 2007. / Typescript. Includes bibliographical references (leaves 97-98).

Thesis (Ph. D.)--Washington State University, August 2007. / Includes bibliographical references (p. 126-134).

Thesis (M.S.)--Oregon State University, 2008. / Printout. Includes bibliographical references (leaves 72-79 ). Also available on the World Wide Web.

Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 53-56). Also available in electronic version.

Universiẗat, Diss., 2004--Jena.

Thesis (M. Sc.)(Computer Science)--University of Pretoria, 2006. / Includes summary. Includes bibliographical references. Available on the Internet via the World Wide Web.

In dynamic P2P networks, nodes join and depart from the system frequently, which partially damages the predefined P2P structure, and impairs the system performance such as basic lookup functionality. Therefore stabilization process has to be done to restore the logical topology. This paper presents an approach to relax the requirement on routing tables to provide provably better stability than fixed structured P2P systems. We propose a relaxed Chord that keeps the O(logN) number of hops for greedy lookup, but it requires less stabilization overhead. It allows a tradeoff between lookup efficiency and structure flexibility without adding any overhead to the system. In the relaxed routing structure, each routing entry ("finger") of the node is allowed to vary within a set of values. Each node only needs to keep a certain number of fingers that point to nodes in its anchor set. This relaxation reduces the burden of state management of the node. The relaxed routing scheme provides an alternative structure other than randomized P2P and deterministic P2P, by relaxing on finger selection. It provides good flexibility and therefore extends the system functioning time. / Singapore-MIT Alliance (SMA)

Capability to route can be considered as one of the key features of a modern multipurpose operating system, which HelenOS aims to be. The goal of this master thesis is to explore current HelenOS routing capabilities, enhance them and empower HelenOS with BIRD. HelenOS will become a routing operating system with awareness of its surroundings. It will be capable of dynamic adaptation to changes in the network and their propagation.