Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
Computing a Perfect Strategy for n*n Chess Requires Time Exponential in N
Proceedings of the 8th Colloquium on Automata, Languages and Programming
IEEE/ACM Transactions on Networking (TON)
QoS Performance Analysis in Deployment of DiffServ-aware MPLS Traffic Engineering
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03
Bandwidth Management for Supporting Differentiated Service Aware Traffic Engineering
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.24 |
This paper proposes a new per-class bandwidth constraint algorithm, called the multipath selection algorithm (MSA), for a DiffServ-aware traffic engineering (DiffServ-TE). The MSA comprises three steps. First, a given source uses the MSA to find multiple label switch paths (LSPs) from the source to a destination for a specific class type (CT). Second, the source uses the available bandwidth of the CT on all the links along these LSPs to allocate the initial traffic to the selected LSPs. Third, the source dynamically adjusts traffic to these LSPs based on individual round trip time. Simulation results indicate that the proposed algorithm offers better performance than existing approaches in average transmission time, average packet loss rate, average throughput, and available bandwidth variance for each link.