Show simple item record

AuthorAyoubi, Sara
AuthorAssi, Chadi
AuthorNarayanan, Lata
AuthorShaban, Khaled
Available date2021-07-05T11:03:42Z
Publication Date2016
Publication NameIEEE Communications Letters
URIhttp://dx.doi.org/10.1109/LCOMM.2016.2571691
URIhttp://hdl.handle.net/10576/21188
AbstractThe failure-prone nature of data center networks has evoked countless contributions to develop proactive and reactive countermeasures. Yet, most of these techniques were developed with unicast services in mind. When in fact, multiple services hosted in data center networks today rely on multicast communication to disseminate traffic. Hence, the existing survivability schemes fail to cater to the distinctive properties and quality of service requirements that multicast services entail. This letter is devoted to understanding the ramifications of facility node or substrate link failure on multicast services residing in cloud networks. We formally define the multicast virtual network restoration problem and prove its NP-complete nature in arbitrary graphs. Furthermore, we prove that the problem can be solved in polynomial-time in multi-rooted treelike data center network topologies. 2016 IEEE.
Languageen
PublisherInstitute of Electrical and Electronics Engineers Inc.
Subjectalgorithms
SubjectCloud data centers
Subjectmulticast
Subjectservice restoration
TitleOptimal Polynomial Time Algorithm for Restoring Multicast Cloud Services
TypeArticle
Pagination1543-1546
Issue Number8
Volume Number20


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record