Show simple item record

dc.contributor.authorPerešíni, Peter
dc.contributor.authorKuźniar, Maciej
dc.contributor.authorCanini, Marco
dc.contributor.authorKostic, Dejan 
dc.date.accessioned2021-07-13T10:08:44Z
dc.date.available2021-07-13T10:08:44Z
dc.date.issued2014-03-03
dc.identifier.urihttp://hdl.handle.net/20.500.12761/1285
dc.description.abstractNetwork state is always in flux. Due to traffic engineering, topology changes, policy updates, VM migrations, etc., today’s networks undergo a variety of large updates that concurrently affect many switches. Transitioning between network states can be a source of instability, leading to outages, disruptions and security vulnerabilities. Consistent network updates [7] introduces a mechanism that guarantees to preserve well defined behaviors when transitioning between states. However, a major problem for this technique is the update performance, that is, the time it takes to install a network state update onto the data-plane—the current generation of OpenFlow switches can install flows with rate as low as 40 rules/second [2].1 Even moderate-sized updates can take several seconds, during which operators are in the dark about how badly links could be congested. [5] Therefore it is desirable to complete updates quickly. However, we note that the lowest bound of the total time to complete the update is determined by the switch that is last to complete.
dc.language.isoeng
dc.titleESPRES: Easy Scheduling and Prioritization for SDNen
dc.typeconference object
dc.conference.date3 - 5 March 2014
dc.conference.placeSanta Clara, CA, USA
dc.conference.titleOpen Networking Summit (ONS 2014) - Research Track 2014*
dc.event.typeconference
dc.pres.typepaper
dc.type.hasVersionVoR
dc.rights.accessRightsopen access
dc.page.final2
dc.page.initial1
dc.description.refereedTRUE
dc.description.statuspub
dc.eprint.idhttp://eprints.networks.imdea.org/id/eprint/720


Files in this item

This item appears in the following Collection(s)

Show simple item record