TY - GEN
T1 - NB-Cache
T2 - 2019 International Symposium on Quality of Service, IWQoS 2019
AU - Pan, Tian
AU - Lin, Xingchen
AU - Zhang, Jiao
AU - Huang, Tao
AU - Li, Hao
AU - Lv, Jianhui
AU - Liu, Bin
AU - Zhang, Beichuan
N1 - Publisher Copyright:
© 2019 Association for Computing Machinery.
PY - 2019/6/24
Y1 - 2019/6/24
N2 - Information-Centric Networking (ICN) provides scalable and efficient content distribution at the Internet scale due to its in-network caching and native multicast capabilities. To support these features, a content router needs high performance at its data plane, which consists of three forwarding steps: checking the Content Store (CS), then the Pending Interest Table (PIT), and finally the Forwarding Information Base (FIB). While prior works focus on performance optimization of a single step, we build an analytical model of content router's entire data plane and identify that CS is the actual bottleneck in the pipeline. Compared with PIT and FIB, CS is more challenging because it has more data to read/write, may have more entries in its table to store and lookup, and needs to organize content objects to sustain frequent cache replacement. Then, we propose a novel mechanism called "NB-Cache" to address CS's performance issue from a network-wide point of view rather than a single router's. In NB-Cache, when packets arrive at a router whose CS is fully loaded, instead of being blocked and waiting for the CS, these packets are forwarded to the next-hop router, whose CS may not be fully loaded. This approach essentially utilizes Content Stores of all the routers along the forwarding path in parallel rather than checking each CS sequentially. Our experiments show significant improvement of data plane performance: 70% reduction in round-trip time (RTT) and 130% increase in throughput.
AB - Information-Centric Networking (ICN) provides scalable and efficient content distribution at the Internet scale due to its in-network caching and native multicast capabilities. To support these features, a content router needs high performance at its data plane, which consists of three forwarding steps: checking the Content Store (CS), then the Pending Interest Table (PIT), and finally the Forwarding Information Base (FIB). While prior works focus on performance optimization of a single step, we build an analytical model of content router's entire data plane and identify that CS is the actual bottleneck in the pipeline. Compared with PIT and FIB, CS is more challenging because it has more data to read/write, may have more entries in its table to store and lookup, and needs to organize content objects to sustain frequent cache replacement. Then, we propose a novel mechanism called "NB-Cache" to address CS's performance issue from a network-wide point of view rather than a single router's. In NB-Cache, when packets arrive at a router whose CS is fully loaded, instead of being blocked and waiting for the CS, these packets are forwarded to the next-hop router, whose CS may not be fully loaded. This approach essentially utilizes Content Stores of all the routers along the forwarding path in parallel rather than checking each CS sequentially. Our experiments show significant improvement of data plane performance: 70% reduction in round-trip time (RTT) and 130% increase in throughput.
KW - Bottleneck Bypassing
KW - Content Router
KW - ICN
KW - Non-Blocking I/O
UR - http://www.scopus.com/inward/record.url?scp=85069222322&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85069222322&partnerID=8YFLogxK
U2 - 10.1145/3326285.3329041
DO - 10.1145/3326285.3329041
M3 - Conference contribution
AN - SCOPUS:85069222322
T3 - Proceedings of the International Symposium on Quality of Service, IWQoS 2019
BT - Proceedings of the International Symposium on Quality of Service, IWQoS 2019
PB - Association for Computing Machinery, Inc
Y2 - 24 June 2019 through 25 June 2019
ER -