Abstract
Arrival and service curves are core functions in the Network Calculus framework [2], [3]. Based on those curves, we present in this talk a new formalism for data packetization in Network Calculus, the packet curves. Indeed, a more precise knowledge of the packet characteristics can be efficiently exploited to get tighter performance bounds, for example for aggregation of flows, packet-based service policies and shared buffers. Finally, we will give a model for a wormhole switch and show how our results can be used to get efficient delay bounds. Details and proofs can be found in [1].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
