1 / 9

Dynamic Network Coding

Dynamic Network Coding. draft-montpetit-dynamic-NC-00 Marie-José Montpetit, MIT Media Laboratory Vincent Roca, INRIA Jonathan Detchart, ISAE March 27 2015. What is Dynamic Network Coding. A framework for “NC as a transport” Integrate with network dynamics

banna
Download Presentation

Dynamic Network Coding

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Dynamic Network Coding draft-montpetit-dynamic-NC-00 Marie-José Montpetit, MIT Media Laboratory Vincent Roca, INRIA Jonathan Detchart, ISAE March 27 2015

  2. What is Dynamic Network Coding • A framework for “NC as a transport” • Integrate with network dynamics • Allow per hop coding policies (not end to end) • Integrate with novel Internet architectures (ICN/CCN) • Integrate with legacy NC while integrate novel features • Open source implementation to foster innovation • DNC is not a code in the strictest sense but more a way to integrate network coding in Internet Transport (FECFRAME heritage)

  3. Salient Features (1) • DNC allows to: • Make coding decision based on policy • Recognize local IPR rules and network management decisions • Make coding decisions based on time and instantaneous network conditions: • Traffic conditions vary during the day • The time since stored in a cache may also influence how the coding is performed • Inherently use a per hop concept: “network code” • Code composition • Not transmit coding coefficients but a function to recreate the coding vector at each coding opportunity

  4. Salient Features (2) • Some header fields: • Time stamp • Capture the time the packet is created • Maybe refreshed at each coding opportunity • Codepoint • Indicates the path (like a route #) the packet has taken hence identify the potential re-encoding nodes and allow to recover the coding coefficients • Coding function/pointer • To identify the coding mechanism at each hop • Can be a pointer to an existing vector or to a new vector created from the time stamp, the codepoint and the local network management policies

  5. Compatibility with the nwcrgHeader Format • Layered Coded Transport Header (RFC 5651) heritage • Goal: • Common header for all packets • Allow for protocol specific sections • Use header extensions • Also consider compatibility with existing ALC/NORM header extensions

  6. Known Issues • Manage: • Code-points: • What they are • What happens at path merging • Timestamps • Policies • Define signaling of coding vectors or mechanisms to regenerate them • Link to nwcrg architecture Still very early: at the concept/research stage

  7. Conclusion: Future Steps? • Document: • Continue the development of the key concepts • Change to draft-nwcrg-dynamic-nc • Concept: • Ensure compatibility with other nwcrg proposed frameworks and architecture • Start some software implementation • Transport/architecture aspects: • Continue to monitor the work in TAPS and ICNRG to see how to further the framework • IPR: • Goal is free and open source • Ensure it remains public domain • Monitor the IPR environment

  8. Acknowledgements • Tim Shepard • IETF TAPS WG • ICNRG • JérômeLacan (ISAE) • Emmanuel Lochin (ISAE)

  9. mariejo@mit.edu vincent.roca@inria.fr jonathan.detchart@isae.fr

More Related