On routing efficiency of a network design algorithm

  • Authors:
  • Kairat Jaroenrat;Pisit Charnkeitkong

  • Affiliations:
  • Rangsit University, Pathumtani, Thailand;Rangsit University, Pathumtani, Thailand

  • Venue:
  • Mobility '06 Proceedings of the 3rd international conference on Mobile technology, applications & systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The topology of UMTS (Universal Mobile Telecommunications System)'s core and access networks are more like a partial mesh, which is difficult to obtain the optimal solution. Mesh Network Topological Optimization and Routing (MENTOR) algorithm is known as a low complexity heuristic used to design partial mesh networks. This study explores the relation between design parameters and performance of traffic routing of MENTOR algorithm. We analyze 432 MENTOR networks for 4 sets of 50 nodes each with equivalently distributed demand and randomly generated locations. For each of these networks, the performances at normal load and at congestion threshold of MENTOR flow assignment are calculated and compared with the optimum solution obtained by solving the linear programming. It is found that the performances of MENTOR strongly depend on "slack", a design parameter represented the different between the maximum and minimum utilization. For small value of slack, s≤0.1, the performances of MENTOR keep very close to that of the optimum solution, while the maximum utilization hardly impact the performances. As the slack get larger the performances of MENTOR become worse and more depend on the maximum utilization.