Showing papers on "Hazy Sighted Link State Routing Protocol published in 1981"

Servicing and real-time control of networks with dynamic routing

Abstract: The design of a network for dynamic routing is made using the forecasted network loads. Load uncertainties arising from errors in the forecast and from daily variations in network load give rise to reserve or idle network capacity not immediately needed by current network demands. The reserve capacity can be reduced by the use of more flexible dynamic routing methods, which allow routing flexibility to help control network flow under load uncertainties. We illustrate techniques for changing network routing patterns in planned and demand servicing to counteract the effects of forecast errors. Included in the benefits are a reduction in both reserve capacity, estimated to be about 5 percent of network first cost, and in trunk rearrangements. We also present call-by-call simulation results for real-time routing enhancements to the basic routing algorithms. The real-time routing algorithms use dynamic trunk reservation techniques, and the simulation results illustrate the improvement in network efficiency and performance under normal daily load variations, network overloads, and network failures.

Advances in Verifiable Fail-Safe Routing Procedures

Abstract: Two new versions of a distributed protocol for establishing and maintaining loop-free routing tables for communication networks with changing topology are presented. The protocols here possess significant advantages over previous versions in terms of complexity of the node algorithm and of the validation procedure, as well as the communication and storage needs. In addition, we present a procedure for establishing new and disrupted calls in a virtual or physical circuit-switched network, and for canceling existing calls, such that each call is loop-free and is established according to the routing tables provided by the protocol.

A Failsafe Distributed Protocol for Minimum Delay Routing

Abstract: Previous distributed routing protocols in data-communication networks that achieve minimum average delay are extended to take into consideration topological changes in the network.

Adaptive routing in large communication networks: Probabilistic study

Abstract: A network model is presented and conditions for stochastic stability of the network system are given. For adaptation algorithms which change the routing probabilities slowly (small stepsize), expressions for steady-state variances are derived; usimg these, guidelines for the selection of algorithm parameters are discussed.