Showing papers on "Wireless Routing Protocol published in 1986"

Near-Optimal n-Layer Channel Routing

Abstract: In this paper we present two n-layer channel routing algorithms that guarantee successful routing of the channel for n greater than three. The first is linear and optimal given a VHV...HV assignment of layers. The second, using an HVH...VH layer assignment, is quasilinear and performs optimally on examples from the literature. Except in pathological cases, we expect the latter router to perform within one row of optimal. For comparison with published examples we implemented the second router in five and three layers. The five-layer implementation routed all examples optimally while the three-layer implementation routed the examples with the same or fewer rows than the published examples. With its n-layer capability this channel router will allow channel routing to be used when more than three layers are available. This router can also be used to evaluate the utility of additional layers.

State-dependent routing for telephone traffic: Theory and results

Abstract: In the modern telephone network, it has become feasible to consider sophisticated call-routing schemes in order to minimize network blocking --- in particular, routing schemes which select a route for a call on the basis of the network 'state' at the time of call-arrival. In this paper, we construct an analytical model for such state-dependent routing in the framework of Markov decision processes, and derive a simple state-dependent routing scheme called 'separable' routing. The performance of this routing scheme in two network designs for a metropolitan network model is compared over a range of loads, by means of call-by-call simulations of traffic flow, with that of two other schemes: the 'sequential' routing used in the Dynamic Non-Hierarchical Routing (DNHR) network, and the 'Least-Loaded Routing' (LLR) proposed for the Trunk Status Map. In one case, separable routing achieves lower network blocking than the other schemes at normal load and overloads, while, in the other case, the improvement occurs only above a certain level of overload. However, a modified version of separable routing (to be presented in a future paper) achieves better performance than the other schemes in both networks over the entire range of loads.

Near-optimaln-layer channel routing

Abstract: In this paper we present two n-layer channel routing algorithms that guarantee successful routing of the channel for n greater than three. The first is linear and optimal given a VHV...HV assignment of layers. The second, using an HVH...VH layer assignment, is quasilinear and performs optimally on examples from the literature. Except in pathological cases, we expect the latter router to perform within one row of optimal. For comparison with published examples we implemented the second router in five and three layers. The five-layer implementation routed all examples optimally while the three-layer implementation routed the examples with the same or fewer rows than the published examples. With its n-layer capability this channel router will allow channel routing to be used when more than three layers are available. This router can also be used to evaluate the utility of additional layers.

Vehicle Routing with Time-Window Constraints

Abstract: (1986). Vehicle Routing with Time-Window Constraints. American Journal of Mathematical and Management Sciences: Vol. 6, Vehicle Routing with Time-Window Constraints: Algorithmic Solutions, pp. 251-260.

A Heuristic for Manhattan Routing

Abstract: [ U N C L A S S IF IE O /U N L IM IT E D £3 SAME AS RPT. 22a. N A M E OF RESPONSIBLE I N D IV ID U A L [D FORM 1473, 83 APR O TIC USERS □ 21. A B S T R A C T S E C U R IT Y C L A S S IF IC A T IO N Unclassified 22b. T E L E P H O N E N U M B E R (Include Area Codei E D IT IO N OF 1 jA N “3 IS OBSOLETE. 22c. O FFIC E S Y M B O L S E C U R I T Y C L A S S I F I C A T I O N OF T H I S = S E C U R IT Y C L A S S IF IC A T IO N O F T H IS PAGE I accordingly to certain priorities assigned to the vertices of A and B. The algorithm is coded in Pascal and implemented on a VAX 11/780 computer and its running time is 0 (n2), vhere n denotes the number of nets. Experimental results are particularly satisfactory when runs of quite different lengths can be reduced to the same length.