4037 search results - page 228 / 808 » Routing without ordering |
MOBICOM
2005
ACM
14 years 4 months ago
2005
ACM
This paper evaluates the ability of a wireless mesh architecture to provide high performance Internet access while demanding little deployment planning or operational management. ...
SPAA
2004
ACM
14 years 4 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
INFOCOM
2003
IEEE
14 years 4 months ago
2003
IEEE
Abstract— This paper studies the problem of designing survivable optical wavelength division multiplexed (WDM) networks. A wavelength-routed wide area backbone network supporting...
SIGMETRICS
2003
ACM
14 years 4 months ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...
SPAA
2003
ACM
14 years 4 months ago
2003
ACM
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...