ERID: Edge Router Identification for Fast Forwarding Packet in BGP Domain

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6935)


In this paper, serial edge router ID based fast forwarding scheme proposed to enhance the performance of high-speed backbone router for fast packet forwarding. Proposed scheme takes advantage by serializing the identity of edge routers on high speed backbone that is used for indexing the memory location of next hope information to enhance the packet forwarding speed. In this Scheme, Each edge router that connects the two Autonomous System domains is assigned serial edge router ID (ERID) by central authority and each edge router maintain the ERID list and corresponding next hop information in ERID-FIB table generated through current routing information base. When two peers establishes the session between them using current forwarding Information base, initially they exchange the ERID of edge router that immediate to it in own AS. In subsequent communication, ERID is included in packet and next hop information is determined from ERID-FIB table at memory location corresponding to ERID. Through proposed scheme, next hop information retrieve in O(1) time complexity and in single memory access time.


packet forwarding routing information base (RIB) forwarding information base (FIB) border router 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Zheng, K., Hu, C., Lu, H., Liu, B.: A TCAM-Based Distributed Parallel IP Lookup Scheme and Performance Analysis. IEEE/ACM Transactions on Networking 14(4) (2006)Google Scholar
  2. 2.
    Huang, K., Xie, G., Li, Y., Liu, A.X.: Offset Addressing Approach to Memory-Efficient IP Address Lookup. In: IEEE INFOCOM Mini-Conference, Shanghai (2011)Google Scholar
  3. 3.
    Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. IETF, RFC 3031 (January 2001)Google Scholar
  4. 4.
    Ruiz-sánchez, M.Á., Biersack, E.W., Dabbous, S.W.: Survey and Taxonomy of IP Address Lookup Algorithms. IEEE Network 15, 8–23 (2001)CrossRefGoogle Scholar
  5. 5.
    Yu, H.: A memory- and time-efficient on-chip TCAM minimizer for IP lookup Design. In: Automation & Test in Europe Conference & Exhibition, Dresden, pp. 926–931 (2010)Google Scholar
  6. 6.
    Akhbarizadeh, M.J., Nourani, M., Panigrahy, R., Sharma, S.: A TCAM-Based Parallel Architecture for High-Speed Packet Forwarding. IEEE Transactions on Computers 56(1) (2007)Google Scholar
  7. 7.
    Lu, W., Sahni, S.: Low-Power TCAMs for Very Large Forwarding Tables. IEEE/ACM Transactions on Networking 18(3) (2010)Google Scholar
  8. 8.
    Oh, S.-H., Ahn, J.-S.: Bit-map trie: a data structure for fast forwarding lookups. In: Global Telecommunications Conference (GLOBECOM), San Antonio, TX, pp. 1872–1876 (2001)Google Scholar
  9. 9.
    Yu, H., Mahapatra, R., Bhuyan, L.: A hash-based scalable IP lookup using Bloom and fingerprint filters. In: 17th IEEE International Conference on Network Protocols, Princeton, NJ, pp. 264–273 (2009)Google Scholar
  10. 10.
    Maghbouleh, A.: Ten+ Years of MPLS: A Retrospective Deployment Survey. In: MPLS 2010 Conference, Washington, DC (2010)Google Scholar
  11. 11.
    Rekhter, Y., Li, T.: A Border Gateway Protocol 4(BGP-4). IETF RFC 1771 (March 1995)Google Scholar
  12. 12.
    Jiang, W., Prasannaa, V.K.: Sequence-preserving parallel IP lookup using multiple SRAM-based pipelines. Journal of Parallel and Distributed Computing 69, 778–789 (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  1. 1.Future Internet TeamNational Institute for Mathematical SciencesDaejeonSouth Korea
  2. 2.Dept. of Ubiquitous ITDongseo UniversityBusanSouth Korea

Personalised recommendations