45 search results - page 1 / 9 » Dynamic Packet Routing on Arrays with Bounded Buffers |
LATIN
1998
Springer
13 years 9 months ago
1998
Springer
We study the performance of packet routing on arrays (or meshes) with bounded buffers in the routing switches, assuming that new packets are continuously inserted at all the nodes....
SPAA
1994
ACM
13 years 9 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
SPAA
1999
ACM
13 years 9 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
2010
IEEE
13 years 3 months ago
2010
IEEE
—The delivery of latency sensitive packets is a crucial issue in real time applications of communication networks. Such packets often have a firm deadline and a packet becomes u...
SPAA
1992
ACM
13 years 9 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...