On-call processing delay in high speed networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.