Conference Paper

Multicast routing and wavelength assignment in WDM networks with limited drop-offs

Inst. of Appl. Math., Chinese Acad. of Sci., Beijing, China
DOI: 10.1109/INFCOM.2004.1354520 Conference: INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, Volume: 1
Source: DBLP

ABSTRACT In WDM networks with limited drop-offs, the route of a multicast connection consists of a set of light-trees. Each of the light-tree is rooted at the source node and contains no more than a limited number, say k, destination nodes due to the power loss of dropping optical signals off at destination nodes. We call such a light-tree k-drop light-tree. In this paper we study the multicast routing problem of constructing a set of k-drop light-trees that have the minimal network cost. The network cost of a set of light-trees is defined as the summation of the link cost of all the light-trees. We first prove that this problem is polynomial-time solvable for k=2 and NP-hard for k≥3. We then propose a 4-approximation algorithm for the problem for k ≥3. A wavelength assignment algorithm is also proposed to assign wavelengths to the light-trees of a multicast connection. In the end we give simulation results showing that k-drop multitree muting can significantly save not only the network cost but also wavelengths used. Moreover, when k≥5 its performance is very close to the case where k is infinite (i.e., the case of using a single tree for a multicast connection).


Available from: Tianping Shuai, Aug 15, 2014
  • [Show abstract] [Hide abstract]
    ABSTRACT: The year-by-year increase in electricity consumption significantly �affects all nations today from environmental, social, and economic perspectives. Various studies show that, among the contributors of this increase, power consumption of the equipment forming the Internet infrastructure is significant�. Consequently, considerable attention is given to �nding solutions to reduce power consumption of the systems that run the Internet. Current literature suggests that the optical backbone network is responsible for the majority of the consumed power, especially at high traffic loads. This highlights the importance of formulating solutions to reduce power consumption in backbone networks. In this paper, we provide a comprehensive survey of the most relevant research efforts on minimizing power consumption of backbone networks. We categorize our review into four broad approaches: network redesign, traffic engineering, power-aware networking, and load-adaptive operation. We highlight the �findings of relevant studies and provide an analysis of their limitations. We also evaluate the technological differences of similar work and identify a number of future directions. Finally, we demonstrate that the adoption of these technologies is gathering pace among prominent research bodies, device manufacturers, and network operators.
    IEEE Communications Surveys &amp Tutorials 11/2014; 17(1). DOI:10.1109/COMST.2014.2344734 · 6.49 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Connected-dominating-set (CDS) is a representative technique for constructing a virtual backbone of wireless networks. Most of existing works on CDS aim at minimizing the size of the CDS, i.e., constructing the minimum CDS (MCDS), so as to reduce the communication overhead over the CDS. However, MCDS may not work well in cognitive radio networks (CRNs) where communication links are prone to failure due to the unpredictable activities of primary users. A MCDS without consideration of stochastic activities of primary users easily becomes invalid when the primary users reclaim the licensed spectrum. In this work, we assume that the activities of primary users follow the exponential distribution. Our problem is to maximize the lifetime of the CDS while minimizing the size of the CDS, where the lifetime of a CDS is defined as the expected duration that the CDS is maintained valid. We show that the problem is NP-hard and propose a three-phase algorithm. Our basic idea is to apply a pruning-based approach to maximize the lifetime of the CDS. Given a CRN, we prove that our algorithm can compute a CDS such that i) the lifetime of the CDS is maximized (optimal); and ii) the size of the CDS is upper-bounded. To the best of our knowledge, it is the first time in the literature that CDS in CRNs is studied and an effective algorithm is proposed.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Cloud storage enables users to remotely store their data. However, this new paradigm of storage service also makes the integrity protection of outsourced data a very challenging issue. Recently many integrity auditing protocols have been proposed, but most of them focus on the single cloud environment or don't support batch auditing. In this paper, we propose a public batch data integrity auditing protocol for multi-cloud storage. In the protocol a third party auditor can simultaneously verify the multiple auditing requests from different users on distinct data files stored on different cloud storage servers. By utilizing homomorphic cipher text verification and recoverable coding approach, the proposed protocol not only provides privacy preserving public auditing for data integrity, but also achieves quick identification of corrupted data. With the batch auditing, the total auditing time can be reduced and the communication cost is also low. Extensive security and performance analysis show the proposed protocol is secure and efficient.
    ChinaGrid Annual Conference (ChinaGrid), 2013 8th; 01/2013