Clustering-based energy-aware virtual network embedding
|
|
- Sheena Townsend
- 5 years ago
- Views:
Transcription
1 Research Article Clustering-based energy-aware virtual network embedding International Journal of Distributed Sensor Networks 2017, Vol. 13(8) Ó The Author(s) 2017 DOI: / journals.sagepub.com/home/ijdsn Xu Liu, Zhongbao Zhang, Junning Li and Sen Su Abstract Virtual network embedding has received a lot of attention from researchers. In this problem, it needs to map a sequence of virtual networks onto the physical network. Generally, the virtual networks have topology, node, and link constraints. Prior studies mainly focus on designing a solution to maximize the revenue by accepting more virtual networks while ignoring the energy cost for the physical network. In this article, to bridge this gap, we design a heuristic energy-aware virtual network embedding algorithm called EA-VNE-C, to coordinate the dynamic electricity price and energy consumption to further optimize the energy cost. Extensive simulations demonstrate that this algorithm significantly reduces the energy cost by up to 14% over the state-of-the-art algorithm while maintaining similar revenue. Keywords Network virtualization, virtual network embedding, energy, cost, clustering Date received: 24 January 2017; accepted: 20 July 2017 Academic Editor: Hyungshin Kim Introduction Network virtualization supports multiple virtual networks (VNs) to exist on one physical network (PN). It provides Network as a service. Each VN may have different topologies and different numbers of nodes and links, for deploying different applications. How to embed such VNs onto the PN while satisfying the topology, node, and link constraint is termed as VN embedding problem. This problem has been proved to be non-deterministic polynomial-time hard (NP-hard). 1 Since the VN embedding problem is one of the most significant challenges, it has been widely studied. However, most of these studies 1 3 are devoted to designing efficient approaches with the goal of embedding more VNs and generating more revenues with little attention to the energy-related cost generated by the PN. In fact, energy-related cost is becoming more and more important, which is about 50% of the operating cost. 4 For example, in the United States, Akamai, one of the world s leading providers of content delivery networking services, has an annual electricity cost of about US$10 million. 5 In China, China Mobile Communications Corporation, the largest mobile service provider in the world, consumed over 13 TWH power consumption in To conserve more energy in VN embedding, we have studied energy-aware VN embedding problem in previous studies. 7 9 In such studies, we observe that the electricity price varies a lot for different locations and it also exhibits great time diversity for just a location. Thus, we proposed to leverage such diversities to save energy in VN embedding. However, it still awaits to be further optimized because it first selects the physical domain with the lowest price and then performs the intra-domain VN embedding. That means, it does not coordinate these two factors together, that is, the power and electricity State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China Corresponding author: Zhongbao Zhang, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing , China. zhongbaozb@bupt.edu.cn Creative Commons CC-BY: This article is distributed under the terms of the Creative Commons Attribution 4.0 License ( which permits any use, reproduction and distribution of the work without further permission provided the original work is attributed as specified on the SAGE and Open Access pages ( openaccess.htm).
2 2 International Journal of Distributed Sensor Networks price. Selecting the physical domain with lowest price may cause the problem of high energy consumption and thus suffers from high energy costs. In this article, we propose to coordinate the power and electricity price together to further optimize the energy cost. Specifically, we first use the topology of the VN to generate a weighted similarity graph for capturing the similarity between each two virtual nodes. We then employ local clustering technique to cluster the virtual nodes. We next perform the VN embedding based on such clusters. Through extensive simulations, we show that our algorithm can significantly reduce energy consumption by up to 14% over the state-of-the-art algorithm. The key contributions of this article are listed as follows: 1. To the best of our knowledge, this is the first attempt to coordinate the electricity price and power consumption to save energy cost in VN embedding problem. 2. To address this problem, we proposed a clustering-based coordinated VN embedding approach to further optimize the energy cost. 3. We conducted extensive simulations for evaluating our algorithm. We show that our algorithm reduces energy consumption by up to 14% over the existing migration-oblivious algorithm. Modeling and formulation In this section, we define the network model and the electricity price model first. We then specify how to calculate the electricity cost in terms of a given mapping solution. In the end, we give the performance metrics. Network model A PN consists of a set of physical domains and a set of backbone links connecting between them. So, we use G p = S u D u, L p to denote the graph of PN, where Du is a physical domain on the graph G p and L p is a set of cross-domain links that link between domains. And we have D u =(N u, L u ), where N u is the set of physical nodes inside the domain D u and L u is the set of local links between nodes of N u inside one D u. In our real world, a domain could be some data centers in which there are several computing nodes and local links, and there are backbone links connecting the data centers across different domains. For a domain, there are two properties: location and electricity price. The electricity price we used is from the real-world power market. In our model, we denote Price u, t as the electricity price of domain u at time point t. A physical node can be denoted as i with the properties of CPU capacity and current load. A physical link, including local link and backbone link, between nodes i and j can be denoted as l ij, consisting of properties of bandwidth and current load. We use G v =(N v, L v ) to denote a VN, where N v is the set of virtual nodes and L v is the set of virtual links. A virtual node could be denoted as m with the properties of CPU requirement and domain constraint. Under the domain constraint, the virtual node could only be mapped to a set of given domains. Similar to physical link, a virtual link between virtual nodes m and n can be denoted as l mn, having the property of bandwidth requirement. In this way, we can use R v =(G v, t a, t d ) to denote a VN request, where G v is the requested VN and t a, t d are the arrival time and duration, respectively. Finally, we define the VN embedding problem as finding a node mapping solution and link mapping solution to satisfy all the nodes and links requirements of a request. The notations used are given in Table 1. Power cost modeling To calculate the power consumption of the VN embedding, we classify the power consumption into three categories: node power cost, link power cost, and switching power cost. Node power cost. For embedding a VN, there are two kinds of roles for each node involved: hosting node and forwarding node. Hosting nodes are responsible for providing the CPU capacity and doing computation as required, and forwarding nodes are used to forward the traffic between hosting nodes if two of the hosting nodes are not connected directly. As we can see in previous studies, the power consumption of normal server is a linear growth with the utilization of CPU. 10 So, we use the following equation to evaluate the power consumption of an active node PN = P b + P l util ð1þ where P b is the basic power consumption of an active node, P l is the additional power consumption of full CPU utilization, and util is the current load of this node. Thus, the additional power consumption for mapping a virtual hosting node h to j is DPN = P b + P l C h ( if S j = 0) P l C h (otherwise) ð2þ Let Ni H and Ni F denote the additional number of hosting nodes and forwarding nodes in the ith domain, respectively. There will be two part of power
3 Liu et al. 3 Table 1. Notations. Notation Description xj u fjk uv A binary variable. xj u = 1 if virtual node u is mapped to the substrate node j and 0 otherwise A binary variable. fjk uv = 1 if virtual link l uv is routed on physical link l jk and 0 otherwise D u The location of node u, which can be represented by (x u, y u ) Dis(u, j) The Euclidean distance between u and j, which can be calculated by W u N H i N F i P b P l S j DPN DPL DE s DEN DEL DES qffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi (x u x j ) 2 +(y u y j ) 2 Indicating how far u can be placed from its own location to the location of substrate nodes The number of hosting nodes needing to be powered on from off state in ith domain The number of forwarding nodes needing to be powered on from off state in ith domain The baseline power for a server The power proportional factor for CPU utilization The power state of substrate node j. S j = 1ifj is in on state and 0 otherwise The additional node power consumption The additional link power consumption One-time power consumption for powering up The additional node energy cost The additional link energy cost The additional switching energy cost consumption: the first is the baseline part and the second is the linear increasing part. For the first part, there will be Ni H + Ni F new nodes. These nodes will consume baseline power at the amount of (Ni H + Ni F ) P b. For the second part, it is P P jnpi j Pu2N v i2g j = 1 xu j P lcpu(u). Thus, the node energy cost can be calculated as DEN = = X u2n v X + X i2g X jn p i j i2g j = 1 (N H i ð Ta + T d T a x u j P lcpu(u) PN Pr i (t)dt ð Ta + T d T a + N F i )P b ð Ta + T d T a Pr i (t)dt Pr i (t)dt Link power cost. We consider both long physical links, which span over a large geographical region and therefore require repeaters that consume power, and short physical links that span a small geographical region and to denote the power consumption of the repeaters on a long link l st 2 L sr when mapping a virtual link l uv 2 L vr. The overall link cost can be calculated as require no repeaters. We use PL uv st DEL = X l uv 2L vr X fst uv DPL uv st Pr s(t)dt l st 2L sr ð4þ We set DPL uv st to be linear with the traffic volume of l uv and the distance between s and t based on the findings in Chiaraviglio et al. 11 DPL uv st = Dis(s, t) P r B uv OB st ð5þ where P r denotes the power density of the repeaters over distance and OB st denotes the overall bandwidth capacity of substrate backbone link l st. Switching power cost. Powering up a server incurs onetime energy consumption for transiting from the power-saving state into the active state, which is called the switching cost. We use N s to denote how many nodes are powering up and DE s to denote the cost for one time of powering up. The overall switching cost can be calculated as DES = X r2n v X Performance metrics i2n p N s E s ð te t a Pr i (t)dt ð6þ Revenue. We define the long-term average revenue for mapping VN requests as follows P N i = 1 lim Ri (G v ) T! T ð7þ where R i (G v )=( P h2n v C h + P l v 2L v B(l v )) t d represents the revenue for mapping the ith VN request. Energy cost. Based on equations (3), (4), and (6), for embedding a VN, the energy cost can be calculated as Min DE = DEN + DEL + DES ð8þ To calculate energy cost in the long run, we define the long-term average energy cost as follows
4 4 International Journal of Distributed Sensor Networks P N i = 1 lim T! E i (G v ) T ð9þ where N is the number of VN requests accepted by the PN successfully in time T and E i (G v ) denotes the energy cost for the ith VN request. Proposed solution Motivation Electricity cost is a large overhead in VN embedding, and thus there are a handful of studies focusing on energy-aware approaches to cut down the cost. However, they have not coordinated both electricity price and energy consumption into consideration. Some of them only consider the energy consumption, 7,12 which will lead to a huge cost of electricity. Some of them only consider the electricity price, 9 which will lead to high energy consumption. To achieve the goal of minimizing energy cost, the ideal algorithm should take the following factors into account: (1) mapping virtual nodes into the physical domain with lower electricity price, (2) consolidating virtual nodes into less number of physical nodes for energy saving, and (3) shortening the length of inter-domain physical links for energy saving. In order to achieve the goals above, we design an efficient algorithm called EA- VNE-C, to coordinate the electricity price and energy consumption together. Specifically, we first use the topology of the VN to generate a weighted similarity graph for capturing the similarity between each two virtual nodes. We then employ local clustering technique to cluster the virtual nodes and next perform the VN embedding based on such clusters. Evaluating clustering coefficient Before we get started, we define the cluster as a group of virtual nodes in which virtual nodes can be mapped into the same physical domain. We use a and b to denote them later. For each cluster a, we denote D a as the set of physical domains that all of the virtual modes inside a can be mapped into. For each pair of clusters a and b, we can denote bw ab as the cross-domain bandwidth between clusters a and b. It can be evaluated as the sum of request required bandwidth between each pair of virtual nodes inside the clusters a and b. Unlike the classical local clustering schemes in social network, we evaluate the affinity as the clustering coefficient to measure the degree to which virtual nodes in a graph tend to cluster together. And we denote w ab as the affinity between the clusters a and b. We use Price i = Ð t e t a Price i, t dt to denote the integral of electricity price in the time ½t a, t e Š. We use Price max = maxfprice i g, 8i 2 D, to denote the maximum electricity price in all domains and use Price min = minfprice i g, 8i 2 D, to denote the minimum electricity price in all domains. So, we have T w ab = w ab D a T Db 6¼ [ ð10þ 0 D a Db = [ where w ab = a Price max Price ab Price max Price min +(1 a) bw ab bw max, a 2 (0, 1) Price ab = and X i2d a \D b Price max Price 1=r i, r 2 Z + Price max Price min bw max = maxfbw ab g, 8a, b 2 N v Here, a is a bias for the weight of electricity price against link bandwidth and r is a factor to enlarge the weight of sharing in physical domains between virtual node clusters. Clustering Our algorithm is based on a local clustering scheme, aiming to group virtual nodes into clusters and mapping each cluster into the best physical domain. Our algorithm aims to coordinate the following aspects at the same time: (1) how much is the electricity price of a physical domain during the request, (2) how many physical domains could each pair of virtual nodes both mapped into, and (3) how much bandwidth does each pair of virtual nodes need. In this way, we can map virtual nodes into less physical domains with the lowest electricity price. In this step, we apply local clustering technique to virtual nodes to group them into clusters. The input of this algorithm is the VN graph, and the output is the set of clusters. First, we produce a set of clusters and make it empty set initially. Second, we make each virtual node as a cluster and add this cluster to the result set. Third, we calculate the affinity between each pair of clusters and find the pair with the maximum affinity. If the maximum affinity is 0, that is, there is no pair of clusters which could be joined together, we end up the algorithm. Otherwise, we join the pair of clusters of the maximum affinity into one cluster. And then, we repeat this step until the maximum affinity meets 0. Finally, we return the set of remaining clusters.
5 Liu et al. 5 Figure 1. Comparisons between our algorithm and the state-of-the-art algorithm (small-sized VNs): (a) revenue, (b) mapping ratio, (c) energy cost, and (d) revenue/cost (RC) ratio. Algorithm 2. The VN embedding algorithm Algorithm 1. The clustering algorithm Input: G v, G p Output: C (the set of clustered virtual nodes) 1. Clusters = f;g 2. for each virtual node i in G v do 3. Add Cluster fig to C. 4. while true do 5. for for each pair of cluster a and b in C do 6. Calculate w ab according to equation (10); 7. Find the pair of a and b with w max = w ab. 8. if w max = 0 then 9. break; 10. else 11. Add a S b to C. 12. Remove a and b from C. 13. return C; Input: G v, G p, C (obtained from Algorithm 1) Output: mapping solutions for nodes and links 1. for each Cluster C a in C do 2. Find physical domain p in D a with the lowest electricity price. 3. for each virtual node u 2 C a do 4. Map n v to the physical node using the best-fit scheme in the selected PN. 5. if CPU constraint not satisfied then 6. return NM FAILED 7. for each link l v do 8. Remove the substrate links that do not satisfy the bandwidth constraint. 9. Find the shortest paths in the residual underlay. 10. Search a path P on these paths with least number of inactive substrate nodes. 11. if link constraint not satisfied then 12. return LM FAILED 13. Output the node and link mapping solutions.
6 6 International Journal of Distributed Sensor Networks Figure 2. Comparisons between our algorithm and the state-of-the-art algorithm (regular-sized VNs): (a) revenue, (b) mapping ratio, (c) energy cost, and (d) revenue/cost (RC) ratio. VN embedding In the second step, we apply energy-aware VN node and link embedding strategies in our previous studies. 8,9 The core idea of the VN node mapping strategy lies in that we use the best-fit scheme to consolidate the virtual nodes to the minimum number of substrate nodes while meeting the CPU requirements of these virtual nodes. Specifically, (1) we first use N cpu to denote the difference in CPU capacities between the physical node n s and the virtual node n v, that is, N cpu = CPU(n s ) CPU(n v ). Note that only the substrate nodes which can satisfy the CPU constraint of n v are considered as candidate nodes. (2) We then rank the candidate physical nodes according to the values of N cpu in non-decreasing order. (3) We finally embed each virtual node to the physical node with the highest ranking. The core idea of the VN link mapping strategy lies in that we consider the power state of physical nodes and design active-preferred shortest algorithm. It means that, we calculate several shortest paths for each pair of corresponding physical nodes and select the physical path with maximum number of active physical nodes. Time complexity In Algorithm 1, for a given VN of size n, there are n virtual nodes in this network, and it costs O(n 2 ) time to calculate w ab for each pair of virtual nodes a and b. Itis O(n) to have w max = 0 and converge in the worst case. Therefore, Algorithm 1 is a polynomial-time algorithm. In Algorithm 2, as we know, 9 previous VN embedding scheme can be computed in polynomial-time. Hence, our algorithm is also a polynomial-time algorithm. Performance evaluation Experimental setup Like most previous works, we generate the PN and VN graphs by Georgia Tech Internetwork Topology
7 Liu et al. 7 Figure 3. Comparisons between our algorithm and the state-of-the-art algorithm (large-sized VNs): (a) revenue, (b) mapping ratio, (c) energy cost, and (d) revenue/cost (RC) ratio. Models. We use the similar configuration to the one in previous papers. 9 The PN used consists of five domains which are located in a grid randomly. In each of the domains, the number of uniform physical nodes is from 50 to 90. The CPU capacity of a node varies from 50 to 100. There is 50% link connectivity between the nodes, that is, each pair of nodes inside a domain is connected with probability of 50%. The bandwidth of each intra-domain links varies from 50 to 100, and the bandwidth of inter-domain links is 10 times of intra-domain. We use three different VN scales in this experiment: small size, regular size, and large size. Like each domain in PN, the virtual nodes in each VN are also located randomly in a grid. The number of virtual nodes of a single request is 2 5, 2 10, and 2 15 for each VN size, respectively. The link connectivity is of 50%. The range of CPU capacity and link bandwidth is Tosimulate the request over the VNs, we assume that the arrival of requests is a Poisson process with average arrival rate of three requests per 60 time units. The request s duration is an exponential distribution with an average of 500 time units. Our simulation starts from time point 0 to 40, 000, consisting of about 2000 requests. The electricity prices for the domain we used are the real-world electricity price records of five regional transmission organization in September 2011 in the United States (available at: 13 We set P r to 1 W per distance unit so that the electricity cost of links is about 10% of the nodes cost. By default, we set the bias factor a to 0:3 and exponent r to 3. We implement the algorithms in C++ and perform them side-by-side on Ubuntu with 2.6 GHz CPU and 8 GB RAM. In the first step, we compare our algorithm (denoted as EA-VNE-C) with the one (EA-VNE) that maps every virtual node into its corresponding lowest priced domain. We track down the long-term revenue, long-
8 8 International Journal of Distributed Sensor Networks Figure 4. Comparisons between our algorithm and the state-of-the-art algorithm (different scales): (a) revenue, (b) mapping ratio, (c) energy cost, and (d) revenue/cost (RC) ratio. Figure 5. Time comparisons between our algorithm and the state-of-the-art algorithm (different scales). term electricity cost, active nodes count, mapping success rate, and running time for each 4000 time unit. In the second step, we compare between the above two algorithms on the variations of regular-sized VN. We evaluate the same performance as described in the first step under different request arrival densities and request duration densities. To facilitate such comparisons, we multiply 0.25, 0.5, 2, and 4 to request arrival time and duration, respectively. We use the result at the time point of 40,000 time unit for these comparisons. In the third step, we compare the performance of our algorithm with different bias factors, that is, a value. We take a as 0.1, 0.3, 0.5, 0.7, and 0.9. We use the regular-sized VN as the input, and also use the same performance as described in the first step above and the results at the time point of 40,000 time unit in this step.
9 Liu et al. 9 Figure 6. Comparisons between our algorithm and the state-of-the-art algorithm (different arrival density): (a) revenue, (b) mapping ratio, (c) energy cost, and (d) revenue/cost (RC) ratio. Evaluation results Comparison with EA-VNE under various VN scales. We first compare our algorithm to the state-of-the-art algorithm under different VN scales. We report the comparison results in Figures 1 3. We also summarize the results in Figure 4. The results show that, compared to EA-VNE, the long-term revenue cost ratios (long-term revenue divided by long-term cost) of EA-VNE-C increase by 5:9%, 10:8%, and 14:3%, on small, regular, and large VNs respectively. On one hand, EA-VNE-C has the same mapping success rate as EA-VNE or even slightly better in some cases, which leads to a tie on the aspect of the long-term revenue. On the other hand, EA-VNE-C successfully cuts down the electricity cost on all VN scales. And as we can see, EA-VNE-C has a better long-term revenue cost ratio. Thus, EA-VNE-C is more profitable on the same cost of electricity. The reason that EA-VNE-C gets more long-term profit than EA-VNE is obvious. EA-VNE always chooses the domain with the lowest electricity price to map, while EA-VNE-C considers both the electricity price and the topology of VN. In this way, EA-VNE-C can manage to cut down the electricity price by mapping to lowest priced domain, and it also minimizes the electricity energy by clustering virtual nodes together. Regarding running time comparison, as shown in Figure 5, EA-VNE-C finishes all computation in a slightly more time than EA-VNE. The reason is that it produces a better domain selection by clustering (Algorithm 1), which is helpful to find out the best node link mapping solution in the fastest way (Algorithm 2). However, on the small scaling network, virtual nodes are very sparse. Clustering before node mapping, in a way, could lead to the same result as direct selection by
10 10 International Journal of Distributed Sensor Networks Figure 7. Comparisons between our algorithm and the state-of-the-art algorithm (different duration density): (a) revenue, (b) mapping ratio, (c) energy cost, and (d) revenue/cost (RC) ratio. electricity price sometimes. Thereby, EA-VNE-C is not much better than EA-VNE in this case. Impact of request density. We next evaluate the impact of the request density on the performance on our algorithm. We multiply 0.25, 0.5, 2, and 4 for the arrival time and duration of VN requests, respectively. We also use the result at the time point of 40,000 time unit for these comparisons. We report the comparison results in Figures 6 and 7. As the request gets denser, the mapping success rate for both EA-VNE and EA- VNE-C drops (as shown in Figures 6(b) and 7(b)), while the long-term revenue and long-term electricity cost rise (as shown in Figures 6(a), 6(c), 7(a), and 7(c)). Compared to EA-VNE, EA-VNE-C has a better mapping success rate and gets more long-term revenue while getting a little more on electricity cost. After all, EA-VNE-C improves the average long-term revenue cost ratio by 12:4% and 11:7% than EA-VNE, under all request arrival density and duration density, respectively. As the requests arrive more frequently or keep longer, the available resource becomes more less. Thus, it is more difficult to find a mapping method with low electricity price and bandwidth utilization. However, EA-VNE-C still performs better in this case by clustering virtual nodes. Impact of bias factor. We next evaluate the impact of the parameter a on the performance of our algorithm. We compare the performance of our algorithm with different bias factors, that is, a value. We report such comparison results in Figure 8. We take a as 0.1, 0.3, 0.5, 0.7, and 0.9. We use the regular-sized VN as the input, and also use the same performance as described in the first step above and the results at the time point of 40,000 time unit in this step.
11 Liu et al. 11 Figure 8. Comparisons between our algorithm and the state-of-the-art algorithm (different alpha values): (a) revenue, (b) mapping ratio, (c) energy cost, and (d) revenue/cost (RC) ratio. In this case, we can find that the best a value is 0:3 for the requests on the regular-sized VN. Along with the a value going lesser or greater than 0:3, as shown in Figure 8(a), the long-term revenue gets slightly less, while the long-term electricity cost is greater, and the long-term revenue electricity ratio decreased. Recall that a value denotes the weight of electricity price against the weight of bandwidth in the affinity formulation. A smaller value of a will enlarge the weight of topology aspect, while a larger value of a will enlarge the weight of electricity price aspect. To coordinate two of the aspects, we should take a medium-sized a value. Related work Since Yu et al. 1 propose the VN embedding framework formally, it has attracted increasing number of researchers attentions. There are two lines for addressing this problem: one is revenue-aware VN embedding and the other one is energy-aware VN embedding. Revenue-aware VN embedding Yu et al. 1 propose to leverage the path splitting and migration technique to increase the acceptance ratio of embedding a VN. Chowdhury et al. 2 formulate this problem to be a mixed integer programming model and employ the relax and rounding technique to solve this model. Zhang et al. 3 present an opportunistic resource sharing based mapping framework and propose two first-fit-based algorithms to maximize the utilization of the PN for VNs with dynamic demands. Some other techniques have also been applied in this branches, such as subgraph isomorphism algorithm 14 and ant colony metaheuristic algorithm. 15 Our work differs from these
12 12 International Journal of Distributed Sensor Networks existing studies in the following way: we try to address the energy-cost-aware VN embedding problem, which can save energy cost and increase the net profit for the infrastructure provider. Energy-aware VN embedding To save energy consumption for carrying out VN embedding, Su and colleagues 7 9 propose the corresponding solution. Its core idea is that it leverages the location and time-varing diversities of electricity price to save the energy cost for multi-domain VN embedding. Our article proposes to further optimize the cost by coordinating electricity price and power consumption. Recently, Zhang et al. 12 propose to save energy for VNs with dynamic demands. They first model the dynamics of VN demands as a combination of a Gaussian distribution. They then leverage this model and propose two efficient algorithms to minimize the energy consumption while keeping a high revenue for the PN. One algorithm processes the VN requests one by one, while the other one processes them group by group. We will also consider this factor to extend this article in the future. Virtualized systems There are also some other virtualized platforms 16,17 to achieve high performance for the system. The authors can read the surveys 18,19 of network virtualization and VN embedding for further reference. Security and privacy issues Besides the VN embedding allocation problem in cloud computing, there are also some hot topics, for example, security issues and privacy issues 31,32 in cloud computing, which have attracted a lot of attention. Due to the page limits, we do not introduce them one by one. Conclusion In this article, we take a further step and coordinate the dynamic electricity price and energy consumption to optimize the energy cost. We first use the topology of the VN to generate a weighted graph for capturing the affinity between each two virtual nodes on the aspects of the electricity price and topology. We then employ local clustering algorithm to cluster the virtual nodes based on the affinity graph and finally perform the VN embedding based on such clusters. Through extensive simulations, we demonstrate that our algorithm saves up to 14% energy cost for the PN than the existing algorithm while obtaining attractive revenues. Declaration of conflicting interests The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article. Funding The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was supported in part by the following funding agencies of China: National Natural Science Foundation under grants , , and U References 1. Yu M, Yi Y, Rexford J, et al. Rethinking virtual network embedding: substrate support for path splitting and migration. ACM SIGCOMM Comp Com 2008; 38(2): Chowdhury N, Rahman M and Boutaba R. ViNEYard: virtual network embedding algorithms with coordinated node and link mapping. IEEE/ACM Trans Netw 2012; 20(1): Zhang S, Qian Z, Wu J, et al. Virtual network embedding with opportunistic resource sharing. IEEE T Parall Distr 2014; 25(3): Chun B, Iannaccone G, Iannaccone G, et al. An energy case for hybrid datacenters. ACM SIGOPS Oper Syst Rev 2010; 44(1): Qureshi A, Weber R, Balakrishnan H, et al. Cutting the electric bill for internet-scale systems. In: Proceedings of the ACM SIGCOMM 2009 conference on data communication, Barcelona, August 2009, pp New York: ACM. 6. China Mobile Research Institute, amazonaws.com/belllabs-microsite-greentouch/uploads/ documents/chih-lin_i%20-%20tia%20green%20 from%20a%20service%20provider%20perspective. pdf 7. Su S, Zhang Z, Cheng X, et al. Energy-aware virtual network embedding through consolidation. In: Proceedings IEEE INFOCOM workshops-ccses: green networking and smart grids, Orlando, FL, March 2012, pp New York: IEEE. 8. Su S, Zhang Z, Liu AX, et al. Energy-aware virtual network embedding. IEEE/ACM Trans Netw 2014; 22(5): Zhang Z, Su S, Niu X, et al. Minimizing electricity cost in geographical virtual network embedding. In: Proceedings IEEE global communication conference, Anaheim, CA, 3 7 December 2012, pp New York: IEEE. 10. Fan X, Weber W and Barroso L. Power provisioning for a warehouse-sized computer. In: Proceedings of the 34th annual international symposium on computer architecture,san Diego, CA, 9 13 June 2007, pp New York: ACM. 11. Chiaraviglio L, Mellia M and Neri F. Minimizing ISP network energy cost: formulation and solutions. IEEE/ ACM Trans Netw 2012; 20(2): Zhang Z, Su S, Zhang J, et al. Energy aware virtual network embedding with dynamic demands: online and offline. Comput Netw 2015; 93:
13 Liu et al United States Federal Energy Regulatory Commission, Lischka J and Karl H. A virtual network mapping algorithm based on subgraph isomorphism detection. In: Proceedings of the 1st ACM workshop on virtualized infrastructure systems and architectures, Barcelona, 17 August 2009, pp New York: ACM. 15. Fajjari I, Aitsaadi N, Pujolle G, et al. VNE-AC: virtual network embedding algorithm based on ant colony metaheuristic. In: Proceedings of the 2011 IEEE international conference on communications, Kyoto, Japan, 5 9 June New York: IEEE. 16. Lin N, Dong Y and Lu D. Providing virtual memory support for sensor networks with mass data processing. Int J Distrib Sens Netw 2013; 9(3): Shi J and Chung SH. A traffic-aware quality-of-service control mechanism for software-defined networkingbased virtualized networks. Int J Distrib Sens Netw 2017; 13(3): Chowdhury N and Boutaba R. A survey of network virtualization. Comput Netw 2010; 54(5): Fischer A, Botero J, Beck M, et al. Virtual network embedding: a survey. IEEE Commun Surv Tut 2013; 15(4): Fu Z, Wu X, Guan C, et al. Toward efficient multikeyword fuzzy search over encrypted outsourced data with accuracy improvement. IEEE T Inf Foren Sec 2016; 11(12): Zhou Z, Wang Y, Wu Q, et al. Effective and efficient global context verification for image copy detection. IEEE T Inf Foren Sec 2016; 12(1): Xia Z, Wang X, Sun X, et al. A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data. IEEE T Parall Distr 2016; 27(2): Zhu L, Guo D, Yin J, et al. Scalable link prediction in dynamic networks via non-negative matrix factorization. Technical report, 2014, Li J, Li X, Yang B, et al. Segmentation-based image copy-move forgery detection scheme. IEEE T Inf Foren Sec 2015; 10(3): Yuan C, Sun X and Lv R. Fingerprint liveness detection based on multi-scale LPQ and PCA. China Commun 2016; 13(7): Zhang Y, Sun X and Wang B. Efficient algorithm for k-barrier coverage based on integer linear programming. China Commun 2016; 13(7): Zhangjie F, Xingming S, Qi L, et al. Achieving efficient cloud search services: multi-keyword ranked search over encrypted cloud data supporting parallel computing. IEICE T Commun 2015; 98(1): Ren Y, Shen J, Wang J, et al. Mutual verifiable provable data auditing in public cloud storage. J Internet Technology 2015; 16(2): Xia Z, Wang X, Sun X, et al. Steganalysis of least significant bit matching using multi-order differences. Secur Commun Netw 2014; 7(8): Pan Z, Zhang Y and Kwong S. Efficient motion and disparity estimation optimization for low complexity multiview video coding. IEEE T Broadcast 2015; 61(2): Xia Z, Wang X, Zhang L, et al. A privacy-preserving and copy-deterrence content-based image retrieval scheme in cloud computing. IEEE T Inf Foren Sec 2016; 11(11): Fu Z, Ren K, Shu J, et al. Enabling personalized search over encrypted outsourced data with efficiency improvement. IEEE T Parall Distr 2016; 27(9):
A Novel Performance Metric for Virtual Network Embedding Combining Aspects of Blocking Probability and Embedding Cost
A Novel Performance Metric for Virtual Network Embedding Combining Aspects of Blocking Probability and Embedding Cost Enrique Dávalos 1 and Benjamín Barán Universidad Nacional de Asunción, Facultad Politécnica
More informationVNE-Sim: A Virtual Network Embedding Simulator
VNE-Sim: A Virtual Network Embedding Simulator Soroush Haeri and Ljiljana Trajković Communication Networks Laboratory http://www.ensc.sfu.ca/~ljilja/cnl/ Simon Fraser University Vancouver, British Columbia,
More informationA Prediction-based Dynamic Resource Management Approach for Network Virtualization
A Prediction-based Dynamic Resource Management Approach for Network Virtualization Jiacong Li, Ying Wang, Zhanwei Wu, Sixiang Feng, Xuesong Qiu State Key Laboratory of Networking and Switching Technology
More informationMinimizing bottleneck nodes of a substrate in virtual network embedding
Minimizing bottleneck nodes of a substrate in virtual network embedding Adil Razzaq, Peter Sjödin, Markus Hidell School of ICT, KTH-Royal Institute of Technology Stockholm, Sweden {arazzaq, psj, mahidell}@
More informationVirtual Network Embedding with Substrate Support for Parallelization
Virtual Network Embedding with Substrate Support for Parallelization Sheng Zhang, Nanjing University, P.R. China Jie Wu, Temple University, USA Sanglu Lu, Nanjing University, P.R. China Presenter: Pouya
More informationDSNRA: a Dynamic Substrate Network Reconfiguration Algorithm
DSNRA: a Dynamic Substrate Network Reconfiguration Algorithm Xinliang LV, Xiangwei ZHENG, and Hui ZHANG School of Information Science and Engineering Shandong Normal University, 250014, Jinan, CHINA Abstract
More informationModification of an energy-efficient virtual network mapping method for a load-dependent power consumption model
Modification of an energy-efficient virtual network mapping method for a load-dependent power consumption model HIROMICHI SUGIYAMA YUKINOBU FUKUSHIMA TOKUMI YOKOHIRA The Graduate School of Natural Science
More informationCost-based Pricing for Multicast Streaming Services
Cost-based Pricing for Multicast Streaming Services Eiji TAKAHASHI, Takaaki OHARA, Takumi MIYOSHI,, and Yoshiaki TANAKA Global Information and Telecommunication Institute, Waseda Unviersity 29-7 Bldg.,
More informationClustering-Based Distributed Precomputation for Quality-of-Service Routing*
Clustering-Based Distributed Precomputation for Quality-of-Service Routing* Yong Cui and Jianping Wu Department of Computer Science, Tsinghua University, Beijing, P.R.China, 100084 cy@csnet1.cs.tsinghua.edu.cn,
More informationOn Distributed Algorithms for Maximizing the Network Lifetime in Wireless Sensor Networks
On Distributed Algorithms for Maximizing the Network Lifetime in Wireless Sensor Networks Akshaye Dhawan Georgia State University Atlanta, Ga 30303 akshaye@cs.gsu.edu Abstract A key challenge in Wireless
More informationThe Load Balancing Research of SDN based on Ant Colony Algorithm with Job Classification Wucai Lin1,a, Lichen Zhang2,b
2nd Workshop on Advanced Research and Technology in Industry Applications (WARTIA 2016) The Load Balancing Research of SDN based on Ant Colony Algorithm with Job Classification Wucai Lin1,a, Lichen Zhang2,b
More informationReViNE: Reallocation of Virtual Network Embedding to Eliminate Substrate Bottleneck
ReViNE: Reallocation of Virtual Network Embedding to Eliminate Substrate Bottleneck Shihabur R. Chowdhury, Reaz Ahmed, Nashid Shahriar, Aimal Khan, Raouf Boutaba Jeebak Mitra, Liu Liu Virtual Network Embedding
More informationHSM: A Hybrid Streaming Mechanism for Delay-tolerant Multimedia Applications Annanda Th. Rath 1 ), Saraswathi Krithivasan 2 ), Sridhar Iyer 3 )
HSM: A Hybrid Streaming Mechanism for Delay-tolerant Multimedia Applications Annanda Th. Rath 1 ), Saraswathi Krithivasan 2 ), Sridhar Iyer 3 ) Abstract Traditionally, Content Delivery Networks (CDNs)
More informationThis is a repository copy of Cloud Virtual Network Embedding: Profit, Power and Acceptance.
This is a repository copy of Cloud Virtual Network Embedding: Profit, Power and Acceptance. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/8899/ Version: Accepted Version
More informationTowards Min- Cost Virtual Infrastructure Embedding
IEEE GLOBECOM 20, San Diego, CA Arizona State University Yu, ue and Zhang ({ruozhouy, xue, xzhan229}@asu.edu) are all with Arizona State University, Tempe, AZ 828. All correspondences should be addressed
More informationResearch Article A Two-Level Cache for Distributed Information Retrieval in Search Engines
The Scientific World Journal Volume 2013, Article ID 596724, 6 pages http://dx.doi.org/10.1155/2013/596724 Research Article A Two-Level Cache for Distributed Information Retrieval in Search Engines Weizhe
More informationOpen Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing Environments
Send Orders for Reprints to reprints@benthamscience.ae 368 The Open Automation and Control Systems Journal, 2014, 6, 368-373 Open Access Apriori Algorithm Research Based on Map-Reduce in Cloud Computing
More informationFigure 1. Clustering in MANET.
Volume 6, Issue 12, December 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Performance
More informationA Row-and-Column Generation Method to a Batch Machine Scheduling Problem
The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) Chengdu-Jiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 301 308 A Row-and-Column Generation
More informationImprovement of Buffer Scheme for Delay Tolerant Networks
Improvement of Buffer Scheme for Delay Tolerant Networks Jian Shen 1,2, Jin Wang 1,2, Li Ma 1,2, Ilyong Chung 3 1 Jiangsu Engineering Center of Network Monitoring, Nanjing University of Information Science
More informationarxiv: v2 [cs.ni] 23 May 2016
Simulation Results of User Behavior-Aware Scheduling Based on Time-Frequency Resource Conversion Hangguan Shan, Yani Zhang, Weihua Zhuang 2, Aiping Huang, and Zhaoyang Zhang College of Information Science
More informationPerformance Analysis of Storage-Based Routing for Circuit-Switched Networks [1]
Performance Analysis of Storage-Based Routing for Circuit-Switched Networks [1] Presenter: Yongcheng (Jeremy) Li PhD student, School of Electronic and Information Engineering, Soochow University, China
More informationResearch on Heterogeneous Communication Network for Power Distribution Automation
3rd International Conference on Material, Mechanical and Manufacturing Engineering (IC3ME 2015) Research on Heterogeneous Communication Network for Power Distribution Automation Qiang YU 1,a*, Hui HUANG
More informationA priority based dynamic bandwidth scheduling in SDN networks 1
Acta Technica 62 No. 2A/2017, 445 454 c 2017 Institute of Thermomechanics CAS, v.v.i. A priority based dynamic bandwidth scheduling in SDN networks 1 Zun Wang 2 Abstract. In order to solve the problems
More informationQoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks
QoS-Aware Hierarchical Multicast Routing on Next Generation Internetworks Satyabrata Pradhan, Yi Li, and Muthucumaru Maheswaran Advanced Networking Research Laboratory Department of Computer Science University
More informationVideo Inter-frame Forgery Identification Based on Optical Flow Consistency
Sensors & Transducers 24 by IFSA Publishing, S. L. http://www.sensorsportal.com Video Inter-frame Forgery Identification Based on Optical Flow Consistency Qi Wang, Zhaohong Li, Zhenzhen Zhang, Qinglong
More informationEvaluating Allocation Paradigms for Multi-Objective Adaptive Provisioning in Virtualized Networks
Evaluating Allocation Paradigms for Multi-Objective Adaptive Provisioning in Virtualized Networks Rafael Pereira Esteves, Lisandro Zambenedetti Granville, Mohamed Faten Zhani, Raouf Boutaba Institute of
More informationFramework Research on Privacy Protection of PHR Owners in Medical Cloud System Based on Aggregation Key Encryption Algorithm
Framework Research on Privacy Protection of PHR Owners in Medical Cloud System Based on Aggregation Key Encryption Algorithm Huiqi Zhao 1,2,3, Yinglong Wang 2,3*, Minglei Shu 2,3 1 Department of Information
More informationUsing Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions
Using Hybrid Algorithm in Wireless Ad-Hoc Networks: Reducing the Number of Transmissions R.Thamaraiselvan 1, S.Gopikrishnan 2, V.Pavithra Devi 3 PG Student, Computer Science & Engineering, Paavai College
More informationSURVIVABLE VNE. By Sedef Savas Networks Lab, May 25, 2017
SURVIVABLE VNE By Sedef Savas Networks Lab, May 25, 2017 1 SURVEY ON SURVIVABLE VIRTUAL NETWORK EMBEDDING PROBLEM AND SOLUTIONS Sandra Herker, Ashiq Khan, Xueli An DOCOMO Communications Laboratories Europe
More informationEnd-To-End Delay Optimization in Wireless Sensor Network (WSN)
Shweta K. Kanhere 1, Mahesh Goudar 2, Vijay M. Wadhai 3 1,2 Dept. of Electronics Engineering Maharashtra Academy of Engineering, Alandi (D), Pune, India 3 MITCOE Pune, India E-mail: shweta.kanhere@gmail.com,
More informationENTERPRISES nowadays are embracing a new computing
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI.9/TCC.26.253525,
More informationA Two-phase Distributed Training Algorithm for Linear SVM in WSN
Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science (EECSS 015) Barcelona, Spain July 13-14, 015 Paper o. 30 A wo-phase Distributed raining Algorithm for Linear
More informationISSN: [Shubhangi* et al., 6(8): August, 2017] Impact Factor: 4.116
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY DE-DUPLICABLE EFFECTIVE VALIDATION of CAPACITY for DYNAMIC USER ENVIRONMENT Dr. Shubhangi D C *1 & Pooja 2 *1 HOD, Department
More informationFSRM Feedback Algorithm based on Learning Theory
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 699-703 699 FSRM Feedback Algorithm based on Learning Theory Open Access Zhang Shui-Li *, Dong
More informationA New Approach to Ant Colony to Load Balancing in Cloud Computing Environment
A New Approach to Ant Colony to Load Balancing in Cloud Computing Environment Hamid Mehdi Department of Computer Engineering, Andimeshk Branch, Islamic Azad University, Andimeshk, Iran Hamidmehdi@gmail.com
More informationOptimization on TEEN routing protocol in cognitive wireless sensor network
Ge et al. EURASIP Journal on Wireless Communications and Networking (2018) 2018:27 DOI 10.1186/s13638-018-1039-z RESEARCH Optimization on TEEN routing protocol in cognitive wireless sensor network Yanhong
More informationEmbedded protocols based on the crowd Petri networks and opportunistic bandwidth allocation
Guo and Si EURASIP Journal on Embedded Systems (2017) 2017:17 DOI 10.1186/s13639-016-0068-0 EURASIP Journal on Embedded Systems RESEARCH Embedded protocols based on the crowd Petri networks and opportunistic
More informationEnergy Optimized Routing Algorithm in Multi-sink Wireless Sensor Networks
Appl. Math. Inf. Sci. 8, No. 1L, 349-354 (2014) 349 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/10.12785/amis/081l44 Energy Optimized Routing Algorithm in Multi-sink
More informationQADR with Energy Consumption for DIA in Cloud
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 4, April 2014,
More informationQuality-Assured Cloud Bandwidth Auto-Scaling for Video-on-Demand Applications
Quality-Assured Cloud Bandwidth Auto-Scaling for Video-on-Demand Applications Di Niu, Hong Xu, Baochun Li University of Toronto Shuqiao Zhao UUSee, Inc., Beijing, China 1 Applications in the Cloud WWW
More informationA Distributed, Parallel, and Generic Virtual Network Embedding Framework
A Distributed, Parallel, and Generic Virtual Network Embedding Framework Michael Till Beck, Andreas Fischer, Hermann de Meer University of Passau, Passau, Germany {michael.beck,andreas.fischer,demeer}@uni-passau.de
More informationModel the P2P Attack in Computer Networks
International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2015) Model the P2P Attack in Computer Networks Wei Wang * Science and Technology on Communication Information
More informationBaoping Wang School of software, Nanyang Normal University, Nanyang , Henan, China
doi:10.21311/001.39.7.41 Implementation of Cache Schedule Strategy in Solid-state Disk Baoping Wang School of software, Nanyang Normal University, Nanyang 473061, Henan, China Chao Yin* School of Information
More informationSpray and forward: Efficient routing based on the Markov location prediction model for DTNs
. RESEARCH PAPER. SCIENCE CHINA Information Sciences February 2012 Vol. 55 No. 2: 433 440 doi: 10.1007/s11432-011-4345-1 Spray and forward: Efficient routing based on the Markov location prediction model
More informationHeuristic Algorithms for Multiconstrained Quality-of-Service Routing
244 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL 10, NO 2, APRIL 2002 Heuristic Algorithms for Multiconstrained Quality-of-Service Routing Xin Yuan, Member, IEEE Abstract Multiconstrained quality-of-service
More informationOpen Access Self-Growing RBF Neural Network Approach for Semantic Image Retrieval
Send Orders for Reprints to reprints@benthamscience.ae The Open Automation and Control Systems Journal, 2014, 6, 1505-1509 1505 Open Access Self-Growing RBF Neural Networ Approach for Semantic Image Retrieval
More informationReducing Electricity Usage in Internet using Transactional Data
Reducing Electricity Usage in Internet using Transactional Data Bhushan Ahire 1, Meet Shah 2, Ketan Prabhulkar 3, Nilima Nikam 4 1,2,3Student, Dept. of Computer Science and Engineering, YTIET College,
More informationCHAPTER 6 STATISTICAL MODELING OF REAL WORLD CLOUD ENVIRONMENT FOR RELIABILITY AND ITS EFFECT ON ENERGY AND PERFORMANCE
143 CHAPTER 6 STATISTICAL MODELING OF REAL WORLD CLOUD ENVIRONMENT FOR RELIABILITY AND ITS EFFECT ON ENERGY AND PERFORMANCE 6.1 INTRODUCTION This chapter mainly focuses on how to handle the inherent unreliability
More informationConnectivity-aware Virtual Network Embedding
Connectivity-aware Virtual Network Embedding Nashid Shahriar, Reaz Ahmed, Shihabur R. Chowdhury, Md Mashrur Alam Khan, Raouf Boutaba Jeebak Mitra, Feng Zeng Outline Survivability in Virtual Network Embedding
More informationFast and accurate near-duplicate image elimination for visual sensor networks
Research Article Fast and accurate near-duplicate image elimination for visual sensor networks International Journal of Distributed Sensor Networks 2017, Vol. 13(2) Ó The Author(s) 2017 DOI: 10.1177/1550147717694172
More informationResearch Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless Sensor Networks
Distributed Sensor Networks Volume 2013, Article ID 858765, 6 pages http://dx.doi.org/10.1155/2013/858765 Research Article MFT-MAC: A Duty-Cycle MAC Protocol Using Multiframe Transmission for Wireless
More informationA Comparative Study on Exact Triangle Counting Algorithms on the GPU
A Comparative Study on Exact Triangle Counting Algorithms on the GPU Leyuan Wang, Yangzihao Wang, Carl Yang, John D. Owens University of California, Davis, CA, USA 31 st May 2016 L. Wang, Y. Wang, C. Yang,
More informationOPTIMIZED TASK ALLOCATION IN SENSOR NETWORKS
OPTIMIZED TASK ALLOCATION IN SENSOR NETWORKS Ali Bagherinia 1 1 Department of Computer Engineering, Islamic Azad University-Dehdasht Branch, Dehdasht, Iran ali.bagherinia@gmail.com ABSTRACT In this paper
More informationVirtual Machine Placement in Cloud Computing
Indian Journal of Science and Technology, Vol 9(29), DOI: 10.17485/ijst/2016/v9i29/79768, August 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Virtual Machine Placement in Cloud Computing Arunkumar
More informationTop-k Keyword Search Over Graphs Based On Backward Search
Top-k Keyword Search Over Graphs Based On Backward Search Jia-Hui Zeng, Jiu-Ming Huang, Shu-Qiang Yang 1College of Computer National University of Defense Technology, Changsha, China 2College of Computer
More informationFigure 1: Virtualization
Volume 6, Issue 9, September 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Profitable
More informationTopic: Local Search: Max-Cut, Facility Location Date: 2/13/2007
CS880: Approximations Algorithms Scribe: Chi Man Liu Lecturer: Shuchi Chawla Topic: Local Search: Max-Cut, Facility Location Date: 2/3/2007 In previous lectures we saw how dynamic programming could be
More informationAn Edge-Swap Heuristic for Finding Dense Spanning Trees
Theory and Applications of Graphs Volume 3 Issue 1 Article 1 2016 An Edge-Swap Heuristic for Finding Dense Spanning Trees Mustafa Ozen Bogazici University, mustafa.ozen@boun.edu.tr Hua Wang Georgia Southern
More informationTHE CACHE REPLACEMENT POLICY AND ITS SIMULATION RESULTS
THE CACHE REPLACEMENT POLICY AND ITS SIMULATION RESULTS 1 ZHU QIANG, 2 SUN YUQIANG 1 Zhejiang University of Media and Communications, Hangzhou 310018, P.R. China 2 Changzhou University, Changzhou 213022,
More informationThe Study of Intelligent Scheduling Algorithm in the Vehicle ECU based on CAN Bus
Send Orders for Reprints to reprints@benthamscience.ae The Open Cybernetics & Systemics Journal, 2015, 9, 1461-1465 1461 Open Access The Study of Intelligent Scheduling Algorithm in the Vehicle ECU based
More informationA Low-Overhead Hybrid Routing Algorithm for ZigBee Networks. Zhi Ren, Lihua Tian, Jianling Cao, Jibi Li, Zilong Zhang
A Low-Overhead Hybrid Routing Algorithm for ZigBee Networks Zhi Ren, Lihua Tian, Jianling Cao, Jibi Li, Zilong Zhang Chongqing Key Lab of Mobile Communications Technology, Chongqing University of Posts
More informationGREP: Guaranteeing Reliability with Enhanced Protection in NFV
GREP: Guaranteeing Reliability with Enhanced Protection in NFV Jingyuan Fan jfan5@buffalo.edu Xiujiao Gao xiujiaog@buffalo.edu Zilong Ye zilongye@buffalo.edu Kui Ren kuiren@buffalo.edu Chaowen Guan chaoweng@buffalo.edu
More informationM 3 DDVC: Multi-source Multicasting using Multi-cores with Delay and Delay Variation Constraints on Overlay Networks
2011 Eighth International Conference on Information Technology: New Generations M 3 DDVC: Multi-source Multicasting using Multi-cores with Delay and Delay Variation Constraints on Overlay Networks Shankar
More informationA hierarchical network model for network topology design using genetic algorithm
A hierarchical network model for network topology design using genetic algorithm Chunlin Wang 1, Ning Huang 1,a, Shuo Zhang 2, Yue Zhang 1 and Weiqiang Wu 1 1 School of Reliability and Systems Engineering,
More informationNodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks
IJCSNS International Journal of Computer Science and Network Security, VOL.17 No.9, September 2017 139 Nodes Energy Conserving Algorithms to prevent Partitioning in Wireless Sensor Networks MINA MAHDAVI
More informationA Joint Replication-Migration-based Routing in Delay Tolerant Networks
A Joint -Migration-based Routing in Delay Tolerant Networks Yunsheng Wang and Jie Wu Dept. of Computer and Info. Sciences Temple University Philadelphia, PA 19122 Zhen Jiang Dept. of Computer Science West
More informationA Dynamic Adaptive Algorithm Based on HTTP Streaming Media Technology
2016 International Conference on Electronic Information Technology and Intellectualization (ICEITI 2016) ISBN: 978-1-60595-364-9 A Dynamic Adaptive Algorithm Based on HTTP Streaming Media Technology Zhufeng
More informationIN recent years, the amount of traffic has rapidly increased
, March 15-17, 2017, Hong Kong Content Download Method with Distributed Cache Management Masamitsu Iio, Kouji Hirata, and Miki Yamamoto Abstract This paper proposes a content download method with distributed
More informationPiecewise Linear Approximation Based on Taylor Series of LDPC Codes Decoding Algorithm and Implemented in FPGA
Journal of Information Hiding and Multimedia Signal Processing c 2018 ISSN 2073-4212 Ubiquitous International Volume 9, Number 3, May 2018 Piecewise Linear Approximation Based on Taylor Series of LDPC
More informationCHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION
CHAPTER 5 ANT-FUZZY META HEURISTIC GENETIC SENSOR NETWORK SYSTEM FOR MULTI - SINK AGGREGATED DATA TRANSMISSION 5.1 INTRODUCTION Generally, deployment of Wireless Sensor Network (WSN) is based on a many
More informationA Reduce Identical Composite Event Transmission Algorithm for Wireless Sensor Networks
Appl. Math. Inf. Sci. 6 No. 2S pp. 713S-719S (2012) Applied Mathematics & Information Sciences An International Journal @ 2012 NSP Natural Sciences Publishing Cor. A Reduce Identical Composite Event Transmission
More informationET-based Test Data Generation for Multiple-path Testing
2016 3 rd International Conference on Engineering Technology and Application (ICETA 2016) ISBN: 978-1-60595-383-0 ET-based Test Data Generation for Multiple-path Testing Qingjie Wei* College of Computer
More informationTwo models of the capacitated vehicle routing problem
Croatian Operational Research Review 463 CRORR 8(2017), 463 469 Two models of the capacitated vehicle routing problem Zuzana Borčinová 1, 1 Faculty of Management Science and Informatics, University of
More informationAn Optimized Virtual Machine Migration Algorithm for Energy Efficient Data Centers
International Journal of Engineering Science Invention (IJESI) ISSN (Online): 2319 6734, ISSN (Print): 2319 6726 Volume 8 Issue 01 Ver. II Jan 2019 PP 38-45 An Optimized Virtual Machine Migration Algorithm
More informationExpected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction
Expected Capacity Guaranteed Routing based on Dynamic Link Failure Prediction Shu Sekigawa, Satoru Okamoto, and Naoaki Yamanaka Department of Information and Computer Science, Faculty of Science and Technology,
More informationExcavation Balance Routing Algorithm Simulation Based on Fuzzy Ant Colony
2018 5th International Conference on Electrical & Electronics Engineering and Computer Science (ICEEECS 2018) Excavation Balance Routing Algorithm Simulation Based on Fuzzy Ant Colony Luo Xiaojuan, Yan
More informationMaximization of Time-to-first-failure for Multicasting in Wireless Networks: Optimal Solution
Arindam K. Das, Mohamed El-Sharkawi, Robert J. Marks, Payman Arabshahi and Andrew Gray, "Maximization of Time-to-First-Failure for Multicasting in Wireless Networks : Optimal Solution", Military Communications
More informationA SDN-like Loss Recovery Solution in Application Layer Multicast Wenqing Lei 1, Cheng Ma 1, Xinchang Zhang 2, a, Lu Wang 2
5th International Conference on Information Engineering for Mechanics and Materials (ICIMM 2015) A SDN-like Loss Recovery Solution in Application Layer Multicast Wenqing Lei 1, Cheng Ma 1, Xinchang Zhang
More informationHigh Capacity Reversible Watermarking Scheme for 2D Vector Maps
Scheme for 2D Vector Maps 1 Information Management Department, China National Petroleum Corporation, Beijing, 100007, China E-mail: jxw@petrochina.com.cn Mei Feng Research Institute of Petroleum Exploration
More informationTree-Based Minimization of TCAM Entries for Packet Classification
Tree-Based Minimization of TCAM Entries for Packet Classification YanSunandMinSikKim School of Electrical Engineering and Computer Science Washington State University Pullman, Washington 99164-2752, U.S.A.
More informationTemporal Bandwidth-Intensive Virtual Network Allocation Optimization in a Data Center Network
Temporal Bandwidth-Intensive Virtual Network Allocation Optimization in a Data Center Network Matthew A. Owens, Deep Medhi Networking Research Lab, University of Missouri Kansas City, USA {maog38, dmedhi}@umkc.edu
More informationNetwork Topology Control and Routing under Interface Constraints by Link Evaluation
Network Topology Control and Routing under Interface Constraints by Link Evaluation Mehdi Kalantari Phone: 301 405 8841, Email: mehkalan@eng.umd.edu Abhishek Kashyap Phone: 301 405 8843, Email: kashyap@eng.umd.edu
More informationNovel Cluster Based Routing Protocol in Wireless Sensor Networks
ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 32 Novel Cluster Based Routing Protocol in Wireless Sensor Networks Bager Zarei 1, Mohammad Zeynali 2 and Vahid Majid Nezhad 3 1 Department of Computer
More informationDouble Threshold Based Load Balancing Approach by Using VM Migration for the Cloud Computing Environment
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:2319-7242 Volume 4 Issue 1 January 2015, Page No. 9966-9970 Double Threshold Based Load Balancing Approach by Using VM Migration
More informationEnhancement of the CBT Multicast Routing Protocol
Enhancement of the CBT Multicast Routing Protocol Seok Joo Koh and Shin Gak Kang Protocol Engineering Center, ETRI, Korea E-mail: sjkoh@pec.etri.re.kr Abstract In this paper, we propose a simple practical
More informationABSTRACT I. INTRODUCTION
2018 IJSRSET Volume 4 Issue 4 Print ISSN: 2395-1990 Online ISSN : 2394-4099 Themed Section : Engineering and Technology An Efficient Search Method over an Encrypted Cloud Data Dipeeka Radke, Nikita Hatwar,
More informationGC-HDCN: A Novel Wireless Resource Allocation Algorithm in Hybrid Data Center Networks
IEEE International Conference on Ad hoc and Sensor Systems 19-22 October 2015, Dallas, USA GC-HDCN: A Novel Wireless Resource Allocation Algorithm in Hybrid Data Center Networks Boutheina Dab Ilhem Fajjari,
More informationComputer Based Image Algorithm For Wireless Sensor Networks To Prevent Hotspot Locating Attack
Computer Based Image Algorithm For Wireless Sensor Networks To Prevent Hotspot Locating Attack J.Anbu selvan 1, P.Bharat 2, S.Mathiyalagan 3 J.Anand 4 1, 2, 3, 4 PG Scholar, BIT, Sathyamangalam ABSTRACT:
More informationOpen Access Research on the Prediction Model of Material Cost Based on Data Mining
Send Orders for Reprints to reprints@benthamscience.ae 1062 The Open Mechanical Engineering Journal, 2015, 9, 1062-1066 Open Access Research on the Prediction Model of Material Cost Based on Data Mining
More informationA Method of Identifying the P2P File Sharing
IJCSNS International Journal of Computer Science and Network Security, VOL.10 No.11, November 2010 111 A Method of Identifying the P2P File Sharing Jian-Bo Chen Department of Information & Telecommunications
More informationA Minimum Cost Handover Algorithm for Mobile Satellite Networks
Chinese Journal of Aeronautics 21(2008) 269-274 Chinese Journal of Aeronautics www.elsevier.com/locate/cja A Minimum Cost Handover Algorithm for Mobile Satellite Networks Zhang Tao*, Zhang Jun School of
More informationAN ASSOCIATIVE TERNARY CACHE FOR IP ROUTING. 1. Introduction. 2. Associative Cache Scheme
AN ASSOCIATIVE TERNARY CACHE FOR IP ROUTING James J. Rooney 1 José G. Delgado-Frias 2 Douglas H. Summerville 1 1 Dept. of Electrical and Computer Engineering. 2 School of Electrical Engr. and Computer
More informationA Mathematical Computational Design of Resource-Saving File Management Scheme for Online Video Provisioning on Content Delivery Networks
A Mathematical Computational Design of Resource-Saving File Management Scheme for Online Video Provisioning on Content Delivery Networks Dr.M.Upendra Kumar #1, Dr.A.V.Krishna Prasad *2, Dr.D.Shravani #3
More informationCombining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating
Combining Review Text Content and Reviewer-Item Rating Matrix to Predict Review Rating Dipak J Kakade, Nilesh P Sable Department of Computer Engineering, JSPM S Imperial College of Engg. And Research,
More informationViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing
ViTAMin: A Virtual Backbone Tree Algorithm for Minimal Energy Consumption in Wireless Sensor Network Routing Jaekwang Kim Department of Electrical and Computer Engineering, Sungkyunkwan University, Suwon,
More informationTOPOLOGY CONTROL IN WIRELESS NETWORKS BASED ON CLUSTERING SCHEME
International Journal of Wireless Communications and Networking 3(1), 2011, pp. 89-93 TOPOLOGY CONTROL IN WIRELESS NETWORKS BASED ON CLUSTERING SCHEME A. Wims Magdalene Mary 1 and S. Smys 2 1 PG Scholar,
More informationmanufacturing process.
Send Orders for Reprints to reprints@benthamscience.ae The Open Automation and Control Systems Journal, 2014, 6, 203-207 203 Open Access Identifying Method for Key Quality Characteristics in Series-Parallel
More informationDesign and Implementation of an Anycast Efficient QoS Routing on OSPFv3
Design and Implementation of an Anycast Efficient QoS Routing on OSPFv3 Han Zhi-nan Yan Wei Zhang Li Wang Yue Computer Network Laboratory Department of Computer Science & Technology, Peking University
More informationOnline Optimization of VM Deployment in IaaS Cloud
Online Optimization of VM Deployment in IaaS Cloud Pei Fan, Zhenbang Chen, Ji Wang School of Computer Science National University of Defense Technology Changsha, 4173, P.R.China {peifan,zbchen}@nudt.edu.cn,
More information