The maximum concurrent flow problem
Journal of the ACM (JACM)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Designing least-cost nonblocking broadband networks
Journal of Algorithms
A flexible model for resource management in virtual private networks
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic matrix estimation: existing techniques and new directions
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Networks new economical virtual private
Communications of the ACM - E-services: a cornucopia of digital offerings ushers in the next Net-based evolution
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Experimental Study of Internet Stability and Backbone Failures
FTCS '99 Proceedings of the Twenty-Ninth Annual International Symposium on Fault-Tolerant Computing
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Efficient and robust routing of highly variable traffic
Efficient and robust routing of highly variable traffic
Throughput Guaranteed Restorable Routing Without Traffic Prediction
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Designing a predictable internet backbone with valiant load-balancing
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Switched optical backbone for cost-effective scalable core IP networks
IEEE Communications Magazine
Preconfiguring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic
IEEE Journal on Selected Areas in Communications
Guaranteed performance routing of unpredictable traffic with fast path restoration
IEEE/ACM Transactions on Networking (TON)
Load-balanced IP routing scheme based on shortest paths in hose model
IEEE Transactions on Communications
Fine two-phase routing over shortest paths with traffic matrix
Computer Networks: The International Journal of Computer and Telecommunications Networking
An approximation method of origin-destination flow traffic from link load counts
Computers and Electrical Engineering
Hi-index | 0.00 |
The emergence of new applications on the Internet like voice-over-IP, peer-to-peer, and video-on-demand has created highly dynamic and changing traffic patterns. In order to route such traffic with quality-of-service (QoS) guarantees without requiring detection of traffic changes in real-time or reconfiguring the network in response to it, a routing and bandwidth allocation scheme has been recently proposed that allows preconfiguration of the network such that all traffic patterns permissible within the network's natural ingress-egress capacity constraints can be handled in a capacity efficient manner. The scheme routes traffic in two phases. In the first phase, incoming traffic is sent from the source to a set of intermediate nodes and then, in the second phase, from the intermediate nodes to the final destination. The traffic in the first phase is distributed to the intermediate nodes in predetermined proportions that depend on the intermediate nodes. In this paper, we develop linear programming formulations and a fast combinatorial algorithm for routing under the scheme so as to maximize throughput (or, minimize maximum link utilization). We compare the throughput performance of the scheme with that of the optimal scheme among the class of all schemes that are allowed to even make the routing dependent on the traffic matrix. For our evaluations, we use actual Internet Service Provider topologies collected for the Rocketfuel project. We also bring out the versatility of the scheme in not only handling widely fluctuating traffic but also accommodating applicability to several widely differing networking scenarios, including i) economical Virtual Private Networks (VPNs); ii) supporting indirection in specialized service overlay models like Internet Indirection Infrastructure (i3); iii) adding QoS guarantees to services that require routing through a network-based middlebox; and iv) reducing IP layer transit traffic and handling extreme traffic variability in IP-over-optical networks without dynamic reconfiguration of the optical layer. The two desirable properties of supporting indirection in specialized service overlay models and static optical layer provisioning in IP-over-optical networks are not present in other approaches for routing variable traffic, such as direct source-destination routing along fixed paths.