As wireless sensor networks continue to grow in size, we are faced with the prospect of emerging wireless networks with hundreds or thousands of nodes. Geographic routing algorithms are a promising alternative to tradition ad hoc routing algorithms in this new domain for point-to-point routing, but deployments of such algorithms are currently uncommon because of some practical difficulties. Thi...

A mesh-restored lightpath in an optical network has a primary route and a diversely routed backup route. The wavelength channels on the primary route of a mesh-restored lightpath are dedicated for that lightpath whereas the wavelength channels on the backup route are shared among different mesh-restored lightpaths. Wavelength channels are shared in a way that ensures restoration of all lightpat...

Routing substrates for overlay networks are an important building block for large distributed applications. Many existing substrates are based on a random identifier space and therefore do not respect node locality when routing data. This can lead to lower performance for locality-sensitive applications, such as web caching, distributed gaming, and resource discovery. This paper examines the pr...

We consider the problem of searching a set of data repositories, each managed by an independent agent which is able to handle queries from users, as well as queries from peer agents. Given a query, an agent’s task is to find a closest match to the query over all the distributed databases. The agents search the distributed databases cooperatively by routing queries with each other. However, it i...

When distributed processes contend for a shared resource, we need a good distributed contention resolution protocol, e.g., for multiple-access channels (ALOHA, Ethernet), PRAM emulation, and optical routing. Under a stochastic model of request generation from n synchronous processes, Raghavan & Upfal have shown a protocol which is stable for a positive request rate; their main result is that fo...

For a wavelength-routed network in which connection requests are arriving and departing at high rates, an appropriate control scheme must be implemented to set up lightpaths for each request in a fast and efficient manner. The control scheme, which includes routing and wavelength assignment algorithms, must also be scalable, and should attempt to minimize the number of blocked connections. In t...

There are two major difficulties in real-time multicast connection setup. One is the design of an efficient distributed routing algorithm which optimizes the network cost of routing trees under the real-time constraints. The other is the integration of routing with admission control into one single phase of operations. This paper presents a real-time multicast connection setup mechanism, which ...

Greedy geographic routing is attractive for large multi-hop wireless networks because of its simple and distributed operation. However, it may easily result in dead ends or hotspots when routing in a network with obstacles (regions without sufficient connectivity to forward messages). In this paper we propose a distributed routing algorithm that combines greedy geographic routing with two non-E...

The emergence of large scale distributed memory computers has brought with it a variety of interconnection networks. As it is not feasible to fully interconnect the processors with a diameter of one, routing of messages is necessary. Wormhole routing is an efficient method of routing and in this paper, we derive a model for wormhole routing. Using this model, we determine the optimal buffer siz...