Routing in networks with random topologies

被引:0
|
作者
Scott, K
Bambos, N
机构
关键词
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
We examine the problems of routing and server assignement in networks with random connectivities. In such a network the basic topology is fixed, but during each time slot and for each of its input queues, each server (node) is either connected to or disconnected from each of its input queues with some probability. During each time slot a server must decide which of its connected input queues to serve and into which of its output queues the completed job should be placed. For single-input single-output acyclic queueing networks with random connectivities, we show that the joint routing/service policy that routes customers along the least populated path to the destination and serves any non-empty queue maximumizes throughput. We briefly discuss some implementation aspects of the proposed policy, including its robustness in stabilizing the system with respect to delayed state information.
引用
收藏
页码:862 / 866
页数:5
相关论文
共 50 条
  • [1] Random walk routing in WSNs with regular topologies
    Tian, Hui
    Shen, Hong
    Matsuzawa, Teruo
    JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY, 2006, 21 (04) : 496 - 502
  • [2] Random Walk Routing in WSNs with Regular Topologies
    Hui Tian
    Hong Shen
    Teruo Matsuzawa
    Journal of Computer Science and Technology, 2006, 21 : 496 - 502
  • [3] Failure-Resilient Routing for Server-Centric Data Center Networks with Random Topologies
    Yu, Ye
    Qian, Chen
    2016 8TH IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING TECHNOLOGY AND SCIENCE (CLOUDCOM 2016), 2016, : 18 - 25
  • [4] SPECTRAL ANALYSIS OF NETWORKS WITH RANDOM TOPOLOGIES
    GRENANDER, U
    SILVERSTEIN, JW
    SIAM JOURNAL ON APPLIED MATHEMATICS, 1977, 32 (02) : 499 - 519
  • [5] Survivable routing of logical topologies in WDM networks
    Modiano, E
    Narula-Tam, A
    IEEE INFOCOM 2001: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS: TWENTY YEARS INTO THE COMMUNICATIONS ODYSSEY, 2001, : 348 - 357
  • [6] Routing schemes for multiple random broadcasts in arbitrary network topologies
    Varvarigos, EA
    Banerjee, A
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (08) : 886 - 895
  • [7] Routing schemes for multiple random broadcasts in arbitrary network topologies
    Univ of California at Santa Barbara, Santa Barbara, United States
    IEEE Trans Parallel Distrib Syst, 8 (886-895):
  • [8] Routing tree construction for interconnection networks with irregular topologies
    Chi, HC
    Wu, WJ
    ELEVENTH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2003, : 157 - 164
  • [9] Random Folded Clos Topologies for Datacenter Networks
    Camarero, Cristobal
    Martinez, Carmen
    Beivide, Ramon
    2017 23RD IEEE INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE COMPUTER ARCHITECTURE (HPCA), 2017, : 193 - 204
  • [10] SLOSL - A modelling language for topologies and routing in overlay networks
    Behnel, Stefan
    15TH EUROMICRO INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2007, : 498 - +