Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Efficient IP-Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers
KTH, School of Electrical Engineering (EES), Communication Networks.
Princeton University.
2008 (English)In: 2008 ACM CoNEXT Conference: 4th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '08; Madrid; 9 December 2008 through 12 December 2008, 2008Conference paper, Published paper (Refereed)
Abstract [en]

Virtual routers are a promising way to provide network services such as customerspecificrouting, policy-based routing, multi-topology routing, and network virtulization.However, the need to support a separate forwarding information base (FIB)for each virtual router leads to memory scaling challenges. In this paper, wepresent a small, shared data structure and a fast lookup algorithm that capitalize onthe commonality of IP prefixes between each FIB. Experiments with real packettraces and routing tables show that our approach achieves much lower memoryrequirements and considerably faster lookup times. Our prototype implementationin the Click modular router, running both in user space and in the Linux kernel,demonstrates that our data structure and algorithm are an interesting solution forbuilding scalable routers that support virtualization.

Place, publisher, year, edition, pages
2008.
Keywords [en]
IP-address lookup; Virtual routers
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-9412DOI: 10.1145/1544012.1544033Scopus ID: 2-s2.0-70350764027ISBN: 978-160558210-8 (print)OAI: oai:DiVA.org:kth-9412DiVA, id: diva2:113877
Note
QC 20100726Available from: 2008-10-30 Created: 2008-10-30 Last updated: 2010-07-26Bibliographically approved
In thesis
1. On the Design of Next-Generation Routers and IP Networks
Open this publication in new window or tab >>On the Design of Next-Generation Routers and IP Networks
2008 (English)Doctoral thesis, comprehensive summary (Other scientific)
Abstract [en]

This thesis investigates distributed router architectures and IP networks with centralized control. While the current trend in IP-router architectures is towards decentralized design, there have also been research proposals for centralizing the control functions in IP networks. With continuous evolution of routers and IP networks, we believe that eventually IP networks in an autonomous system (AS) and a distributed router might converge into one network system. This system, which can be considered both as a distributed router and a centrally-controlled IP network, is divided into a control plane and a forwarding plane. The control plane is responsible for routing, management and signalling protocols, while the forwarding plane is responsible for forwarding packets.

The work in this thesis covers both the forwarding and control planes. In the forwarding plane, we study network processor systems that function as forwarding elements in a distributed router. We introduce a system model and a simulation tool based on the model. Using the simulation tool, we investigate network processor system design by studying throughput, utilization, queueing behavior and packet delays. In addition to network processor systems, we study IP-address lookup, which is one of the key packet processing functions in Internet routers. Our work in IP-address lookup contains an efficient lookup algorithm, a scheme to divide the lookup procedure into two-stages in a distributed router, and an approach to perform efficient lookup on a router supporting multiple virtual routers.

In the control plane, we study three emerging research issues with centralized control. We provide a thorough study of the routing convergence process in networks with centralized control, and compare it with decentralized link-state routing protocols. We propose an efficient approach to perform traffic engineering and routing in networks with centralized control, and compare it with an approach using optimized link weights. Finally, we present an approach to perform loop-free updates of forwarding tables when the forwarding paths change. This loop-free update approach is particularly useful in networks with centralized control.

The results presented in this thesis are useful for building next-generation routers and IP networks with centralized control that might eventually converge into one network system.

Place, publisher, year, edition, pages
Stockholm: KTH, 2008. p. vii, 34
Series
Trita-EE, ISSN 1653-5146 ; 2008:040
Keywords
router architecture, IP-network architecture
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-9381 (URN)
Public defence
2008-11-26, M1, KTH, Stockholm, 14:00 (English)
Opponent
Supervisors
Note
QC 20100726Available from: 2008-11-03 Created: 2008-10-28 Last updated: 2010-07-26Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Fu, Jing
By organisation
Communication Networks
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 130 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf