Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T04:20:09.901Z Has data issue: false hasContentIssue false

Reordering heuristics for routing in communications networks

Published online by Cambridge University Press:  14 July 2016

Donald M. Topkis*
Affiliation:
AT&T Bell Laboratories
*
∗ Present address: Graduate School of Administration, University of California, Davis, CA 95616, USA.

Abstract

Move-to-front and move-to-back heuristics are considered for adaptively reordering routing tables in communications networks. Limiting properties are established for Markov chain models of these heuristics. The limiting distributions of the number of path attempts per call for the two heuristics and for a fixed random permutation are stochastically ordered.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1986 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable