{"id":841,"date":"2014-07-15T22:36:34","date_gmt":"2014-07-15T20:36:34","guid":{"rendered":"http:\/\/prophet.ssvl.kth.se\/?p=841"},"modified":"2025-04-28T15:45:20","modified_gmt":"2025-04-28T13:45:20","slug":"our-upcoming-hotsdn-14-paper-espres-transparent-sdn-update-scheduling","status":"publish","type":"post","link":"https:\/\/www.kth.se\/blogs\/prophet\/2014\/07\/our-upcoming-hotsdn-14-paper-espres-transparent-sdn-update-scheduling\/","title":{"rendered":"Our upcoming HotSDN \u201914 paper: \u201cESPRES: Transparent SDN Update Scheduling\u201d"},"content":{"rendered":"<div class=\"post-content-wrapper\"><p>Our paper titled \u201c<a href=\"http:\/\/web.ict.kth.se\/~dejanko\/documents\/publications\/espres-hotsdn14.pdf\">ESPRES: Transparent SDN Update Scheduling<\/a>\u201d will appear at HotSDN 2014 in Chicago. Peter Peresini will present the work. Here is the abstract: <\/p>\n<p>Network forwarding state undergoes frequent changes, in batches of forwarding<br \/>rule modifications at multiple switches.&nbsp; Installing or modifying a large number<br \/>of rules is time consuming given the performance limits of current programmable<br \/>switches, which are also due to economical factors in addition to technological<br \/>ones.<\/p>\n<p>In this paper, we observe that a large network-state update typically consists<br \/>of a set of sub-updates that are independent of one another w.r.t. the traffic<br \/>they affect, and hence sub-updates can be installed in parallel, in any order.<br \/>Leveraging this observation, we treat update installation as a scheduling<br \/>problem and design ESPRES, a runtime mechanism that rate-limits and reorders<br \/>updates to fully utilize processing capacities of switches without overloading<br \/>them. Our early results show that compared to using no scheduler, our schemes<br \/>yield 2.17-3.88 times quicker sub-update completion time for 20th percentile of<br \/>sub-updates and 1.27-1.57 times quicker for 50th percentile.<\/p>\n<\/div>","protected":false},"excerpt":{"rendered":"<p>Our paper titled \u201cESPRES: Transparent SDN Update Scheduling\u201d will appear at HotSDN 2014 in Chicago. Peter Peresini will present the work. Here is the abstract: Network forwarding state undergoes frequent changes, in batches of forwardingrule modifications at multiple switches.&nbsp; Installing or modifying a large numberof rules is time consuming given the performance limits of current [&hellip;]<\/p>\n","protected":false},"author":621,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"inline_featured_image":false,"footnotes":"","jetpack_post_was_ever_published":false},"categories":[2],"tags":[],"class_list":["post-841","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_shortlink":"https:\/\/wp.me\/p7bjNp-dz","_links":{"self":[{"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/posts\/841","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/users\/621"}],"replies":[{"embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/comments?post=841"}],"version-history":[{"count":0,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/posts\/841\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/media?parent=841"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/categories?post=841"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.kth.se\/blogs\/prophet\/wp-json\/wp\/v2\/tags?post=841"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}