24 search results - page 1 / 5 » Lower Bounds for One-to-one Packet Routing on Trees using Ho... |
CJ
2002
14 years 6 months ago
2002
EUROPAR
2009
Springer
15 years 26 days ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
SPAA
2004
ACM
14 years 11 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...
SPAA
1999
ACM
14 years 10 months ago
1999
ACM
The time-constrained packet routing problem is to schedule a set of packets to be transmitted through a multinode network, where every packet has a source and a destination (as in ...
INFOCOM
2000
IEEE
14 years 10 months ago
2000
IEEE
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...