Data networks
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of shortest-path routing algorithms in a dynamic network environment
ACM SIGCOMM Computer Communication Review
Dynamic routing in multiparented networks
IEEE/ACM Transactions on Networking (TON)
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Strong approximations for Markovian service networks
Queueing Systems: Theory and Applications
Adaptive proportional routing: a localized QoS routing approach
IEEE/ACM Transactions on Networking (TON)
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
On simple algorithms for dynamic load balancing
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Scalable compression and transmission of internet multicast video
Scalable compression and transmission of internet multicast video
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Enhancing both network and user performance for networks supporting best effort traffic
IEEE/ACM Transactions on Networking (TON)
Spatial energy balancing through proactive multipath routing in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
Traffic-predicting a routing algorithm using time series models
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
A prediction method of network traffic using time series models
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Hi-index | 0.00 |
We propose a new routing algorithm based on online estimation of the link load dynamics and prior information on flow holding times. The motivation for this proposal lies in supporting traffic flows such as VBR or associated with rate adaptive applications. Such traffic requires a minimal guaranteed bandwidth, but can see improved performance when sharing excess bandwidth not used to meet guarantees. The key idea underlying our approach is to route traffic flows so that they see minimal expected flow-perceived loads during their sojourn in the network. To this end we establish a routing framework where links estimate and advertise the parameters associated with their load dynamics in addition to their current load. New flows are routed based on this information and prior knowledge of their holding times so as to minimize the expected flow-perceived load. Simulations of this routing scheme in a (weighted) max-min bandwidth sharing framework show gains of 20-50% in the average flow bandwidth share over baseline routing schemes.