Online unicasting and multicasting in software-defined networks
点击次数：
论文类型：期刊论文
第一作者：Huang, Meitian
通讯作者：Huang, MT (reprint author), Australian Natl Univ, Res Sch Comp Sci, Canberra, ACT 0200, Australia.
合写作者：Liang, Weifa,Xu, Zichuan,Xu, Wenzheng,Guo, Song,Xu, Yinlong
发表时间：2018-02-26
发表刊物：COMPUTER NETWORKS
收录刊物：SCIE、EI
卷号：132
页面范围：26-39
ISSN号：1389-1286
关键字：Dynamic unicast and multicast request admissions; Network resource allocation; Online algorithms; Competitive ratio analysis; Ternary content addressable memory (TCAM); Software-defined networks; Combinatorial optimization
摘要：Software-Defined Networking (SDN) has emerged as the paradigm of the next-generation networking through separating the control plane from the data plane. In a software-defined network, the forwarding table at each switch node usually is implemented by expensive and power-hungry Ternary Content Addressable Memory (TCAM) that only has limited numbers of entries. In addition, the bandwidth capacity at each link is limited as well. Provisioning quality services to users by admitting their requests subject to such critical network resource constraints is a fundamental problem, and very little attention has been paid. In this paper, we study online unicasting and multicasting in SDNs with an objective of maximizing the network throughput under network resource constraints, for which we first propose a novel cost model to accurately capture the usages of network resources at switch nodes and links. We then devise two online algorithms with competitive ratios 0(logn) and 0(K-is an element of log n) for online unicasting and multicasting, respectively, where n is the network size, K is the maximum number of destinations in any multicast request, and is an element of is a constant with 0 < is an element of <= 1. We finally evaluate the proposed algorithms empirically through simulations. The simulation results demonstrate that the proposed algorithms are very promising. (C) 2017 Elsevier B.V. All rights reserved.
发表时间：2018-02-26