National Technical Reports Library

The National Technical Information Service acquires, indexes, abstracts, and archives the largest collection of U.S. government-sponsored technical reports in existence. The NTRL offers online, free and open access to these authenticated government technical reports. Technical reports and documents in its repository may be available online for free either from the issuing federal agency, the U.S. Government Publishing Office’s Federal Digital System website, or through search engines.

Details

Quickest Paths for Different Network Router Mechanisms.

DE2001769289

Publication Date	2000
Personal Author	Rao, N. S. V.; Grimmell, W. C.; Radhakrishnan, S.; Bang, Y. C.
Page Count	18
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.
Keywords	Network analysis Routing Algorithms Internet Computer networks
Source Agency	Technical Information Center Oak Ridge Tennessee
Corporate Authors	Oak Ridge National Lab., TN.; Department of Energy, Washington, DC.
Document Type	Technical Report
NTIS Issue Number	200124
Contract Number	AC05-00OR22725

Quickest Paths for Different Network Router Mechanisms.

Quickest Paths for Different Network Router Mechanisms.
DE2001769289

Publication Date	2000
Personal Author	Rao, N. S. V.; Grimmell, W. C.; Radhakrishnan, S.; Bang, Y. C.
Page Count	18
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.
Keywords	Network analysis Routing Algorithms Internet Computer networks
Source Agency	Technical Information Center Oak Ridge Tennessee
Corporate Authors	Oak Ridge National Lab., TN.; Department of Energy, Washington, DC.
Document Type	Technical Report
NTIS Issue Number	200124
Contract Number	AC05-00OR22725