Brief announcement: On regenerator placement problems in optical networks

DMCA

Brief announcement: On regenerator placement problems in optical networks

Cached

Download Links

[www.cse.buffalo.edu]

by Arunabha Sen , Sujogya Banerjee , Pavel Ghosh , Sudheendra Murthy , Hung Ngo

Venue:	in Proc. 22nd Annu. ACM SPAA, 2010
Citations:	1 - 0 self

Citations

33	K.-I.: A greedy approximation for minimum connected dominating sets. - Ruan, Du, et al. - 2004 (Show Context) Citation Context ...both lemma 1 and 2 holds except the trivial case when reachability graph G′ is clique. If G′ is a clique then solution of RPP will return 0 node while MCDS of G′ will give exactly 1 node. From recent =-=[3]-=-, we know that minimum connected dominating set (MCDS) can be approximated to within about lnn + O(1). We also know that MCDS cannot be approximated (unless P = NP ) to within lnn−Θ(ln lnn) [1]. Corol...
30	Sparse Regeneration in Translucent WavelengthRouted Optical Networks: Architecture, Network Design and Wavelength Routing,” Photonic Network Communications, - Yang - 2005 (Show Context) Citation Context ...hreat Reduction Agency. Copyright is held by the author/owner(s). SPAA’10, June 13–15, 2010, Thira, Santorini, Greece. ACM 978-1-4503-0079-7/10/06. The RPP has been studied by a number of researchers =-=[4, 5, 2]-=-. However most of the published methods of locating regenerators operate by iteratively improving previously computed routes until they become feasible. These methods usually generate a path between e...
14	Approximation hardness of dominating set problems in bounded degree graphs. - Chlebık, Chlebıkova - 2008 (Show Context) Citation Context ...recent [3], we know that minimum connected dominating set (MCDS) can be approximated to within about lnn + O(1). We also know that MCDS cannot be approximated (unless P = NP ) to within lnn−Θ(ln lnn) =-=[1]-=-. Corollary 3: There’s a O(ln n)-approximation algorithm for the RPP. Comment 4: In [2] the authors present an algorithm for the RPP/∞/req with approximation ratio of 3 2 log m+ 1, where the demand ma...
14	On the complexity of the regenerator placement problem in optical networks. - Flammini, Marchetti-Spaccamela, et al. - 2009 (Show Context) Citation Context ...hreat Reduction Agency. Copyright is held by the author/owner(s). SPAA’10, June 13–15, 2010, Thira, Santorini, Greece. ACM 978-1-4503-0079-7/10/06. The RPP has been studied by a number of researchers =-=[4, 5, 2]-=-. However most of the published methods of locating regenerators operate by iteratively improving previously computed routes until they become feasible. These methods usually generate a path between e...
8	Network Design in Realistic “All-Optical” Backbone Networks”, - Simmons - 2006 (Show Context) Citation Context ...y the signal over long distances. Optical reach (the distance an optical signal can travel before its quality degrades to a level that necessitates regeneration) usually ranges from 500 to 2000 miles =-=[4]-=-. To transmit an optical signal beyond this distance, it is essential to re-amplify, reshape and re-time (a process often called 3R regeneration) it. The Regenerator Placement Problem (RPP) problem is...