Efficient FIB caching using minimal non-overlapping prefixes

Liu, Yaoqing; Amin, Syed Obaid; Wang, Lan

doi:10.1145/2427036.2427039

Cited by 34 publications

(4 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1 The controller performs the algorithms on the full FIB mentioned above in Section 3. The controller and switch may communicate over a secure connection if the hardware implementation supports this feature (see Section 6.3.3 of the OpenFlow Switch Specification 1.4 [20]).…”

Section: Openflow Controllermentioning

confidence: 99%

See 1 more Smart Citation

Efficient FIB caching using minimal non-overlapping prefixes

2015

Self Cite

View full text Add to dashboard Cite

The size of the global Routing Information Base (RIB) has been increasing at an alarming rate. This directly leads to the rapid growth of the global Forwarding Information Base (FIB) size, which raises serious concerns for ISPs as the FIB memory in line cards is much more expensive than regular memory modules and it is very costly to increase this memory capacity frequently for all the routers in an ISP. One potential solution is to install only the most popular FIB entries into the fast memory (i.e., a FIB cache), while storing the complete FIB in slow memory. In this paper, we propose an effective FIB caching scheme that achieves a considerably higher hit ratio than previous approaches while preventing the cache-hiding problem. Our experimental results show that with only 20K prefixes in the cache (5.36% of the actual FIB size), the hit ratio of our scheme is higher than 99.95%. Our scheme can also handle cache misses, cache replacement and routing updates efficiently.

show abstract

Section: Openflow Controllermentioning

confidence: 99%

“…Design architecture for OpenFlow implementation 1. Our code is available for research and other non-commercial purposes.Please contact us to obtain a copy of the source code.…”

mentioning

confidence: 99%

Efficient FIB caching using minimal non-overlapping prefixes

2015

Self Cite

View full text Add to dashboard Cite

show abstract

“…Software defined networking via OpenFlow provides network operators with the ability to flexibly and rapidly apply changes to how switches forward traffic [4] However, because we need to perform IP-redirection whilst maintaining TCP session state (As mentioned in Section III), this can lead to unreasonable flow table sizes and switch memory required in the OpenFlow-supported switch, which in turn inflates the cost required to build and provision such a network [16]. Therefore, it is desirable to implement the stateful part of our solution in a more scalable manner, that is agnostic towards the amount of state that is required to be held.…”

Section: Sdn and Nfv Based Ip-redirectionmentioning

confidence: 99%

Rapid IP Rerouting with SDN and NFV

Lai

Moors

2015

2015 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Current Content Delivery Networks (CDNs) primarily utilize the Domain Name System (DNS) to direct users towards optimal content replica servers. Typically, these CDNs will leverage specialized DNS servers to perform load balancing, by providing different users with different IP endpoints for a particular hostname. However, there typically exists some form of DNS cache between the user and the authoritative DNS for a particular web service (Examples include web browsers, operating systems, and home routers). While these DNS caches typically improve user experience and network performance by reducing the number of redundant DNS requests, there exist scenarios where the presence of a DNS cache can actually harm network performance and user experience. For example: if a server or datacentre were to suddenly become unavailable, end users may become 'stuck' trying to access the old IP address contained in their DNS caches, even though the authoritative DNS server may have updated it's records accordingly. In order to address this issue, we propose a system that enables network operators to transparently redirect users towards optimal servers during times of network congestion or high server load. By leveraging SDN and NFV, we are able to implement this system over a variety of network infrastructures, and to various levels of scale. Our initial tests indicate that our methodology has the capability to vastly improve user experience by several orders of magnitude during times of high network load, over a variety of network conditions. Our system is application-layer agnostic, and is compatible with various networking protocols.

show abstract

“…Otherwise the search on FIB determines the interface to send out the Interest. Since FIB is slower than PIT, the performance of the system can be further improved by using a small FIB-cache [3] at the PIT table.…”

Section: Architecturementioning

confidence: 99%

ndn||mem

Rezazad

Tay

2013

Proceedings of the 2013 Workshop on Student Workhop

View full text Add to dashboard Cite

Named Data Networking (NDN), as one of the candidates for a future Internet, has the potential to overcome many of the current Internet's difficulties (e.g., security, mobility, multicasting, etc.). However, there are also many open problems to be taken care of before it becomes operational.One of the major concerns is that NDN may be memoryintensive. Using the router's buffer as cache adds a search time to all requests. If the cache hit rate is not high enough (considering current buffer sizes and traffic rates), cache search time may be a burden on the system instead of solving any problems.Huge fast memories are not affordable yet. To balance the memory speed with incoming rate to a router, we propose a memory architecture, called ndn||mem, along with a content caching strategy, called CCndn. Using these two ideas, only a small fraction of packets need to engage in a time-intensive cache search process.Simulation results demonstrate the efficacy of our architecture.

show abstract

Efficient FIB caching using minimal non-overlapping prefixes

Cited by 34 publications

References 16 publications

Efficient FIB caching using minimal non-overlapping prefixes

Efficient FIB caching using minimal non-overlapping prefixes

Rapid IP Rerouting with SDN and NFV

ndn||mem

Contact Info

Product

Resources

About