Abstract
Middleboxes are special network devices that perform various functions such as enabling security and efficiency. SDN-based routing approaches in networks with middleboxes need to address resource constraints, such as memory in the switches and processing power of middleboxes, and traversal constraint where a flow must visit the required middleboxes in a specific order. In this work we propose a solution based on MultiPoint-To-Point Trees (MPTPT) for routing traffic in SDN-enabled networks with consolidated middleboxes. We show both theoretically and via simulations that our solution significantly reduces the number of routing rules in the switches, while guaranteeing optimum throughput and meeting processing requirements. Additionally, the underlying algorithm has low complexity making it suitable in dynamic network environment.
Original document
The different versions of the original document can be found in:
- https://people.ece.cornell.edu/atang/pub/15/Hotmiddlebox15.pdf,
- https://conferences.sigcomm.org/sigcomm/2015/pdf/papers/hotmiddlebox/p55.pdf,
- http://core.ac.uk/display/29525912,
- https://arxiv.org/pdf/1504.01771,
- https://doi.acm.org/10.1145/2785989.2785999,
- http://dblp.uni-trier.de/db/journals/corr/corr1504.html#GushchinWT15,
- https://dl.acm.org/citation.cfm?id=2785999,
- https://www.arxiv-vanity.com/papers/1504.01771,
- https://academic.microsoft.com/#/detail/1991911371
Document information
Published on 01/01/2015
Volume 2015, 2015
DOI: 10.1145/2785989.2785999
Licence: Other
Share this document
claim authorship
Are you one of the authors of this document?