Add to ORKGThis paper presents a novel scalable end-to-end routing protocol (HDRA), which combines the characteristics of both hierarchical and distributed routing protocols. HDRA selects a number of network domains to be traversed by a requested route. Only the selected domains are flooded with probing messages. This enables the deployment of flooding-based routing algorithms in large networks. The protocol has smaller setup time because it performs no central routing computation. HDRA does not require global state maintenance. However, it has higher message overheads when compared to PNNI
With the rapid advances in wireless and semiconductor technologies mobile connectivity became cheap ...
Control and user (data) plane separation (CUPS) is a concept applied in various networking areas to ...
In this paper the design of a dynamic Routing system, called Hierar- chical routing system, has been...
Abstract — Complexity of designing large and complex NoCs can be reduced/managed by using the concep...
The HD Tree is a novel data structure, which was recently proposed by Yunfeng Gu to support multi-di...
The size of the Internet’s forwarding table is growing rapidly, generating concerns about the abilit...
In a continually evolving Internet, tools such as quality of service routing must be used in order t...
This paper presents a new, flexible approach to inter-domain multicast routing. The HIP protocol int...
The optimal route between a given origin and destination needs to be computed in a fast and efficien...
SummaryThe hierarchical routing algorithm is categorized as a kind of routing method using node clus...
The scalability properties of DHT based overlay net-works is considered satisfactory. However, in la...
In this thesis, the adoption of the hierarchical routing paradigm to achieve a scalable network laye...
The theoretical performance advantages of dividing a network into independent routing domains is wel...
The scalability properties of DHT based overlay networks is considered satisfactory. However, in lar...
[[abstract]]A general-purpose routing algorithm is proposed. Ideas behind both the maze-running algo...
With the rapid advances in wireless and semiconductor technologies mobile connectivity became cheap ...
Control and user (data) plane separation (CUPS) is a concept applied in various networking areas to ...
In this paper the design of a dynamic Routing system, called Hierar- chical routing system, has been...
Abstract — Complexity of designing large and complex NoCs can be reduced/managed by using the concep...
The HD Tree is a novel data structure, which was recently proposed by Yunfeng Gu to support multi-di...
The size of the Internet’s forwarding table is growing rapidly, generating concerns about the abilit...
In a continually evolving Internet, tools such as quality of service routing must be used in order t...
This paper presents a new, flexible approach to inter-domain multicast routing. The HIP protocol int...
The optimal route between a given origin and destination needs to be computed in a fast and efficien...
SummaryThe hierarchical routing algorithm is categorized as a kind of routing method using node clus...
The scalability properties of DHT based overlay net-works is considered satisfactory. However, in la...
In this thesis, the adoption of the hierarchical routing paradigm to achieve a scalable network laye...
The theoretical performance advantages of dividing a network into independent routing domains is wel...
The scalability properties of DHT based overlay networks is considered satisfactory. However, in lar...
[[abstract]]A general-purpose routing algorithm is proposed. Ideas behind both the maze-running algo...
With the rapid advances in wireless and semiconductor technologies mobile connectivity became cheap ...
Control and user (data) plane separation (CUPS) is a concept applied in various networking areas to ...
In this paper the design of a dynamic Routing system, called Hierar- chical routing system, has been...