링 구조의 데이터 통신망에서의 라우팅 방안

Routing Algorithms on a Ring-type Data Network

  • 주운기 (선문대학교 지식정보산업공학과)
  • 발행 : 2005.05.13

초록

This paper considers a routing problem on a RPR(Resilient Packet Ring). The RPR is one of the ring-type data telecommunication network. Our major problem is to find an optimal routing algorithm for a given data traffic on the network under no splitting the traffic service, where the maximum load of a link is minimized. This paper characterizes the Minmax problem and develops two heuristic algorithms. By using the numerical comparison, we show that our heuristic algorithm is valuable for efficient routing the data traffic on a RPR.

키워드