A classic optimization problem in network routing is to minimize C+ D, where C is the
maximum edge congestion and D is the maximum path length (also known as dilation). The …

This paper deals with data management in computer systems in which the computing nodes
are connected by a relatively sparse network. We consider the problem of placing and …

We survey routing problems on fixed-connection networks. We consider many aspects of the
routing problem and provide known theoretical results for various communication models …

This book presents the history and state of the art of universal routing strategies, which can
be applied to networks independently of their respective topologies. It opens with a self …

Improved Approximations for Edge-Disjoint Paths, Unsplittable Flow, and Related Routing
Problems - Foundations of Computer Scien Page 1 Improved Approximations for Edge-Disjoint …

One of tha contra1 tasks of networking is packet-rouling when edge bandwidth is limited.
Tremendous progress has been achiavcd by separating the issue of routing into two …

In 1988, Leighton, Maggs and Rao proved a much celebrated result: that for any network,
given any collection of packets with a specified route for each packet, there exists an …

In tbis paper we study randomized algorithms for circuit switching on multistage networks
related to the butterfly. We devise algorithms that route messages by constructing circuits (or …

This introduction to networking large scale parallel computer systems acts as a primary
resource for a wide readership, including network systems engineers, electronics engineers …

An ad-hoc wireless network is a collection bile hosts forming a temporary network wi any
established infrastructure or centralized This type of network is of great importan in situations …