Counter-based routing policies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1745 LNCS, Issue , 1999, Pages 389-393

  Liu, Xicheng ^a   Xiang, Yangzhao ^a   Li, Timothy J ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ROUTING ALGORITHM; GENERIC ROUTING; REAL-TIME NETWORKS; RESEARCH EFFORTS; ROUTING POLICIES; SELECTION FUNCTION; TRAFFIC MEASUREMENTS; TRAFFIC PATTERN;

ROUTING ALGORITHMS;

NETWORK PERFORMANCE;

EID: 84877938309     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-46642-0_56     Document Type: Conference Paper

References (4)

1. Badr, H.G, Podar, S.: An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies. IEEE Transactions on Computes. 10 (1989) 1362-1371
2. Feng, W., and Shin, K.G.: Impact of Selection Functions on Routing Algorithm Performance in Multicomputer Networks. Proceedings of the 11th Annual Conference on Supercomputing (1997)
3. Lui, J.C.S., Muntz, R., Towsley, D.: Bounding the Mean Response Time of the Minimum Expected Delay Routing Policy: an Algorithm Approach. IEEE Transactions on Computes. 12 (1995) 1371-1382
4. Rao, R.: Utilization Imbalance in Wormhole Routed Networks. Master's Thesis. Ohio State University (1994)