Scheduling Relaxed Loop-Free Updates Within Tight Lower Bounds in SDNs
Sign Up to like & getrecommendations! Published in 2020 at "IEEE/ACM Transactions on Networking"
DOI: 10.1109/tnet.2020.3017771
Abstract: We consider a fundamental update problem of avoiding forwarding loops based on the node-ordering protocol in Software Defined Networks (SDNs). Due to the distributed data plane, forwarding loops may occur during the updates and influence… read more here.
Keywords: tex math; inline formula; relaxed loop; loop free ... See more keywords