The Experts below are selected from a list of 33696 Experts worldwide ranked by ideXlab platform
Yu Zhou - One of the best experts on this subject based on the ideXlab platform.
-
Deployment of a Connected Reinforced Backbone Network with a Limited Number of Backbone Nodes
IEEE Transactions on Mobile Computing, 2013Co-Authors: Shan Chu, Peng Wei, Xu Zhong, Xin Wang, Yu ZhouAbstract:In recent years, we have witnessed a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multihop wireless Network has great potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel reinforced Backbone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the genetic algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the genetic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
-
deployment of a reinforcement Backbone Network with constraints of connection and resources
International Conference on Distributed Computing Systems, 2010Co-Authors: Peng Wei, Shan Chu, Xin Wang, Yu ZhouAbstract:In recent years, we have seen a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless Network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
-
ICDCS - Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources
2010 IEEE 30th International Conference on Distributed Computing Systems, 2010Co-Authors: Peng Wei, Shan Chu, Xin Wang, Yu ZhouAbstract:In recent years, we have seen a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless Network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
Xin Wang - One of the best experts on this subject based on the ideXlab platform.
-
Deployment of a Connected Reinforced Backbone Network with a Limited Number of Backbone Nodes
IEEE Transactions on Mobile Computing, 2013Co-Authors: Shan Chu, Peng Wei, Xu Zhong, Xin Wang, Yu ZhouAbstract:In recent years, we have witnessed a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multihop wireless Network has great potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel reinforced Backbone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the genetic algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the genetic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
-
A New Performance Metric for Construction of Robust and Efficient Wireless Backbone Network
IEEE Transactions on Computers, 2012Co-Authors: Ziyi Zhang, Xin Wang, Qin XinAbstract:With the popularity of wireless devices and the increasing demand of Network applications, it is emergent to develop more effective communications paradigm to enable new and powerful pervasive applications, and to allow services to be accessed anywhere, at anytime. However, it is extremely challenging to construct efficient and reliable Networks to connect wireless devices due to the increasing communications need and the dynamic nature of wireless communications. In order to improve transmission throughput, many efforts have been made in recent years to reduce traffic and hence transmission collisions by constructing Backbone Networks with the minimum size. However, many other important issues need to be considered. Instead of simply minimizing the number of Backbone nodes or supporting some isolated Network features, in this work, we exploit the use of algebraic connectivity to control Backbone Network topology design for concurrent improvement of Backbone Network robustness, capacity, stability and routing efficiency. In order to capture other Network features, we provide a general cost function and introduce a new metric, connectivity efficiency, to trade off algebraic connectivity and cost for Backbone construction. We formally prove the problem of formulating a Backbone Network with the maximum connectivity efficiency that is NP-hard, and design both centralized and distributed algorithms to build more robust and efficient Backbone infrastructure to better support the application needs. We have made extensive simulations to evaluate the performance of our work. Compared to literature studies on constructing wireless Backbone Networks, the incorporation of algebraic connectivity into the Network performance metric could achieve much higher throughput and delivery ratio, and much lower end-to-end delay and routing distances under all test scenarios. We hope our work could stimulate more future research in designing more reliable and efficient Networks. Our performance studies demonstrate that, compared to peer work, the incorporation of algebraic connectivity into Network performance metric could achieve much higher throughput and delivery ratio, and much lower end-to-end delay and routing distances under all test scenarios. We hope our work could stimulate more future research in designing more reliable and efficient Networks.
-
deployment of a reinforcement Backbone Network with constraints of connection and resources
International Conference on Distributed Computing Systems, 2010Co-Authors: Peng Wei, Shan Chu, Xin Wang, Yu ZhouAbstract:In recent years, we have seen a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless Network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
-
ICDCS - Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources
2010 IEEE 30th International Conference on Distributed Computing Systems, 2010Co-Authors: Peng Wei, Shan Chu, Xin Wang, Yu ZhouAbstract:In recent years, we have seen a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless Network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
Biswanath Mukherjee - One of the best experts on this subject based on the ideXlab platform.
-
Dynamic Workload Migration Over Backbone Network to Minimize Data Center Electricity Cost
IEEE Transactions on Green Communications and Networking, 2018Co-Authors: Sabidur Rahman, Massimo Tornatore, Abhishek Gupta, Biswanath MukherjeeAbstract:As more organizations adopt cloud services, energy consumption in data centers (DCs) keeps increasing. Today, information and communication technology (ICT) has become a major consumer of energy worldwide. A large portion of ICT energy consumption is used to power servers running in DCs and the Network they use to communicate. In this paper, we consider that energy cost at a particular DC is often related to the electricity price regulated by independent system operators/regional transmission organizations. As these prices vary in time and depend on the geographical locations of the DCs, recent studies have shown that the spatio-temporal variations of electricity price can be exploited to reduce electricity cost. In particular, as workloads tend to change, often unpredictably, adaptive workload placement and migration can help to serve the workloads in regions with lower electricity costs. While most prior works consider a quasi-static scenario with known workload patterns, this paper proposes dynamic workload-aware algorithms which exploit the spatio-temporal variations of electricity costs to minimize the energy cost in ICT. Although prior studies focused on power consumption from power consumers such as servers, cooling systems, etc., recent studies have shown that the Network elements consume a significant portion of the energy. Hence, while reducing DC energy cost, this paper also considers electricity cost of the Backbone Network. Algorithms introduced in this paper use dynamic request re-routing and live virtual machine (VM) migration to move workloads to DCs with lower electricity cost. We consider VM migration cost (including electricity cost at Backbone Network nodes), bandwidth constraints for migration, VM consolidation, constraints from service level agreement, and administrative overhead of VM migration. Our simulation studies show that the proposed algorithms reduce operational cost of DCs significantly.
-
dynamic workload migration over optical Backbone Network to minimize data center electricity cost
International Conference on Communications, 2017Co-Authors: Sabidur Rahman, Abhishek Gupta, Massimo Tomatore, Biswanath MukherjeeAbstract:As more organizations rapidly adopt cloud services, energy consumption in data centers (DCs) is increasing such that today Information and Communication Technology (ICT) has become a major consumer of energy. A large portion of ICT energy consumption is used to power servers running in DCs and the Network they use to communicate. In this study, we consider that, often, energy cost at a particular DC is related to the electricity price regulated by Independent System Operators / Regional Transmission Organizations (ISOs/RTOs). As these prices vary in time and depend on the geographical locations of the DCs, recent studies have shown that the spatio-temporal variations of electricity price can be exploited to reduce electricity cost. While most prior works consider a quasi-static scenario with known workload patterns, our study proposes a dynamic workload-aware algorithm that exploits the spatio-temporal variations of electricity costs with the goal to minimize the energy cost in ICT. Our algorithm uses dynamic request rerouting and live virtual machine (VM) migration to move workloads to DCs with lower electricity cost. We consider VM migration cost (including electricity cost at optical Backbone Network nodes), bandwidth constraints for migration, VM consolidation, constraints from Service Level Agreement (SLA), and administrative overhead of VM migration. Our simulation studies show that the proposed algorithm reduces operational cost and improves energy efficiency of data centers significantly.
-
Greening the optical Backbone Network: a traffic engineering approach
IEEE International Conference on Communications, 2010Co-Authors: Ming Xia, Charles Martel, Pulak Chowdhury, Massimo Tornatore, Ying Zhang, Biswanath MukherjeeAbstract:Since telecom Networks consume a large (and increasing) amount of energy, "green" strategies are desirable to help Service Providers (SP) operate their Networks and provision services more energy-efficiently. In this study, we focus on operating optical Backbone Networks with green strategies. We consider a typical optical Backbone Network architecture, and minimize the Operational Power for service provisioning following a Traffic Engineering (TE) approach. Service provisioning is schematically decomposed as multiple serial operations, and power efficiency is analyzed for both optical bypass and traffic grooming. We propose a novel auxiliary graph, which can capture the flow of operations and their associated power. Based on the auxiliary graph, we present a Power-Aware scheme that minimizes the Operational Power. Simulation results show reduced power consumption by our scheme, in comparison to a generic traffic grooming approach.
-
cost effective wdm Backbone Network design with oxcs of different bandwidth granularities
IEEE Journal on Selected Areas in Communications, 2003Co-Authors: Hongyue Zhu, Keyao Zhu, Hui Zang, Biswanath MukherjeeAbstract:We investigate the design of a WDM Backbone Network with optical cross-connects (OXCs) of different switching granularities to reduce the Network-wide OXC port cost. We enhance our proposed graph model (Zhu, H. et al., IEEE/ACM Trans. Networking, vol.11, p.285-99, 2003), and the extended graph model can represent different node architectures in which a node may have multiple OXCs with different switching granularities simultaneously. Based on this model, we propose a provisioning algorithm for a single connection and a framework for Network design, which can intelligently determine the type of OXCs at each node according to the traffic so that the benefit of different types of OXCs can be utilized. Numerical examples are presented showing that granularity-heterogeneous Networks are more cost-effective than granularity-homogeneous Networks.
Peng Wei - One of the best experts on this subject based on the ideXlab platform.
-
Deployment of a Connected Reinforced Backbone Network with a Limited Number of Backbone Nodes
IEEE Transactions on Mobile Computing, 2013Co-Authors: Shan Chu, Peng Wei, Xu Zhong, Xin Wang, Yu ZhouAbstract:In recent years, we have witnessed a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multihop wireless Network has great potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel reinforced Backbone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the genetic algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the genetic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
-
deployment of a reinforcement Backbone Network with constraints of connection and resources
International Conference on Distributed Computing Systems, 2010Co-Authors: Peng Wei, Shan Chu, Xin Wang, Yu ZhouAbstract:In recent years, we have seen a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless Network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
-
ICDCS - Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources
2010 IEEE 30th International Conference on Distributed Computing Systems, 2010Co-Authors: Peng Wei, Shan Chu, Xin Wang, Yu ZhouAbstract:In recent years, we have seen a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless Network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
Shan Chu - One of the best experts on this subject based on the ideXlab platform.
-
Deployment of a Connected Reinforced Backbone Network with a Limited Number of Backbone Nodes
IEEE Transactions on Mobile Computing, 2013Co-Authors: Shan Chu, Peng Wei, Xu Zhong, Xin Wang, Yu ZhouAbstract:In recent years, we have witnessed a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multihop wireless Network has great potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel reinforced Backbone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the genetic algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the genetic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
-
deployment of a reinforcement Backbone Network with constraints of connection and resources
International Conference on Distributed Computing Systems, 2010Co-Authors: Peng Wei, Shan Chu, Xin Wang, Yu ZhouAbstract:In recent years, we have seen a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless Network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
-
ICDCS - Deployment of a Reinforcement Backbone Network with Constraints of Connection and Resources
2010 IEEE 30th International Conference on Distributed Computing Systems, 2010Co-Authors: Peng Wei, Shan Chu, Xin Wang, Yu ZhouAbstract:In recent years, we have seen a surge of interest in enabling communications over meshed wireless Networks. Particularly, supporting peer-to-peer communications over a multi-hop wireless Network has a big potential in enabling ubiquitous computing. However, many wireless nodes have limited capabilities, for example, sensor nodes or small handheld devices. Also, the end-to-end capacity and delay degrade significantly as the path length increases with the number of Network nodes. In these scenarios, the deployment of a Backbone Network could potentially facilitate higher performance Network communications. In this paper, we study the novel Reinforcement Back-bone Network (RBN) deployment problem considering the practical limitation in the number of available Backbone nodes and enforcing Backbone Network connectivity. We propose an iterative and adaptive (ITA) algorithm for efficient Backbone Network deployment. In addition, in order to provide the performance bound, we redefine and solve the problem by implementing the Generic Algorithm. Finally, we present our simulation results under various settings and compare the performance of the proposed ITA algorithm and the generic algorithm. Our study indicates that the proposed ITA algorithm is promising for deploying a connected RBN with a limited number of available Backbone nodes.
