Abstract
Network Coding exploits network resources more efficiently than plain routing. Specifically, it reduces packet delays and packet loss rates. Such advantages are especially useful in core networks where many different users can benefit from this at once. Hence, network coding should be transparently integrated in technologies suitable for core networks. We present an extension for MPLS and RSVP-TE which can instantiate network-coded paths in core networks. The feasibility of this approach is demonstrated in a proof-of-concept simulation.
The research leading to these results has received funding from the European Community’s Seventh Framework Programme (FP7/2007-2013) under grant agreement n° 216041.
Chapter PDF
Similar content being viewed by others
References
Fragouli, C., Boudec, J.Y.L., Widmer, J.: Network coding: An instant primer. SIGCOMM Comput. Commun. Rev. 36(1), 63–68 (2006)
Katti, S., Rahul, H., Hu, W., Katabi, D., Médard, M., Crowcroft, J.: XORs in the air: Practical wireless network coding. SIGCOMM Comput. Commun. Rev. 36(4), 243–254 (2006)
Chaporkar, P., Proutiere, A.: Adaptive network coding and scheduling for maximizing throughput in wireless networks. In: MobiCom, pp. 135–146. ACM, New York (2007)
Gkantsidis, C., Rodriguez, P.R.: Network coding for large scale content distribution. In: INFOCOM 2005, vol. 4, pp. 2235–2245 (2005)
Wang, C.C., Shroff, N.B.: Beyond the butterfly – a graph-theoretic characterization of the feasibility of network coding with two simple unicast sessions. In: Proc. IEEE Intl. Symp. on Information Theory, Nice, France (June 2007)
Rosen, E., Viswanathan, A., Callon, R.: Multiprotocol Label Switching Architecture. RFC 3031 (Proposed Standard) (January 2001)
Awduche, D., Berger, L., Gan, D., Li, T., Srinivasan, V., Swallow, G.: RSVP-TE: Extensions to RSVP for LSP Tunnels. RFC 3209 (Proposed Standard), Updated by RFCs 3936, 4420, 4874, 5151 (December 2001)
Aggarwal, R., Papadimitriou, D., Yasukawa, S.: Extensions to Resource Reservation Protocol - Traffic Engineering (RSVP-TE) for Point-to-Multipoint TE Label Switched Paths (LSPs). RFC 4875 (Proposed Standard) (May 2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 IFIP International Federation for Information Processing
About this paper
Cite this paper
Biermann, T., Schwabe, A., Karl, H. (2009). Creating Butterflies in the Core – A Network Coding Extension for MPLS/RSVP-TE. In: Fratta, L., Schulzrinne, H., Takahashi, Y., Spaniol, O. (eds) NETWORKING 2009. NETWORKING 2009. Lecture Notes in Computer Science, vol 5550. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01399-7_69
Download citation
DOI: https://doi.org/10.1007/978-3-642-01399-7_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01398-0
Online ISBN: 978-3-642-01399-7
eBook Packages: Computer ScienceComputer Science (R0)