Dynamic routing schemes for international networks
TL;DR: The characteristics of international 24-h traffic profiles are examined, and proposed dynamic routing schemes are described, and results on circuit savings and fault tolerance of international dynamic routing networks are outlined.
Abstract: Major issues that should be examined in evaluating the performance of networks with dynamic routing are reviewed The characteristics of international 24-h traffic profiles are examined, and proposed dynamic routing schemes are described Gain allocation principles are discussed, and results on circuit savings and fault tolerance of international dynamic routing networks are outlined >
Citations
More filters
12 Jun 1994
TL;DR: The authors first examine two VP capacity reservation strategies, design and evaluate computationally feasible Markov decision process-based routing algorithms and show that the network blocking probability can be significantly reduced by MDP routing.
Abstract: The virtual path (VP) concept has been proposed to simplify traffic control and resource management in future B-ISDN. In particular, call setup processing can be significantly reduced when resources are reserved on VPs. However, this advantage is offset by a decrease in statistical multiplexing gains of the networks. The focus of this paper is on how to improve bandwidth efficiency through adaptive routing when capacity is reserved on all VPs. The authors first examine two VP capacity reservation strategies. They then design and evaluate computationally feasible Markov decision process-based routing algorithms and show that the network blocking probability can be significantly reduced by MDP routing. >
67 citations
Cites background from "Dynamic routing schemes for interna..."
...Existing adaptive routing algorithms can be classi ed into two categories: Least-Load Path-based (LLP-based) [32, 33, 34, 35] and Markov Decision Process-based (MDP-based) [36, 37, 38, 39, 40]....
[...]
TL;DR: A distributed routing heuristic is proposed to reduce the call blocking rate while preserving a fast call setup time by simulations and shows that the proposed heuristic performs better in most cases than the other two schemes.
Abstract: In this paper, three related virtual channel routing problems on Broadband ISDN are investigated and shown to be NP-complete A distributed routing heuristic is proposed to reduce the call blocking rate while preserving a fast call setup time Various traffic patterns and network topologies are employed to evaluate the performance of the proposed heuristic by simulations Two existing famous routing schemes are also applied for comparison The simulation results show that the proposed heuristic performs better in most cases than the other two schemes
33 citations
TL;DR: Results show that routing algorithms based on a Markov decision theoretic framework yield better performance than least-load path routing (LLP) without incurring any significant increase in computational complexity.
33 citations
Additional excerpts
...feasible (e.g., DNHR[2, 3], DCR[27, 29 ], SDR[26], FLR[22])....
[...]
01 May 1993
TL;DR: This dissertation designs and evaluates state-dependent routing algorithms for high-speed networks which account for the these new network characteristics and considers the Virtual Path concept that has been proposed to simplify traffic control and resource management in future high- speed networks.
Abstract: In the 1990''s, significant advances in fiber optic and switching technology have precipitated the current explosion in the amount of research in future high-speed networks The challenges facing high-speed network researchers result not just from the high data transmission rate but also from other new charactoristics not previously encountered in traditional circuit-switched or packet-switched networks For example, features such as large propagation delay as compared to transmission delay; diverse application demands, constraints on all call processing capacity, and quality-of service QOS support for differant application all present new challenges which arise from the new technology and new applications Thus, much reseach is needed not just to improve existing technologies, but to seek a fundamentally differant approach toward network architectures and protocols In particular, new flow flow control and routing algorithms need to be developed to meet these new challenges The goal of this dissertation is to solve routing problems in the context of high-speed networks taking into account the new network environment In order to better undwerstand the influence of these new network characteristics on the routing problem, we first study the computational delays associated with call admission,routing, and call setup in the future of high-speed networks This study also leads us to explore the similarity between call setup in high-speed networks and circuit-switched networks and to study how approaches toward routing in circuit-switched networks can be adapted for routing in high-speed networks Specifically, based on the Markov Decision Process (MDP) framework, we next design and evaluate state-dependent routing algorithms for high-speed networks which account for the these new network characteristics Finally we consider the Virtual Path (VP) concept that has been proposed to simplify traffic control and resource management in future high-speed networks Thus, in the last part of this dissertation, we also demonstrate the efficiency of MDP-based routing algorithms in virtual path-based networks
28 citations
01 Jan 1996
TL;DR: In this article, a hierarchical approach to the routing issue in ATM-based broadband multi-service networks is proposed, where distributed route selection algorithms embedded within network nodes may be managed by a TMN system, by virtue of a management service called load balancing, to increase their adaptivity to network wide conditions.
Abstract: This paper proposes a hierarchical approach to the routing issue in ATM-based broadband multi-service networks. We show how distributed route selection algorithms embedded within network nodes may be managed by a TMN system, by virtue of a management service called load balancing, to increase their adaptivity to network wide conditions and therefore their effectiveness. The paper elaborates on the issues involved, presents specific algorithms and a TMN-compliant management architecture. The proposed management service influences the routing decisions by conveying network-wide information and contributes to the network load balancing by directing the routing algorithms to route traffic to the least congested network areas. Results regarding the effect of the proposed management system on the network operation are also presented.
27 citations
References
More filters
TL;DR: An efficient heuristic optimization method is introduced for solution of the LP routing problems, which greatly improves computational speed with minimal loss of accuracy and project computational requirements for a 200-node design problem, which is the estimated size of the intercity Bell System dynamic routing network in the 1990s.
Abstract: The growth of electronic switching systems and the high-capacity interoffice signaling network provide an opportunity to extend telephone network routing rules beyond the conventional hierarchy. Network models are described that illustrate the savings inherent in designing networks for dynamic, nonhierarchical routing. An algorithm for engineering such networks is discussed, and the comparative advantages of various path-routing and progressive-routing techniques are illustrated. A particularly simple implementation of dynamic routing called two-link dynamic routing with crankback is discussed and is shown to yield benefits comparable to much more complicated routing schemes. The efficient solution of embedded linear programming (LP) routing problems is an essential ingredient for the practicality of the design algorithm We introduce an efficient heuristic optimization method for solution of the LP routing problems, which greatly improves computational speed with minimal loss of accuracy. We also project computational requirements for a 200-node design problem, which is the estimated size of the intercity Bell System dynamic routing network in the 1990s.
257 citations
TL;DR: The TCS-V2 traffic-control system, an advanced automatic code-blocking system that uses area and subscriber congestion control, is considered, and the simulated performance of proportional control and threshold control is compared for this system.
Abstract: The objectives of network management control are outlined, and two categories of control are defined: network traffic controls and network configuration controls. Network traffic controls are further classified into traffic volume controls and routing controls, and advanced techniques for achieving each of them are examined. Two classes of methods for specifying the amount of traffic to be controlled are described. In proportional control, a certain proportion of the traffic offered by each exchange is admitted; in threshold control, there is a maximum rate at which the traffic offered by each exchange is admitted. The TCS-V2 traffic-control system, an advanced automatic code-blocking system that uses area and subscriber congestion control, is considered, and the simulated performance of proportional control and threshold control is compared for this system. For routing control, an advanced state-dependent dynamic routing scheme is examined, and the results of a comparative evaluation of dynamic routing schemes are presented. >
45 citations
TL;DR: It is shown by example that network integration coupled with flexible routing and bandwidth allocation for preferential treatment of new services provides an effective approach for robust and economical new service provisioning.
Abstract: The authors describe the structure of the worldwide intelligent network (WIN), describe methods for its design and planning, investigate the adequacy of decentralized control for problem-free worldwide call completion, explore the feasibility of adaptive routing and control concepts, discuss network robustness/reliability objectives, and describe a strategy for achieving these objectives for all cooperating international carriers. Several decentralized adaptive routing policies that are particularly attractive in the WIN environment and network performance improvements that can be achieved with the introduction of flexible routing capabilities are characterized. It is shown by example that network integration coupled with flexible routing and bandwidth allocation for preferential treatment of new services provides an effective approach for robust and economical new service provisioning. >
43 citations