skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Quickest Paths for Different Network Router Mechanisms

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. The authors consider four basic modes and two variations for the message delivery at the nodes reflecting the mechanisms such as circuit switching, Internet protocol, and their combinations. For each of the first three modes, they present O(m{sup 2} + mn log n) time 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 + n log n) time.

Authors:
; ; ;
Publication Date:
Research Org.:
Oak Ridge National Lab., TN (US)
Sponsoring Org.:
USDOE Office of Science (US)
OSTI Identifier:
769289
Report Number(s):
ORNL/TM-2000/208
TRN: AH200104%%308
DOE Contract Number:  
AC05-00OR22725
Resource Type:
Technical Report
Resource Relation:
Other Information: PBD: 1 Jun 2000
Country of Publication:
United States
Language:
English
Subject:
99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ALGORITHMS; INTERNET; COMPUTER NETWORKS; NETWORK ANALYSIS; ROUTING

Citation Formats

Rao, N.S.V., Grimmell, W.C., Radhakrishnan, S., and Bang, Y.C. Quickest Paths for Different Network Router Mechanisms. United States: N. p., 2000. Web. doi:10.2172/769289.
Rao, N.S.V., Grimmell, W.C., Radhakrishnan, S., & Bang, Y.C. Quickest Paths for Different Network Router Mechanisms. United States. doi:10.2172/769289.
Rao, N.S.V., Grimmell, W.C., Radhakrishnan, S., and Bang, Y.C. Thu . "Quickest Paths for Different Network Router Mechanisms". United States. doi:10.2172/769289. https://www.osti.gov/servlets/purl/769289.
@article{osti_769289,
title = {Quickest Paths for Different Network Router Mechanisms},
author = {Rao, N.S.V. and Grimmell, W.C. and Radhakrishnan, S. and Bang, Y.C.},
abstractNote = {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. The authors consider four basic modes and two variations for the message delivery at the nodes reflecting the mechanisms such as circuit switching, Internet protocol, and their combinations. For each of the first three modes, they present O(m{sup 2} + mn log n) time 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 + n log n) time.},
doi = {10.2172/769289},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2000},
month = {6}
}