IEEE/ACM Transactions on Networking (TON)
Mpls and Label Switching Networks
Mpls and Label Switching Networks
Internet traffic engineering using multi-protocol label switching (MPLS)
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
Explicit Multicast Routing Algorithms for Constrained Traffic Engineering
ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
Multi-objective scheme over multi-tree routing in multicast MPLS networks
LANC '03 Proceedings of the 2003 IFIP/ACM Latin America conference on Towards a Latin American agenda for network research
Generalized multiobjective multitree model solution using MOEA
EC'05 Proceedings of the 6th WSEAS international conference on Evolutionary computing
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
Generalized load sharing for homogeneous networks of distributed environment
Journal of Computer Systems, Networks, and Communications
Generalized load sharing for distributed operating systems
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Hi-index | 0.00 |
Load Balancing is a key mechanism in traffic engineering. One interesting strategy for load balancing enhancement is the multipath approach, in which data is transmitted through different paths. The use of effective hashing functions for load balancing optimizes the network utilization and reduces packet disordering and imbalance. This paper address the problem of packet ordering in multipath - multicast MPLS networks, studies the impact of the hashing function to effectively partition the traffic to implement the flow splitting values issued from an optimized model and analyzes the traffic allocation to the LSPs of the network and the mis-ordering problem at the egress node using buffer schemes. The buffer allocation levels are calculated according to end-to-end delays. Finally, the paper presents some experimental results from an optimized network.