78 search results - page 8 / 16 » Differential Approximation for Some Routing Problems |
ICPPW
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpat...
IPPS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
MOC
2000
13 years 8 months ago
2000
Let {Sm} be an infinite sequence whose limit or antilimit S can be approximated very efficiently by applying a suitable extrapolation method E0 to {Sm}. Assume that the Sm and henc...
INFOSCALE
2009
ACM
14 years 3 months ago
2009
ACM
Address Fragmentation plays a key role in the exponential growth of DFZ routing table, known as the scalability problem of current Internet. In this paper, we measure the severity ...
SPAA
2004
ACM
14 years 2 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...