95 search results - page 3 / 19 » On the performance of greedy algorithms in packet buffering |
SPAA
1994
ACM
13 years 10 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...
IPPS
2009
IEEE
14 years 20 days ago
2009
IEEE
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
LATIN
1998
Springer
13 years 10 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....
INFOCOM
2005
IEEE
13 years 11 months ago
2005
IEEE
— This paper is about high capacity switches and routers that give guaranteed throughput, rate and delay guarantees. Many routers are built using input queueing or combined input...
INFOCOM
1998
IEEE
13 years 10 months ago
1998
IEEE
To support the Internet's explosive growth and expansion into a true integrated services network, there is a need for cost-effective switching technologies that can simultaneo...