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. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.jnca.2012.10.009 | J. Network and Computer Applications |
Keywords | DocType | Volume |
black hole,forwarding information base,aforementioned problem,internet designer,fault tolerant aggregation,existing approach,huge amount,aggressive aggregation tendency,approach AGRIB-BHF,limited memory size,forwarding information | Journal | 36 |
Issue | ISSN | Citations |
2 | 1084-8045 | 0 |
PageRank | References | Authors |
0.34 | 8 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mahesh Kumar | 1 | 16 | 4.10 |
Shishir Kumar | 2 | 78 | 17.06 |