Online computation and competitive analysis
Online computation and competitive analysis
Neural Networks and Fuzzy Systems: Theory and Applications
Neural Networks and Fuzzy Systems: Theory and Applications
Information Sciences—Informatics and Computer Science: An International Journal
The Effect of Network Hierarchy Structure on Performance of ATM PNNI Hierarchical Routing
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Routing Through Networks with Hierarchical Topology Aggregation
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Spanning tree method for link state aggregation in large communication networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Dynamic Update of Aggregated Routing Information for Hierarchical QoS Routing in ATM Networks
ICPADS '01 Proceedings of the Eighth International Conference on Parallel and Distributed Systems
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
Wireless Personal Communications: An International Journal
A method to evaluate routing policy through p minimal paths for stochastic case
Information Sciences: an International Journal
Information Sciences: an International Journal
| Hi-index | 0.00 |
As the number of nodes of the Internet increasing, there are two main issues have to be addressed for the reason of efficient routing. First the scalable issue, nowadays the Internet adopts flat routing, which is so-called hop-by-hop routing and yields the drawbacks of inefficient and non-scalable. One of good solutions is to form the flat networks into a hierarchy. The hierarchical network will consist of subnetworks, called peer groups, and peer groups will exchange the aggregated state information only. Second, the accuracy of routing information issue, the state information has to be exchanged among nodes for maintaining the up-to-date information of the networks. Most of networks exchange the state information periodically which is referred to as a time-based update policy. The dynamic nature of network status makes it very difficult to set an appropriate update interval. However, that is a trade-off between the accuracy of routing information and the overhead of exchanging state information. Therefore, in this paper, we first propose a distributed cost-based update policy, referred to as the dynamic cost-based update policy (DCU), to improve the accuracy of aggregated state information, while reducing the frequency of aggregation and information distribution. Nevertheless, DCU may suffer from routing oscillation. We then propose another three update policies to avoid the oscillation drawback, which are extended from DCU, referred to as the DCU update with hysteresis policy (DCUH), the DCU update with cost threshold policy (DCUCT), and the DCU update with cost threshold and hold down timer policy (DCUCTT). Performance of the proposed policies is compared with the PNNI time-based update policy (PNNIU), the full update policy (FU), and the logarithm of residual bandwidth update policy (LRBU). Our simulation results indicate that the four proposed dynamic cost-based update policies yield less revenue loss and aggregation overhead; furthermore, the proposed DCUCTT policy yields the best performance while significantly reduces the overhead of aggregation and advertising of state information.