IEICE TRANSACTIONS on Communications
On Algorithms for Quickest Paths under Different Routing Modes
Summary :
In the emerging networks, routing may be performed at various levels of the TCP/IP stack, such as datagram, TCP stream or application level, with possibly different message forwarding modes. We formulate an abstract quickest path problem for the transmission of a message of size σ 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 six modes for the message forwarding at the nodes reflecting the mechanisms such as circuit switching, store and forward, and their combinations. For each of first five modes, we present O( m2 + mn log n ) time algorithms to compute the quickest path for a given message size σ. For the last mode, the quickest path can be computed in O(m + n log n ) time.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E87-B No.4 pp.1002-1006
- Publication Date
- 2004/04/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Fundamental Theories
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Nageswara S.V. RAO, William C. GRIMMELL, Young-Cheol BANG, Sridhar RADHAKRISHNAN, "On Algorithms for Quickest Paths under Different Routing Modes" in IEICE TRANSACTIONS on Communications,
vol. E87-B, no. 4, pp. 1002-1006, April 2004, doi: .
Abstract: In the emerging networks, routing may be performed at various levels of the TCP/IP stack, such as datagram, TCP stream or application level, with possibly different message forwarding modes. We formulate an abstract quickest path problem for the transmission of a message of size σ 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 six modes for the message forwarding at the nodes reflecting the mechanisms such as circuit switching, store and forward, and their combinations. For each of first five modes, we present O( m2 + mn log n ) time algorithms to compute the quickest path for a given message size σ. For the last mode, the quickest path can be computed in O(m + n log n ) time.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e87-b_4_1002/_p
Copy
@ARTICLE{e87-b_4_1002,
author={Nageswara S.V. RAO, William C. GRIMMELL, Young-Cheol BANG, Sridhar RADHAKRISHNAN, },
journal={IEICE TRANSACTIONS on Communications},
title={On Algorithms for Quickest Paths under Different Routing Modes},
year={2004},
volume={E87-B},
number={4},
pages={1002-1006},
abstract={In the emerging networks, routing may be performed at various levels of the TCP/IP stack, such as datagram, TCP stream or application level, with possibly different message forwarding modes. We formulate an abstract quickest path problem for the transmission of a message of size σ 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 six modes for the message forwarding at the nodes reflecting the mechanisms such as circuit switching, store and forward, and their combinations. For each of first five modes, we present O( m2 + mn log n ) time algorithms to compute the quickest path for a given message size σ. For the last mode, the quickest path can be computed in O(m + n log n ) time.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - On Algorithms for Quickest Paths under Different Routing Modes
T2 - IEICE TRANSACTIONS on Communications
SP - 1002
EP - 1006
AU - Nageswara S.V. RAO
AU - William C. GRIMMELL
AU - Young-Cheol BANG
AU - Sridhar RADHAKRISHNAN
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E87-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2004
AB - In the emerging networks, routing may be performed at various levels of the TCP/IP stack, such as datagram, TCP stream or application level, with possibly different message forwarding modes. We formulate an abstract quickest path problem for the transmission of a message of size σ 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 six modes for the message forwarding at the nodes reflecting the mechanisms such as circuit switching, store and forward, and their combinations. For each of first five modes, we present O( m2 + mn log n ) time algorithms to compute the quickest path for a given message size σ. For the last mode, the quickest path can be computed in O(m + n log n ) time.
ER -
English
