DQDMR Algorithm for Improved QoS of VoIP Services 


Vol. 28,  No. 12, pp. 1100-1105, Dec.  2003


PDF
  Abstract

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system, the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth.
Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

S. Xu, H. Ji, S. Choi, Y. Cho, "DQDMR Algorithm for Improved QoS of VoIP Services," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 12, pp. 1100-1105, 2003. DOI: .

[ACM Style]

Shi-Ying Xu, Hong-Il Ji, Seung-Kwon Choi, and Yong-Hwan Cho. 2003. DQDMR Algorithm for Improved QoS of VoIP Services. The Journal of Korean Institute of Communications and Information Sciences, 28, 12, (2003), 1100-1105. DOI: .

[KICS Style]

Shi-Ying Xu, Hong-Il Ji, Seung-Kwon Choi, Yong-Hwan Cho, "DQDMR Algorithm for Improved QoS of VoIP Services," The Journal of Korean Institute of Communications and Information Sciences, vol. 28, no. 12, pp. 1100-1105, 12. 2003.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880