Packetization and packet curves in network calculus

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 ex...

Full description

Saved in:
Bibliographic Details
Main Authors: Bouillard, A., Farhi, N., Gaujal, B.
Format: Conference Proceeding
Language:eng ; jpn
Subjects:
Calculus
Tin
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 137
container_issue
container_start_page 136
container_title
container_volume
creator Bouillard, A.
Farhi, N.
Gaujal, B.
description 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].
doi_str_mv 10.4108/valuetools.2012.250208
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6376314</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6376314</ieee_id><sourcerecordid>6376314</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1348-6b29d34ca4483a17af4d59c69afbccb49ddd7b4262e527626063d83df9ec3cf43</originalsourceid><addsrcrecordid>eNotjcFKxDAURSMiqON8gSD5gdYkL31JljKoIwzoQtfDa5JCnNgOTTuiX--gri7nLM5l7EaKWkthbw-U5zgNQy61ElLVqhFK2BN2KR2gQ4sgTo-g0YC21qhztizlXQghpUDbuAsGL-R3cUrfNKWh59QHvv813M_jIRaeet7H6XMYd9xT9nOeyxU76yiXuPzfBXt7uH9dravN8-PT6m5TJXm8q7BVLoD2pLUFkoY6HRrn0VHXet9qF0IwrVaoYqMMKhQIwULoXPTgOw0Ldv3XTTHG7X5MHzR-bREMgtTwA_FrSIc</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Packetization and packet curves in network calculus</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bouillard, A. ; Farhi, N. ; Gaujal, B.</creator><creatorcontrib>Bouillard, A. ; Farhi, N. ; Gaujal, B.</creatorcontrib><description>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].</description><identifier>ISBN: 1467348872</identifier><identifier>ISBN: 9781467348874</identifier><identifier>EISBN: 1936968630</identifier><identifier>EISBN: 9781936968633</identifier><identifier>DOI: 10.4108/valuetools.2012.250208</identifier><language>eng ; jpn</language><publisher>IEEE</publisher><subject>Calculus ; Tin</subject><ispartof>6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012, p.136-137</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6376314$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6376314$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bouillard, A.</creatorcontrib><creatorcontrib>Farhi, N.</creatorcontrib><creatorcontrib>Gaujal, B.</creatorcontrib><title>Packetization and packet curves in network calculus</title><title>6th International ICST Conference on Performance Evaluation Methodologies and Tools</title><addtitle>ValueTools</addtitle><description>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].</description><subject>Calculus</subject><subject>Tin</subject><isbn>1467348872</isbn><isbn>9781467348874</isbn><isbn>1936968630</isbn><isbn>9781936968633</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjcFKxDAURSMiqON8gSD5gdYkL31JljKoIwzoQtfDa5JCnNgOTTuiX--gri7nLM5l7EaKWkthbw-U5zgNQy61ElLVqhFK2BN2KR2gQ4sgTo-g0YC21qhztizlXQghpUDbuAsGL-R3cUrfNKWh59QHvv813M_jIRaeet7H6XMYd9xT9nOeyxU76yiXuPzfBXt7uH9dravN8-PT6m5TJXm8q7BVLoD2pLUFkoY6HRrn0VHXet9qF0IwrVaoYqMMKhQIwULoXPTgOw0Ldv3XTTHG7X5MHzR-bREMgtTwA_FrSIc</recordid><startdate>201210</startdate><enddate>201210</enddate><creator>Bouillard, A.</creator><creator>Farhi, N.</creator><creator>Gaujal, B.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201210</creationdate><title>Packetization and packet curves in network calculus</title><author>Bouillard, A. ; Farhi, N. ; Gaujal, B.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1348-6b29d34ca4483a17af4d59c69afbccb49ddd7b4262e527626063d83df9ec3cf43</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng ; jpn</language><creationdate>2012</creationdate><topic>Calculus</topic><topic>Tin</topic><toplevel>online_resources</toplevel><creatorcontrib>Bouillard, A.</creatorcontrib><creatorcontrib>Farhi, N.</creatorcontrib><creatorcontrib>Gaujal, B.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEL</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bouillard, A.</au><au>Farhi, N.</au><au>Gaujal, B.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Packetization and packet curves in network calculus</atitle><btitle>6th International ICST Conference on Performance Evaluation Methodologies and Tools</btitle><stitle>ValueTools</stitle><date>2012-10</date><risdate>2012</risdate><spage>136</spage><epage>137</epage><pages>136-137</pages><isbn>1467348872</isbn><isbn>9781467348874</isbn><eisbn>1936968630</eisbn><eisbn>9781936968633</eisbn><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].</abstract><pub>IEEE</pub><doi>10.4108/valuetools.2012.250208</doi><tpages>2</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 1467348872
ispartof 6th International ICST Conference on Performance Evaluation Methodologies and Tools, 2012, p.136-137
issn
language eng ; jpn
recordid cdi_ieee_primary_6376314
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Calculus
Tin
title Packetization and packet curves in network calculus
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T15%3A42%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Packetization%20and%20packet%20curves%20in%20network%20calculus&rft.btitle=6th%20International%20ICST%20Conference%20on%20Performance%20Evaluation%20Methodologies%20and%20Tools&rft.au=Bouillard,%20A.&rft.date=2012-10&rft.spage=136&rft.epage=137&rft.pages=136-137&rft.isbn=1467348872&rft.isbn_list=9781467348874&rft_id=info:doi/10.4108/valuetools.2012.250208&rft.eisbn=1936968630&rft.eisbn_list=9781936968633&rft_dat=%3Cieee_6IE%3E6376314%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i1348-6b29d34ca4483a17af4d59c69afbccb49ddd7b4262e527626063d83df9ec3cf43%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6376314&rfr_iscdi=true