AGRIB-BHF: A sustainable and fault tolerant aggregation

Authors:
Mahesh Kumar;Shishir Kumar
Affiliations:
Department of Computer Science and Engineering, Jaypee University of Engineering and Technology, Guna, MP, India;Department of Computer Science and Engineering, Jaypee University of Engineering and Technology, Guna, MP, India
Venue:
Journal of Network and Computer Applications
Year:
2013

Citing 4
Cited 0

Six/one router: a scalable and backwards compatible solution for provider-independent addressing

Proceedings of the 3rd international workshop on Mobility in the evolving internet architecture
On the scalability of BGP: the roles of topology growth and update rate-limiting

CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
A cost matrix agent for shortest path routing in ad hoc networks

Journal of Network and Computer Applications
Secure and efficient disjoint multipath construction for fault tolerant routing in wireless sensor networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Growing size of the internet is raising concern to internet designers as the routing table growth leading to the state of difficulty in managing the huge amount of forwarding information on relatively limited memory size of line cards. Aggregation is a method of limiting the volume of data in the forwarding information base. Most of the existing approaches have shown aggressive aggregation tendency that leaves problems of black holes, overburden next hops links, inappropriate path selection in the forwarding information which subsequently degrades the overall performance of the internet. This paper proposes an approach AGRIB-BHF to overcome aforementioned problems of aggregation.