Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
A binary feedback scheme for congestion avoidance in computer networks
ACM Transactions on Computer Systems (TOCS)
Congestion control and traffic management in ATM networks: recent advances and a survey
Computer Networks and ISDN Systems
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
Edge-based traffic engineering for OSPF networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Edge-based traffic engineering for OSPF networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed flow detection over multi-path sessions
Computer Communications
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Network architecture for joint failure recovery and traffic engineering
ACM SIGMETRICS Performance Evaluation Review - Performance evaluation review
| Hi-index | 0.00 |
We consider the problem of allocating bandwidth to competing flows in an MPLS network, subject to constraints on fairness, efficiency, and administrative complexity. The aggregate traffic between a source and a destination, called a flow, is mapped to label switched paths (LSPs) across the network. Each flow is assigned a preferred ('primary') LSP, but traffic may be sent to other ('secondary') LSPs. Within this context, we define objectives for traffic engineering, such as fairness, efficiency, and preferred flow assignment to the primary LSP of a flow ('Primary Path First', PPF). We propose a distributed, feedback-based multipath routing algorithm that attempts to apply additive-increase and multiplicative-decrease (AIMD) to implement our traffic engineering objectives. The new algorithm is referred to as multipath-AIMD. We use ns-2 simulations to illustrate the fairness criteria and PPF property of our multipath-AIMD scheme in an MPLS network.