On Algorithms for Quickest Paths under Different Routing Modes(Fundamental Theories)

スポンサーリンク

概要

• 論文の詳細を見る

• 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(m^2 + 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.

• 社団法人電子情報通信学会の論文
• 2004-04-01

著者

• Rao Nageswara

  Center For Engineering Science Advanced Research Computer Science And Mathematics Division Oak Ridge

• BANG Young-Cheol

  Department of Computer Engineering, Korea Polytechnic University

• Bang Young-cheol

  Department Of Computer Engineering Korea Polytechnic University

• GRIMMELL William

  Center for Engineering Science Advanced Research, Computer Science and Mathematics Division, Oak Rid

• RADHAKRISHNAN Sridhar

  School of Computer Science, University of Oklahoma

• Grimmell William

  Center For Engineering Science Advanced Research Computer Science And Mathematics Division Oak Ridge

• Radhakrishnan Sridhar

  School Of Computer Science University Of Oklahoma

関連論文

• An Energy-Aware Multipath Routing Algorithm in Wireless Sensor Networks
• On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints(Networking Technologies for Overlay Networks)
• On Algorithms for Quickest Paths under Different Routing Modes(Fundamental Theories)

スポンサーリンク