168 Hits in 5.3 sec

Scalable and Adaptive Software Defined Network Management for Cloud-hosted Group Communication Applications

Prithviraj Patil, Akram Hakiri, Shashank Shekhar, Aniruddha Gokhale
2017 Proceedings of the10th International Conference on Utility and Cloud Computing - UCC '17  
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of NSF, DGA, CNES or the Fulbright program.  ...  As shown in line 8 in Algorithm 2, SDMC allows multicast tree packing based on the least cost tree (Steiner tree) to perform adaptive resource management.  ...  In random graphs, such as distributed routers in the Internet, the Steiner tree is known to be NP-Complete.  ... 
doi:10.1145/3147213.3147220 dblp:conf/ucc/PatilHSG17 fatcat:ay6ihy7f2je5jarh7vsuelz2pa

Service Overlay Forest Embedding for Software-Defined Cloud Networks [article]

Jian-Jhih Kuo, Shan-Hsiang Shen, Ming-Hong Yang, De-Nian Yang, Ming-Jer Tsai, Wen-Tsuen Chen
2017 arXiv   pre-print
We design a new 3ρ_ST-approximation algorithm to solve the problem, where ρ_ST denotes the best approximation ratio of the Steiner Tree problem, and the distributed implementation of the algorithm is also  ...  On the other hand, the allocation of VNFs has not been supported in the current SDN multicast routing algorithms.  ...  Afterward, a distributed Steiner tree algorithm [34] can be employed by multiple controllers to find the Steiner tree, where the computation load originally assigned to each switch in the distributed  ... 
arXiv:1703.09025v1 fatcat:p6oludpj7nfaxpl4tmgzzoxbjy

Distributed delay constrained multicast routing algorithm with efficient fault recovery

Hasan Ural, Keqin Zhu
2005 Networks  
Existing distributed delay constrained multicast routing algorithms construct a multicast tree in a sequential fashion and need to be restarted when failures occur during the multicast tree construction  ...  This article proposes an efficient distributed delay constrained multicast routing algorithm that constructs a multicast tree in a concurrent fashion by taking advantage of the concurrency in the underlying  ...  routing problem [10, 27, 36] which finds the multicast trees satisfying multiple QoS constraints and load balancing in various networks for load distribution [12, 30] .  ... 
doi:10.1002/net.20090 fatcat:ckqenkmppjfrrkbmza6qybncnq

1-to-N and N-to-1 Communication for Optical Networks

Tuan Le, Mario Gerla
2014 Proceedings of the Latin America Networking Conference on LANC 2014 - LANC '14  
Through extensive analytical simulations, we show that the proposed algorithms are effective in minimizing the number of optical links used for 1-to-N traffic, while eliminating link bottlenecks for N-to  ...  In this paper, we propose a set of algorithms to support 1-to-N and N-to-1 traffic flows in optical networks. We base our work on top of the Optical Switching Architecture (OSA).  ...  In our design, we choose to implement Kou, Markowsky, and Berman (KMB) algorithm [20] , which is known to be a fast approximate algorithm for Steiner trees.  ... 
doi:10.1145/2684083.2684093 dblp:conf/lanc/LeG14 fatcat:tysgheogwnbmzlk4gn4ajr7cjy

Kaleidoscope: Real-time content delivery in software defined infrastructures

Qi Zhang, Sai Qian Zhang, Jieyu Lin, Hadi Bannazadeh, Alberto Leon-Garcia
2015 2015 IFIP/IEEE International Symposium on Integrated Network Management (IM)  
In this paper, we present Kaleidoscope, an architecture for real-time content delivery in Software Defined Infrastructures.  ...  Recently, the concept of Software Defined Infrastructure aims at combining Cloud computing and SDN to provide an unified framework for application deployment and management.  ...  As this algorithm is reconfiguration-aware, it can be used for both scheduling a new content request or adapting existing multicast trees to new demand patterns.  ... 
doi:10.1109/inm.2015.7140356 dblp:conf/im/ZhangZLBL15 fatcat:4ww3i6n5encjba7cmbw772oyie

DCCast: Efficient Point to Multipoint Transfers Across Datacenters [article]

Mohammad Noormohammadpour, Cauligi S. Raghavendra, Sriram Rao, Srikanth Kandula
2017 arXiv   pre-print
Using multiple datacenters allows for higher availability, load balancing and reduced latency to customers of cloud services.  ...  With low computational overhead, DCCast selects forwarding trees that minimize bandwidth usage and balance load across all links.  ...  R for t > t now 1 To every edge e ∈ E G E G E G , assign weight W e = (L e + V R ); 2 Find the Minimum Weight Steiner Tree T that connects S R ∪D R D R D R .  ... 
arXiv:1707.02096v1 fatcat:lbdpj3zsdbfbdk2l27zbciksl4

A distributed routing and wavelength assignment algorithm for real-time multicast in WDM networks

Chuanhe Huang, Xiaohua Jia, Yongbing Zhang
2002 Computer Communications  
This paper presents a distributed routing and wavelength assignment scheme for the setup of real-time multicast connections.  ...  Routing and wavelength assignment for online real-time multicast connection setup is a difficult task due to the dynamic change of availabilities of wavelengths and the consideration of wavelength conversion  ...  This work is supported in partial by CityU SRG grant 7001121, JSPS, and Cheung Kong Scholars scheme at WuHan University, China.  ... 
doi:10.1016/s0140-3664(02)00087-7 fatcat:xbchtdoqrrbkpavoxktyndftdi

