Quickest Path Based Integrated Routing Algorithms for Different Network Router Mechanisms

Bang Young-Cheol; Chung Sung-Taek

Quickest Path Based Integrated Routing Algorithms for Different Network Router Mechanisms

Bang Young-Cheol, Chung Sung-Taek, Journal of Internet Computing and Services, Vol. 7, No. 1, pp. 143-150, Feb. 2006
Full Text:

Keywords: Quickest Path, Router

Abstract

The quickest path problem deals with the transmission of a message of size ${\sigma}$ from a source to a destination with the minimum end to end delay over a network with bandwidth and delay constraints on the links. We consider two basic modes and four variations for the message delivery at the nodes reflecting the mechanisms such as circuit switching. Internet protocol, and their combinations, For each of first five modes, we present O($m^2+mnlogn$) algorithm to compute the quickest path for a given message size ${\sigma}$, For the last mode, the quickest path can be computed in O(m+nlogn) time.

Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
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

[APA Style]

Young-Cheol, B. & Sung-Taek, C. (2006). Quickest Path Based Integrated Routing Algorithms for Different Network Router Mechanisms. Journal of Internet Computing and Services, 7(1), 143-150.

[IEEE Style]

B. Young-Cheol and C. Sung-Taek, "Quickest Path Based Integrated Routing Algorithms for Different Network Router Mechanisms," Journal of Internet Computing and Services, vol. 7, no. 1, pp. 143-150, 2006.

[ACM Style]

Bang Young-Cheol and Chung Sung-Taek. 2006. Quickest Path Based Integrated Routing Algorithms for Different Network Router Mechanisms. Journal of Internet Computing and Services, 7, 1, (2006), 143-150.