Name
Abstract | ||
|---|---|---|
We initiate a competitive analysis of packet forwarding policies for maximum and average flow in a line network. We show that the policies Earliest Arrival and Furthest-To-Go are scalable, but not constant competitive, for maximum flow. We show that there is no constant competitive algorithm for average flow. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-642-54423-1_53 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Forwarding information base,Packet segmentation,End-to-end delay,Computer science,Transmission delay,Bidirectional Forwarding Detection,Computer network,IP forwarding,Packet forwarding,Competitive analysis | Conference | 8392 |
ISSN | Citations | PageRank |
0302-9743 | 3 | 0.40 |
References | Authors | |
26 | 7 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Antonios Antoniadis | 1 | 127 | 13.81 |
| Neal Barcelo | 2 | 37 | 5.86 |
| Daniel Cole | 3 | 13 | 2.28 |
| Kyle Fox | 4 | 80 | 12.33 |
| Benjamin Moseley | 5 | 554 | 50.11 |
| Michael Nugent | 6 | 28 | 4.51 |
| Kirk Pruhs | 7 | 2286 | 192.78 |