Demand-scalable geographic multicasting in wireless sensor networks

Shibo Wu, K. Selçuk Candan
2007 Computer Communications  
Thus, in this paper, we first introduce a Geographic Multicast routing Protocol (GMP) for wireless sensor networks. 1 The protocol is fully distributed and stateless.  ...  The simulation results on NS2 show that GMP requires 25% less hops and energy than the existing Position Based Multicasting, PBM, Location-Guided Steiner trees, LGS, approaches.  ...  Although Steiner trees are commonly referred as multicast distributions tree for efficient delivery of packets in a fixed network, the Steiner tree problem in a graph is NP-hard, even if the global topology  ... 
doi:10.1016/j.comcom.2007.05.029 fatcat:vo4tby4p6bactmkedikqg6ga5u

A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees

S. Raghavan, G. Manimaran, C. Siva Ram Murthy
1999 IEEE/ACM Transactions on Networking  
In this paper, we propose and evaluate an algorithm called CRCDM Controlled Rearrangement for Constrained Dynamic Multicasting for on-line update of multicast trees to adjust to changes in group membership  ...  the algorithm proposed in 10 for on-line update of delay-constrained trees.  ...  Designing such a distributed version of our algorithm is an area for future investigation.  ... 
doi:10.1109/90.793020 fatcat:chefi233mzcxvao6g2wcbftk7m

Multicasting in cognitive radio networks: Algorithms, techniques and protocols

Junaid Qadir, Adeel Baig, Asad Ali, Quratulain Shafi
2014 Journal of Network and Computer Applications  
Various approaches, including those based in optimization theory, network coding, algorithms, have been proposed for performing efficient multicast in CRNs.  ...  In this paper, we provide a self-contained tutorial on algorithms and techniques useful for solving the multicast problem, and then provide a comprehensive survey of protocols that have been proposed for  ...  Tree-based multicasting protocols work by constructing a tree on the overall connectivity graph which connects together the multicast group in an acyclic subgraph.  ... 
doi:10.1016/j.jnca.2014.07.024 fatcat:xkjekyopd5fg5am3dhop36nadi

A flexible multicast routing protocol for group communication

Sudhir Aggarwal, Sanjoy Paul, Daniel Massey, Daniela Caldararu
2000 Computer Networks  
CSM is based on the use of a shared, heuristic Steiner minimal tree for interconnecting group members.  ...  This paper proposes another multicast routing protocol, Conference Steiner Multicast (CSM), that is suited for domains that implement OSPF as the unicast routing protocol.  ...  Acknowledgements The authors are grateful to Amritansh Raghav for several early discussions on multicasting. Appendix A. List of abbreviations used in the paper  ... 
doi:10.1016/s1389-1286(99)00123-1 fatcat:5kdc2i6qine4hh3w2q4vvgzmse

Applicability of group communication for increased scalability in MMOGs

Knut-Helge Vik, Carsten Griwodz, Pål Halvorsen
2006 Proceedings of 5th ACM SIGCOMM workshop on Network and system support for games - NetGames '06  
We use overlay multicast as the means of providing group communication, and research algorithms for creating shortest path trees, spanning trees, delay-bounded spanning trees and, more specific, applying  ...  Steiner tree heuristics.  ...  One way of doing this is for the provider to establish strategically placed nodes that are well connected and offer only these as potential steiner points in SMT algorithms.  ... 
doi:10.1145/1230040.1230065 dblp:conf/netgames/VikGH06 fatcat:j2plcdmgljeqhhotfqkvytz7py

Connectivity Restoration in Wireless Sensor Networks via Space Network Coding

Alfred Uwitonze, Jiaqing Huang, Yuanqing Ye, Wenqing Cheng
2017 Sensors  
The Euclidean Steiner Minimal Tree (ESMT) [5] based approach for deploying relay nodes is one of the most efficient approaches [6] for restoring the connectivity in such a case.  ...  RPSNC can adapt to any density distribution of relay nodes and terminals, as well as any density distribution of terminals.  ...  The authors thank anonymous reviewers for their insightful comments that helped to improve the clarity of this paper.  ... 
doi:10.3390/s17040902 pmid:28425923 pmcid:PMC5426826 fatcat:utrfn44iyzhvninrdbfpnthzzi

On Efficient Data Transfers Across Geographically Dispersed Datacenters [article]

Mohammad Noormohammadpour
2019 arXiv   pre-print
Next, in the several chapters that follow, we study, in detail, the problems of admission control for transfers with deadlines and inter-datacenter multicast transfers.  ...  In this dissertation, we study techniques and algorithms for fast and efficient data transfers across geographically dispersed datacenters over the inter-datacenter networks.  ...  Steiner tree as shown in Algorithm 7.  ... 
arXiv:1908.11131v1 fatcat:ofzxh5shfnbcdni2jg3vj4te5u

Prioritized overlay multicast in mobile ad hoc environments

L. Xiao, Abhishek Patil, Y. Liu, L.M. Ni, A.-H. Esfahanian
2004 Computer  
These include the ad hoc multicast routing protocol, progressively adaptive subtree in dynamic mesh, and the locationguided tree construction scheme.  ...  From this mesh, the protocol uses a subset of links to generate a shared multicast distribution tree.  ...  The authors propose a model to improve the efficiency and robustness of overlay multicast in manets by building multiple role-based prioritized trees, possibly with the help of location information about  ... 
doi:10.1109/mc.2004.1266298 fatcat:bj4ppr22orhcpd3c5mgccgyh5q
« Previous Showing results 1 — 15 out of 168 results