Routing in high-speed networks
Routing in high-speed networks
Online computation and competitive analysis
Online computation and competitive analysis
Hierarchical QoS Routing in ATM Networks Based on MDP Cost Function
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Routing and Admission Control in General Topology Networks
Routing and Admission Control in General Topology Networks
An adaptive virtual path allocation policy for broadband networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Efficient hierarchical QoS routing in ATM networks
Computer Communications
Performance analysis for hierarchical multirate loss networks
IEEE/ACM Transactions on Networking (TON)
Distributed cost-based update policies for QoS routing on hierarchical networks
Information Sciences—Informatics and Computer Science: An International Journal
A QoS multicast routing protocol for dynamic group topology
Information Sciences: an International Journal
Wireless Personal Communications: An International Journal
A QoS multicast routing protocol for clustering mobile ad hoc networks
Computer Communications
Markov Decision Process Based Multiple Codes Assignment in UMTS WCDMA Mobile Networks
Wireless Personal Communications: An International Journal
MDP-based CAC for two-dimension spreading VSF-OFCDM in 4G cellular communications
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 0.00 |
QoS routing for hierarchical networks are adopted for achieving high scalability and efficiency, e.g., the Inter/Intra Internet and the ATM Private Network-to-Network Interface (PNNI) specification. In hierarchical routing, several nodes of lower level are aggregated as a logical node of the corresponding next higher level recursively. Moreover, in PNNI, each (logical) node bundles its state information in the structure of PNNI Topology StateElements (PTSE) and sends to its neighbors periodically. That results in hierarchical routing with inaccurate information. Since, aggregated routing information is exchanged based on a time-based update policy in PNNI. However, the dynamic nature of network status makes it very difficult to set an appropriate update interval. Therefore, in this paper, we propose two cost-based adaptive update policies: Dynamic Cost-based Update policy and Dynamic Cost-based Update policy with hysteresis, which update routing information only when the change of the cost of a link exceeds a threshold. Our numerical results show that the cost-based update policies not only reduce connection blocking probability, but also decrease the frequency of routing information updates. In this paper, we analyze three approaches to define link cost function and examine the performance of the cost-based update policies under these link cost functions. We find that the proposed cost-based adaptive update policies together with the Markov Decision Process-based link cost function yield the best performance.