Competitive Routing of Virtual Circuits with Unknown Duration

Author： Awerbuch B.   Azar Y.   Plotkin S.   Waarts O.  

Publisher： Academic Press

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.62, Iss.3, 2001-05, pp. : 385-397

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Concurrent Placement and Routing in the Design of Integrated Circuits

By Erzin A. I.   Cho J. D.  

Automation and Remote Control, Vol. 64, Iss. 12, 2003-12 ,pp. : 1988-1999

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Competitive Memetic Algorithms for Arc Routing Problems

By Lacomme Philippe  

Annals of Operations Research, Vol. 131, Iss. 1-4, 2004-10 ,pp. : 159-185

Springer Publishing Company

Access to resources Recommend Favorite

Energy-efficient virtual grid aided routing for MANETs

By Wang Zhijun   Li Hezeng   Zhang Jingyuan  

International Journal of Pervasive Computing and Communications, Vol. 6, Iss. 3, 2010-09 ,pp. : 272-285

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Aligned virtual coordinates for greedy geometric routing in WSNs

By Liu Ke   Abu-Ghazaleh Nael  

International Journal of Sensor Networks, Vol. 3, Iss. 4, 2008-06 ,pp. : 252-265

Inderscience Publishers

Access to resources Recommend Favorite

Adaptive Virtual Cut-Through as a Viable Routing Method

By Kim H.W.   Lee H.S.   Lee S.   Kim J.  

Journal of Parallel and Distributed Computing, Vol. 52, Iss. 1, 1998-07 ,pp. : 82-95

Academic Press

Access to resources Recommend Favorite