Abstract
In source-based path selection, the sender chooses the path to the destination from a set of available paths and embeds the forwarding information in the packets. Future Internet proposals have employed this scheme to realize the benefits of source routing without the inherent scalability problems of path computation at the source. Furthermore, to address the security concerns of packet-carried forwarding state, these proposals leverage cryptographic primitives (e.g., Message Authentication Codes) per packet in the data plane. However, the implications on the forwarding performance of these novel routing schemes have not been studied in detail. In this paper, we study the data plane of source-based path selection schemes. We take SCION-a future Internet proposal-as an example and sketch its data plane implementation. We implement a software switch that can forward up to 140 million minimum-sized packets per second (limited by the hardware I/O subsystem) and can achieve line-rate throughput of 120 Gbps.
| Original language | English |
|---|---|
| Title of host publication | 10th International Conference on Future Internet, CFI 2015 |
| Publisher | Association for Computing Machinery |
| Pages | 41-45 |
| Number of pages | 5 |
| ISBN (Electronic) | 9781450335645 |
| DOIs | |
| Publication status | Published - 2015 Jun 8 |
| Event | 10th International Conference on Future Internet, CFI 2015 - Seoul, Korea, Republic of Duration: 2015 Jun 8 → 2015 Jun 10 |
Publication series
| Name | ACM International Conference Proceeding Series |
|---|---|
| Volume | 08-10-June-2015 |
Other
| Other | 10th International Conference on Future Internet, CFI 2015 |
|---|---|
| Country/Territory | Korea, Republic of |
| City | Seoul |
| Period | 15/6/8 → 15/6/10 |
Bibliographical note
Publisher Copyright:© 2015 ACM.
All Science Journal Classification (ASJC) codes
- Software
- Human-Computer Interaction
- Computer Vision and Pattern Recognition
- Computer Networks and Communications