Journal of KIISE:Information Networking (한국정보과학회논문지:정보통신)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

An Efficient Distributed Delay-Constrained Unicast Routing Algorithm

지연시간을 고려한 효율적인 분산 유니캐스트 라우팅 알고리즘

  • 신민우 (동신대학교 컴퓨터응용학과) ;
  • 임형석 (전남대학교 컴퓨터정보학부)
  • Published : 2002.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

We propose a heuristic distributed unicast routing algorithm for minimizing the total cost of the path in a point to point network with do]ay constraint. The algorithm maintains a delay vector and a cost vector about the network states and finds the path using this information. In this paper, we show that our algorithm always finds a delay-constrained path if such a path exists and has O(│E│) message complexity(│E│is the number of links in the network). Also, simulation results show that the proposed algorithm has better cost performance than other delay-constrained routing algorithms.

본 논문에서는 연결형 네트워크에서 종단간 지연시간을 만족하고 비용을 최소화하기 위한 휴리 스틱 분산 유니캐스트 라우팅 알고리즘을 제시한다. 제시하는 알고리즘은 각 노드마다 네트워크 상태에 대한 지연벡터(delay vector)및 비용벡터(cost vector)를 유지하고 이 정보를 이용하여 라우팅 경로를 찾는다. 이때 지연시간을 만족하는 경로가 존재하면 언제나 경로를 찾고, 경로를 결정하는데 O(│E│)(단│E│)는 네트워크를 구성하는 링크의 수)의 메시지 복잡도를 갖는다. 또한 시물레이션을 통하여 제안한 알고리즘이 기존의 지연시간 제한 알고리즘들보다 경로의 비용과 지연시간 측면에서 개선된 결과가 나옴을 보인다.

Keywords

References

  1. Hedrick, C, Routing Information Protocol, Internet RFC 1058, June 1988
  2. J. Moy, 'OSPF Version 2,' Internet RFC 1583, http://ds.internic.net/rfc/rfc1583.txt, March 1994
  3. R. Bellman, Dynamic Programming, Princeton University Press, 1957
  4. E. Dijkstra, 'Two Problem in Connection with Graphs,' Numerische Mathematik, vol. 1, no. 5, pp. 269-271, October 1959 https://doi.org/10.1007/BF01386390
  5. J. Garcia-Luna-Aceves and J. Behrens, 'Distributed, Scalable Routing Based on Vectors of Link States,' IEEE Journal on Slected Areas in Communications, vol. 13, no. 8, pp. 1383-1395, October 1995 https://doi.org/10.1109/49.464710
  6. Wang, Z. and Crowcroft, J., 'Quality-of-Service Routing for Supporting Multimedia Applications,' IEEE Journal on Selected Areas in Communications, 14(7), 1996 https://doi.org/10.1109/49.536364
  7. Kompella, V. P., et al., 'Multicast Routing for Multimedia Communication,' IEEE/ACM Transactions on Networking, 1(3),pp.286-292, 1993 https://doi.org/10.1109/90.234851
  8. Kompella, V. P., et al., 'Two Distributed Algorithms for the Constrained Steiner Tree Problem,' in Proceedings of the Second International Conference on Computer Communications and Networking, pp.343-349, 1993
  9. Widyono, R., 'The Design and Evaluation of Routing Algorithms for Real-Time Channels,' Technical Report TR-94-024, Tenet Group, Department of EECS, University of California at Berkeley, 1994
  10. Zhu, Q., et al, 'A Source-Based Algorithm for Near-Optimum Delay-Constrained Multicasting,' IEEE INFOCOM'95, pp.377-385, 1995 https://doi.org/10.1109/INFCOM.1995.515898
  11. Wi, S. and Choi, Y., 'A Delay Constrained Distributed Multicast Routing Algorithm,' 12th International Conference on Computer Communication, ICCC'95, pp.833-838, 1995
  12. Salama, H.F. Reeves, D.S. and Viniotis, Y., 'A Distributed Algorithm for Delay-Con strained Unicast Routing,' IEEE INFOCOM'97, pp.84-91, 1997
  13. Q. Sun and H. Langendoerfer, 'A New Distributed Routing Algorithm for Supporting Delay-Sensitive Applications,' Computer Communications, vol. 21, no. 6, pp. 572-578, May 1998 https://doi.org/10.1016/S0140-3664(98)00127-3
  14. Waxman, B.M., 'Routing of Multipoint Connections,' IEEE Journal on Selected Areas in Communications, 6(9),pp.1617-1622, 1988 https://doi.org/10.1109/49.12889
  15. Salama, H. F., et al, 'Evaluation of Multicast Routing Algorithms for Real-Time Communication on High-Speed Networks,' in High Performance Networking VI, IFIP 6th International Conference on High Performance Networking, pp.27-42, 1995