Name
Abstract | ||
|---|---|---|
Backpressure schemes are known to stabilize stochastic networks through the use of congestion gradients in routing and resource allocation decisions. Nonetheless, these schemes share a significant drawback, namely, the delay guarantees are obtained only in terms of average values. As a result, arbitrary packets may never reach their destination due to both the starvation and last-packet problems. ... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TNET.2017.2706366 | IEEE/ACM Transactions on Networking |
Keywords | Field | DocType |
Delays,Routing,Network topology,Topology,Stability criteria,Resource management | Resource management,Stability criterion,Scheduling (computing),Computer science,Queue,Network packet,Computer network,Backpressure routing,Network topology,Resource allocation,Distributed computing | Journal |
Volume | Issue | ISSN |
25 | 4 | 1063-6692 |
Citations | PageRank | References |
2 | 0.42 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shay Vargaftik | 1 | 47 | 6.22 |
| Isaac Keslassy | 2 | 986 | 72.83 |
| Ariel Orda | 3 | 2595 | 351.94 |