Name
Abstract | ||
|---|---|---|
In the MPLS network QoS might be achieved by reducing the possibility of congestion while increasing the utilization of available links. Due to various interrelated factors, path selection for the MPIS network is known as an NP-hard problem. The widely employed path selection scheme has a shortcoming that the time overhead is high, especially when the number of nodes in the network is large. This paper proposes a new path selection scheme which uses the genetic algorithm along with the modified roulette wheel selection method. Performance evaluation through computer simulation shows that it finds the paths about 30% faster than the existing constrained shortest path first (CSPF) scheme while evenly distributing the traffic throughout the network. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/IRI.2007.4296681 | IRI |
Keywords | Field | DocType |
multiprotocol label switching,np-hard problem,quality of service,path selection scheme,computational complexity,qos,cspf,computer networks,genetic algorithm,mpls,genetic algorithms,path selection,mpls network,np hard problem,computer simulation | Multiprotocol Label Switching,Computer science,Computer network,Fitness proportionate selection,Quality of service,Constrained Shortest Path First,Genetic algorithm,Computational complexity theory,Distributed computing | Conference |
ISBN | Citations | PageRank |
1-4244-1500-4 | 0 | 0.34 |
References | Authors | |
3 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sun Wook Kim | 1 | 1 | 1.08 |
| Hee Yong Youn | 2 | 943 | 142.78 |
| Sung Jin Choi | 3 | 45 | 4.93 |
| Nag Bum Sung | 4 | 0 | 0.34 |