Simple mathematical modeling of efficient path selection for QoS routing in load balancing

Man Ching Yuen, Weijia Jia, Chi Chung Cheung

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

7 Citations (Scopus)

Abstract

In this paper, we develop a very simple mathematical model to investigate the upper bound of the size of limited choices in our proposed QoS path selection algorithm called the Largest Widest Shortest Path among Limited Choices (LWSP-LC) for engineering design. The LWSP-LC can achieve load balancing effectively and reduce path searching complexity significantly. However, its performance is highly related to many factors including the network environment and traffic condition. Our simulation results show that the size of limited choices is highly dependent on both the network size and network connectivity. By considering a fully connected network, we derive a simple mathematical model on the upper bound of the size of limited choices based on the network size only.

Original languageEnglish
Title of host publication2004 IEEE International Conference on Multimedia and Expo (ICME)
Pages217-220
Number of pages4
Publication statusPublished - 27 Jun 2004
Externally publishedYes
Event2004 IEEE International Conference on Multimedia and Expo (ICME) - Taipei, Taiwan
Duration: 27 Jun 200430 Jun 2004

Publication series

Name2004 IEEE International Conference on Multimedia and Expo (ICME)
Volume1

Conference

Conference2004 IEEE International Conference on Multimedia and Expo (ICME)
CountryTaiwan
CityTaipei
Period27/06/0430/06/04

Keywords

  • Internet
  • QoS routing
  • Switching and routing technologies

ASJC Scopus subject areas

  • Engineering(all)

Cite this