Optimization Algorithms for Data Center Location Problem in Elastic Optical Networks


 Rhoda Snow
 11 months ago
 Views:
Transcription
1 Optimization Algorithms for Data Center Location Problem in Elastic Optical Networks Mirosław Klinkowski 1, Krzysztof Walkowiak 2, and Róża Goścień 2 1 National Institute of Telecommunications, Warsaw, Poland. 2 Wroclaw University of Technology, Wrocław, Poland. ABSTRACT Modern optical networks must meet many challenges following from the quick and permanent development of IT industry. The latest trend that focuses much attention is cloud computing a concept that enables delivery of various IT services over the Internet. From the network perspective, the cloud computing implies a growth of the traffic volume and advent of new traffic patterns. In this work, we combine the cloud computing topic with a new concept of optical networks, namely, Elastic Optical Network (EON), which allows for efficient and scalable bandwidth provisioning. In more detail, we address the problem of data center location with lightpath provisioning in EONs. We focus on optimization algorithms for locating data centers with the objective to minimize the amount of spectrum required to serve anycast demands. We propose effective heuristic algorithms that utilize the wellknown optimization technique called Column Generation. We present results of numerical experiments run on a real topology of an European backbone network. Our heuristics perform well comparing to optimal results provided by the CPLEX solver. Moreover, we report the increase of spectrum requirement in years according to traffic demand patterns generated according to Cisco forecasts. Keywords: Data centers; elastic optical networks; ILP modelling, network planning. 1. INTRODUCTION According to many foresights including Cisco Networking Index and Cisco Global Cloud Index, the most voluminous traffic in the future Internet will be video as well as cloud computing data traffic. Both types of traffic are related to special network sites hosting data centers (DCs) and/or content servers. Data/content is replicated in DCs and a client can connect to the most convenient one (e.g., the nearest), by means of anycast routing, hereby decreasing latency and capacity requirements in the network [1]. Still, it is expected that the emerging network services supported by DCs will consume large amount of bandwidth due to the growing number of users and increasing capacity of demands. Concurrently, Elastic Optical Network (EON) technologies are a promising approach for improving the spectral efficiency and flexibility of optical networks [2]. The use of advanced modulation formats and techniques in bandwidth variable transponders and the operation within flexible frequency grids allows for adaptive bandwidth provisioning in accordance to traffic demands. The second pros of EON is the support for high capacity demands that cannot be transported efficiently in current WDM networks. The elastic and highly scalable bandwidth provisioning of EON architectures is considered one of technological pillars for building effective and costefficient cloud and anycastready transport networks [3]. In EON, the adaptation of modulation levels of transmitted signals according to optical path (i.e., lightpath) characteristics brings significant savings in terms of spectrum utilization. Since the transmission on shorter paths can be performed with higher modulation levels, the aggregated anycast traffic directed towards nearer DCs will require less spectrum resources allocated to lightpath connections [4]. The savings in the spectrum usage can be potentially translated to lower costs of the switching equipment installed in the network. Currently, cloud computing systems and transport networks are managed independently as well as both environments are agnostic of each other. To improve performance of cloudready transport networks it is highly required to enable cooperation between these two environments including, among others, coordinated network planning and design. In a crossstratum optimization approach a new problem arises, namely, where to locate data centers (servers) in EON so that to optimize selected objectives (e.g., spectrum usage). In the paper, we present an Integer Linear Programming (ILP) formulation of the joint problem of data center location with routing and spectrum allocation (DCLRSA) for aggregated anycast traffic demands. Since the RSA problem itself is N Pcomplete [5], we propose several heuristic algorithms to solve it. The DC location problem has been studied in WDM networks [6], however, to the best of our knowledge, it has not been addressed in EON. The remainder of the paper is organized as follows. In Section 2, we formulate the DCLRSA optimization problem. In Section 3, we propose optimization algorithms for solving DCLRSA. In Section 4, we provide numerical results to show the effectiveness of algorithms. Finally, in Section 5, we conclude the work. 2. PROBLEM FORMULATION In this Section, we present an ILP model of an offline problem of Data Centre Location with Routing and Spectrum Allocation (DCLRSA) in an EON with static traffic demands. We take a similar modelling approach as in [7] for formulating the ILP problem.
2 The considered network is modelled as a directed graph G = (N, E), where N denotes the set of nodes and E denotes the set of fiber links connecting two nodes in N. Let set V N denote the set of possible locations of data centers and let K be the number of DCs to be located in the network. A set D of static traffic demands is given and each demand d D is represented by a tuple (o d, h d ), where o d is the origin node and h d is the requested bitrate. We assume anycasting, i.e., every DC provides the same content and each demand can be served by any data center located in the network. A demand is connected to a DC by a lightpath unless a DC is located in the origin node of the demand  in such a case the demand is served locally. We assume a scenario when the DCs provide some content (e.g., video or other multimedia content) and the traffic is delivered from DCs to clients. The traffic in the opposite direction is significantly smaller and is not included in the model. The frequency spectrum, available in each link e E, is represented by an ordered set of frequency slices S = { s 1, s 2,..., s S }. Routing path p is identified with a subset p E and, consequently, p denotes the number of hops. Let t p denote the termination node of path p. Let P d be a set of admissible paths for demand d D. Channel c is defined as a contiguous (adjacent) subset of slices in ordered set S, i.e., c S. Let C dp be a set of admissible channels for demand d on path p P d ; each c C dp provides enough spectrum to support traffic volume h d. Eventually, lightpath l is represented by a tuple (p, c), where p is a routing path and c is a channel. Let L d be a set of admissible lightpaths for demand d; for each l = (p, c) L d we have p P d and c C dp. Let L = d D L d denote the set of all admissible lightpaths. We introduce a set of problem variables: x d = 1 if demand d is routed over the network using a lightpath, and 0 if its origin is in a node with a DC; x l = 1 if lightpath l is established, and 0 otherwise; x es = 1 if slice s S is used in link e E, and 0 otherwise; x s = 1 if slice s S is used in the network, and 0 otherwise; x dv = 1 if demand d is served by DC node v, and 0 otherwise; x v = 1 if a DC is located in node v, and 0 otherwise. The DCLRSA problem is formulated as following: min z = s S x s (1a) [ λ d ] x l = x d d D (1b) l L [ d η dv ] x l = x dv d D, v V (1c) [π es 0] l=(p,c) L d : t p=v d D,l=(p,c) L d : p e,c s x l x es e E, s S (1d) x es x s e E, s S (1e) x d + x v = 1 d D, v = o d (1f) x d, x l, x es, x s, x v, x dv {0, 1}. x v = 0 v N V (1g) x dv x v d D, v V (1h) x v K (1i) v where variables in brackets, i.e, λ d, η dv, and π es, are dual variables. The objective (1a) is to minimize the width of spectrum, expressed as the number of slices, required in the network (as in [5] and [8]). Constraint (1b) assures single path routing and spectrum allocation, i.e., whenever demand d is routed over the network (x d = 1) then exactly one lightpath is selected. Constraint (1c) assures that each demand has its lightpath terminated in a DC node (i.e., for which x dv = 1). Constraints (1d) guarantees that a slice on a particular link can be allocated to at most one lightpath. Constraint (1d) indicates that slice s is used if it is used at least in one link in the network. Equation (1f) assures that a demand is either terminated in its origin node, if the node is equipped with a DC (x v = 1), or is routed over the network (x d = 1). Equation (1g) means that nodes that are not candidate DC nodes cannot be equipped with a DC. Constraint (1h) assures that a DC has to be located in a node in which at least one demand is terminated. Constraint (1i) introduces a limit on the number of DCs located in the network. Finally, (1j) assures that variables are binary. 3. ALGORITHMS In this section, we present several approaches for solving the DCLRSA problem. (1j)
3 1) Joint DCLRSA optimization: A first approach is to run a BranchandBound (BB) algorithm, implemented in an ILP solver, to solve Problem (1). Since formulation (1) is not compact, a set of admissible (candidate) lightpaths L has to be provided; remind that each admissible lightpath in (1) is represented by variable x l. a) BB with complete set of admissible lightpaths: A common and frequently used approach is to include a large set of path selection variables (in our case, variables x l ) in the problem formulation. Set L d, d D, has to be large enough in order to not leave out good (optimal) solutions from the feasible solutions space. Therefore, in the algorithm evaluation in Section 4, for each pair of origin o and termination t nodes we precalculate k = 30 shortest paths and include them in set Q ot. Then P d consists of all paths between the origin of demand d and each possible DC location, i.e., P d = v V Q o d v. Concurrently, C dp includes all admissible channels on path p P d. Eventually, for each demand d, we form the set of all admissible lightpaths L d = {(p, c) : p P d, c C dp } and for each l L d we include variable x l into formulation (1). Since formulation (1) requires set S to be defined, we set S equal to the solution of the DCL+RSA/MSF heuristic algorithm (described in the next subsection), which is an upper bound on DCLRSA. We denote this approach as DCLRSA/BB. b) PriceandBranch (PB) algorithm: In DCLRSA/BB, the number of variables x l may be very large since all possible lightpaths are include into the formulation. Consequently, the solution may be not attainable for larger problem instances. A way to decrease the computational effort is to make use of optimization decomposition methods. Column Generation (CG) is one of the techniques that allows to reduce the amount of variables (referred to as columns) in Linear Programming (LP) formulations [9]. In CG, the problem is initiated with a small, feasible list of admissible columns, which is then extended iteratively with new columns. A key element of CG is to formulate and solve a pricing problem, which concerns finding such a new column that, when included into the problem formulation, it leads to the improvement in the objective function value of the LP problem relaxation. If such column exists, it is included and the pricing problem is solved again, otherwise, the CG procedure is terminated. For demand d, the pricing problem of (1) consists in finding lightpath l = (p, c) terminated in a candidate DC node v V for which the reduced cost calculated as zl d = λ d e p s c πes η dv, using dual variables of formulation (1), is positive (i.e., zl d > 0). In our implementation, in each CG iteration, we check all lightpaths considered in the described above DCLRSA/BB approach and, for each d D, we include into L d the one with the largest positive zl d. The initial, feasible set of columns is obtained by running the DCL+RSA/MSF algorithm. PriceandBranch (PB) is a common heuristic approach which consists in: 1) generating columns (with the CG technique) and, after that, 2) running a BB algorithm for the obtained set of columns. In the remainder, we denote this approach as DCLRSA/PB. 2) Decomposing the problem (DCL+RSA): For large networks the solution of joint DCLRSA optimization problem may be not attainable. Therefore, we break the DCLRSA problem into (i) the data center location (DCL) and (ii) the routing and spectrum allocation (RSA) subproblems and solve them separately. In particular, we find a set of DC nodes with a DCL algorithm and then we run a RSA algorithm so that to provide, for each demand, a lightpath connection to a DC node. a) DCL algorithm: To find a placement of DCs, we solve the following ILP problem: min z = d D v V,v o d C dv x dv v V x dv = 1 d D (2a) x dv x v d D, v V (2b) x v R (2c) v x v, x dv {0, 1}. where C dv denotes the cost of connecting demand d to node v. The objective of Problem (2) is to minimize the overall cost of serving all demands. Constraint (2a) assures that each demand is connected to a DC node. Constraint (2b) assures that a DC is located in node v whenever at least one demand is connected to this node. The maximum number of DCs located in the network is limited by constraint (2c). Eventually, (2d) assures that variables are binary. We consider three options for calculating C dv, namely: minl: as the length of the shortest physical path (denoted as p dv ) between nodes o d and v (in km), mins: as the width of an admissible channel on path p dv for demand d, minsl: as the product of the width of an admissible channel on path p dv and the number of hops of p dv. If not mentioned otherwise, in the evaluation Section we apply the minsl option. (2d)
4 TABLE I COMPARISON OF ALGORITHM PERFORMANCE; T IN SECONDS. Scenario DCL+RSA/MSF DCL+RSA/PB DCLRSA/PB DCLRSA/BB Year D K S T L S T L S T L S T , (60% gap) > 12h , , , , , , (34% gap) > 12h , , , , , , , , (42% gap) > 12h b) RSA algorithms: In our study, we analyse the following two RSA algorithms: Most Spectrum First (MSF)  the algorithm is based on a greedy heuristic presented in [8]. In MSF, the demands are processed onebyone in a decreasing order of the size of requested spectrum. For each demand, a lightpath allocating the lowest possible slice index is selected from a set of precalculated lightpaths; in evaluation, we consider the same set of lightpaths as in DCLRSA/BB. Since in our problem the demand volumes are expressed in terms of bitrates, when ordering the demands we take into account the amount of spectrum that would be required on the shortest routing path to the nearest DC in the network. RSA with PriceandBranch  similarly as in DCLRSA/PB, we generate columns and then run a BB algorithm. Note that since the DC nodes are given (by the DCL phase), x v variables are fixed in formulation (1) and, as a consequence, the formulation converts to an RSA formulation with anycast routing. By combining the above DCL and RSA algorithms, we obtain two methods for providing solutions to DCLRSA, namely, DCL+RSA/MSF and DCL+RSA/PB. 4. NUMERICAL RESULTS In this Section, we evaluate the algorithms presented in Section 3. The evaluation is performed for EURO28 (28 nodes, 82 links) network topology (see Fig. 1a)). We investigate several scenarios referring to different numbers of data centers and different traffic damands. We analyze K {1, 3, 5} and we consider each network node is a candidate DC node. Demands are created for period using the CAGR (Compounded Annual Growth Rate) of 31% under the forecast presented in Cisco Global Cloud Index report. We assume that the starting overall volume in year 2012 is 1 Tbps. As in [10], this overall volume is split among network nodes, representing cities, according to a multivariable gravity model that takes into account the population and GPD (Gross Domestic Product) of the country the city belongs to. It should be noted that the population denotes not the particular city population but the population of the region that the city covers (e.g., country). If the obtained demand exceeds the value of 400 Gbps, it is divided proportionally into smaller demands. We apply the half distance law of [11] for calculating the channel width of a lightpath. In particular, the spectral efficiency (SE) depends on the routing path length (L) and it is equal to 1, 2, 3, and 4, respectively, for L less or equal to 3000 km, 1500 km, 750 km, and 375 km (as in [8]). For L > 3000 km, we consider SE = 0.8. Without loss of generality, we neglect the presence of guard bands separating two spectrum adjacent connections. We assume the frequency slice width is equal to s = 12.5 GHz. Consequently, the requested number of slices for a lightpath for demand d is calculated as n = h d /SE s. In Table I, we compare the algorithm performance. We report the objective value (S, i.e., the number of slices), computation times (T ), and the number of admissible columns (lightpaths), denoted as L. We can see that DCLRSA/BB, which involves a common BBbased approach for solving ILP problems, allows us to solve only small problem instances (with smaller demands) in moderate times (below 12 hours). The increase of traffic demands in subsequent years leads to the increase of spectrum requirements in the network (S). As a result, the number of x s and x es variables and, consequently, x l variables in formulation (1) increases. We can also see that the use of column generation in both DCLRSA/PB and DCL+RSA/PB approaches allows to reduce considerably the number of columns ( L ) when comparing to DCLRSA/BB and, by these means, to provide solutions for larger problem instances. Still, the PB approach achieves results close to the optimal ones. Moreover, the DCL+RSA decomposition of the problem, especially in the case of DCL+RSA/PB, provides good results in shorter times than in DCLRSA/PB. The difference between joint DCLRSA and decomposed DCL+RSA approaches is more pronounced in the scenarios with lower number of DCs and higer traffic demands.
5 Figure 1. a) EURO28 topology (link length in km); b)c) Comparison of cost functions in DCL. In Fig. 1b) and c) we focus on a comparison of different cost functions that can be used in the DCL heuristic algorithm. The results correspond to the number of slices (S) optimized with the DCL+RSA/PB algorithm. We can see that in both scenarios with 3 and 5 DCs the optimization based only on the physical distance between origin and DC nodes (i.e., minl) leads to worst results. As a conclusion, when optimizing spectrum usage in the network, the placement of DCs should also take into account spectrum requirements of lightpath connections. 5. CONCLUSIONS The main challenge in the application of anycasting in transport networks supporting the cloud computing traffic is that usually the data centers and network operators operate independently as separate business parties. Therefore, a multilayer oriented network management and crossstrata capabilities are indispensable to make anycasting efficient in cloud computing scenarios In this paper, we have addressed the problem of data center location with lightpath provisioning in Elastic Optical Networks. In particular, we have formulated an offline optimization problem in the form of the ILP model and proposed several heuristic algorithms to solve it. The default ILP solution method, i.e., Branchand Bound algorithm, in most cases has not been able to provide feasible solutions in a very long execution time (> 12 hours). However, the proposed heuristic algorithms making use of a Column Generation technique have yielded feasible and good (close to optimal) results for all experiments in relatively low time. The involvement of traffic demands when taking a decision regarding the data center placement (as in our DCLRSA problem formulation) may lead to different results in different years since traffic volumes are subject to change. Therefore, such optimization should be performed jointly for a number of consecutive time periods. The formulation and solution of such a problem is left for further study. ACKNOWLEDGMENTS This work has been supported by the Polish National Science Centre under grant agreement DEC2011/01/D/ ST7/05884 and grant Algorithms for optimization of routing and spectrum allocation in content oriented elastic optical networks which is being realized in years REFERENCES [1] Q. Zhang et al., Cloud computing: stateoftheart and research challenges, Journal of Internet Services and Applications, vol. 1, no. 1, pp. 7 18, [2] O. Gerstel et al., Elastic optical networking: A new dawn for the optical layer? IEEE Comm. Mag., vol. 50, no. 2, pp , [3] L. Contreras et al., Toward cloudready transport networks, IEEE Comm. Mag., vol. 50, no. 9, [4] K. Walkowiak and M. Klinkowski, Joint anycast and unicast routing for elastic optical networks: Modeling and optimization, in Proc. ICC, Budapest, Hungary, [5] M. Klinkowski and K. Walkowiak, Routing and spectrum assignment in spectrum sliced elastic optical path network, IEEE Commun. Lett., vol. 15, no. 8, pp , [6] B. Jaumard et al., Selecting the best locations for data centers in resilient optical grid/cloud dimensioning, in Proc. of IEEE ICTON, Coventry, England, [7] L. Velasco et al., Modeling the routing and spectrum allocation problem for flexgrid optical networks, Phot. Netw. Commun., vol. 24, no. 3, pp , [8] K. Christodoulopoulos et al., Elastic bandwidth allocation in flexible OFDM based optical networks, IEEE J. Lightw. Technol., vol. 29, no. 9, pp , [9] M. Pióro and D. Medhi, Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann, [10] A. Deore et al., Total cost of ownership of WDM and switching architectures for nextgeneration 100Gb/s networks, IEEE Comm. Mag., vol. 50, no. 11, pp , [11] A. Bocoi et al., Reachdependent capacity in optical networks enabled by OFDM, in Proc. of OFC, San Diego, USA, 2009.
On Efficient Protection Design for Dynamic Multipath Provisioning in Elastic Optical Networks
On Efficient Protection Design for Dynamic Multipath Provisioning in Elastic Optical Networks Xiaoliang Chen, Shilin Zhu,DiChen, Shuguang Hu, Chang Li, Zuqing Zhu School of Information Science and Technology,
More informationSelection of SpectralSpatial Channels in SDM Flexgrid Optical Networks
Selection of SpectralSpatial Channels in SDM Flexgrid Optical Networks Piotr Lechowicz, Krzysztof Walkowiak, Mirosław Klinkowski Department of Systems and Computer Networks, Wrocław University of Science
More informationSelection of SpectralSpatial Channels in SDM Flexgrid Optical Networks
Selection of SpectralSpatial Channels in SDM Flexgrid Optical Networks Piotr Lechowicz, Krzysztof Walkowiak Wroclaw University of Science and Technology Mirosław Klinkowski ENGINE Centre and National
More informationHow to overcome the capacity crunch new challenges in optical networks
How to overcome the capacity crunch new challenges in optical networks Krzysztof Walkowiak Department of Systems and Computer Networks Wroclaw University of Technology, Wrocław, Poland February 4, 2016,
More informationELASTIC optical networking has been the subject of considerable
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 33, NO. 1, JANUARY 1, 2015 151 On Routing and Spectrum Assignment in Rings Sahar Talebi, Evripidis Bampis, Giorgio Lucarelli, Iyad Katib, and George N. Rouskas Abstract
More informationA Network Optimization Model for MultiLayer IP/MPLS over OTN/DWDM Networks
A Network Optimization Model for MultiLayer IP/MPLS over OTN/DWDM Networks Iyad Katib and Deep Medhi Computer Science & Electrical Engineering Department University of MissouriKansas City, USA {IyadKatib,
More informationSplitter Placement in AllOptical WDM Networks
plitter Placement in AllOptical WDM Networks HwaChun Lin Department of Computer cience National Tsing Hua University Hsinchu 3003, TAIWAN hengwei Wang Institute of Communications Engineering National
More informationIO2654 Optical Networking. WDM network design. Lena Wosinska KTH/ICT. The aim of the next two lectures. To introduce some new definitions
IO2654 Optical Networking WDM network design Lena Wosinska KTH/ICT 1 The aim of the next two lectures To introduce some new definitions To make you aware about the tradeoffs for WDM network design To
More informationIterative Optimization in VTD to Maximize the Open Capacity of WDM Networks
Iterative Optimization in VTD to Maximize the Open Capacity of WDM Networks Karcius D.R. Assis, Marcio S. Savasini and Helio Waldman DECOM/FEEC/UNICAMP, CP. 6101, 13083970 Campinas, SPBRAZIL Tel: +551937883793,
More informationCrosstalkAware Spectrum Defragmentation based on Spectrum Compactness in SDMEON
CrosstalkAware Spectrum Defragmentation based on Spectrum Compactness in SDMEON Yongli Zhao State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications
More informationA Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing
A Heuristic Algorithm for Designing Logical Topologies in Packet Networks with Wavelength Routing Mare Lole and Branko Mikac Department of Telecommunications Faculty of Electrical Engineering and Computing,
More informationLink Selection Algorithms for LinkBased ILPs and Applications to RWA in Mesh Networks
Link Selection Algorithms for LinkBased ILPs and Applications to RWA in Mesh Networks Zeyu Liu, George N. Rouskas Department of Computer Science, North Carolina State University, Raleigh, NC 276958206,
More informationDesign of CapExEfficient IPoverWDM Network using Auxiliary Matrix based Heuristic
IEEE ANTS 2014 1570023335 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 60 61 62 63 64
More informationInteruniversity Master in Statistics and Operations Research
Interuniversity Master in Statistics and Operations Research Title: Column generation algorithm for flexgrid optical network problems Author: David Rebolo Pérez Advisor: Luis Velasco Esteban CoAdvisor:
More informationDynamic Wavelength Assignment for WDM AllOptical Tree Networks
Dynamic Wavelength Assignment for WDM AllOptical Tree Networks Poompat Saengudomlert, Eytan H. Modiano, and Robert G. Gallager Laboratory for Information and Decision Systems Massachusetts Institute of
More informationOPTICAL Burst Switching has attracted considerable. Joint Routing and Wavelength Allocation subject to Absolute QoS Constraints in OBS Networks
1 Joint Routing and Wavelength Allocation subject to Absolute QoS Constraints in OBS Networks Mirosław Klinkowski, Pedro Pedroso, Davide Careglio, Michał Pióro, and Josep SoléPareta Abstract From the
More informationJOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 31, NO. 1, JANUARY 1,
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 31, NO. 1, JANUARY 1, 2013 15 Dynamic Service Provisioning in Elastic Optical Networks With Hybrid Single/MultiPath Routing Zuqing Zhu, Senior Member, IEEE, Wei
More informationOPTICAL NETWORKS. Optical Metro Networks. A. Gençata İTÜ, Dept. Computer Engineering 2005
OPTICAL NETWORKS Optical Metro Networks A. Gençata İTÜ, Dept. Computer Engineering 2005 Introduction Telecommunications networks are normally segmented in a threetier hierarchy: Access, metropolitan,
More informationVirtualPodAssisted Routing and Resource Assignment in Elastic AllOptical Intra Datacenter Networks
VirtualPodAssisted Routing and Resource Assignment in Elastic AllOptical Intra Datacenter Networks Speaker: Lin Wang Peng, L et al, VirtualPodAssisted Routing and Resource Assignment in Elastic AllOptical
More informationBit Index Explicit Replication (BIER) Multicasting in Transport Networks [Invited]
Bit Index Explicit Replication (BIER) Multicasting in Transport Networks [Invited] A. Giorgetti, A. Sgambelluri, F. Paolucci, N. Sambo, P. Castoldi Scuola Superiore Sant Anna Pisa, Italy Email: a.giorgetti@santannapisa.it
More informationOPTICAL NETWORKS. Virtual Topology Design. A. Gençata İTÜ, Dept. Computer Engineering 2005
OPTICAL NETWORKS Virtual Topology Design A. Gençata İTÜ, Dept. Computer Engineering 2005 Virtual Topology A lightpath provides singlehop communication between any two nodes, which could be far apart in
More informationTHE rising number of Internet users and advanced applications
1 IP/MPLSoverOTNoverDWDM Multilayer Networks: An Integrated ThreeLayer Capacity Optimization Model, a Heuristic, and a Study Iyad Katib, Member, IEEE, and Deep Medhi, Senior Member, IEEE Abstract
More informationResilient Networks. 3.1 Resilient Network Design  Intro. Mathias Fischer
Mathias Fischer Resilient Networks. Resilient Network Design  Intro Prepared along: Michal Pioro and Deepankar Medhi  Routing, Flow, and Capacity Design in Communication and Computer Networks, The Morgan
More informationEnergy Efficiency Analysis for Dynamic Routing in Optical Transport Networks
Downloaded from orbit.dtu.dk on: Mar 02, 2018 Energy Efficiency Analysis for Dynamic Routing in Optical Transport Networks Vizcaíno, Jorge López; Ye, Yabin; Tafur Monroy, Idelfonso Published in: 2012 IEEE
More informationA RowandColumn Generation Method to a Batch Machine Scheduling Problem
The Ninth International Symposium on Operations Research and Its Applications (ISORA 10) ChengduJiuzhaigou, China, August 19 23, 2010 Copyright 2010 ORSC & APORC, pp. 301 308 A RowandColumn Generation
More informationA BranchandCut Algorithm for the Partition Coloring Problem
A BranchandCut Algorithm for the Partition Coloring Problem Yuri Frota COPPE/UFRJ, Programa de Engenharia de Sistemas e Otimização Rio de Janeiro, RJ 21945970, Brazil abitbol@cos.ufrj.br Nelson Maculan
More informationOffline DistanceAdaptive Routing and Spectrum Assignment (DARSA) in Rings
Offline DistanceAdaptive Routing and Spectrum Assignment (DARSA) in Rings Sahar Talebi, Iyad Katib, George N. Rouskas Operations Research and Department of Computer Science, North Carolina State University,
More informationDegree in Mathematics
Degree in Mathematics Title: Incremental capacity planning in flexgrid optical networks Author: Fernando Morales Alcaide Advisor: Luis Velasco Esteban CoAdvisor: Marc Ruiz Ramírez Department: Computers
More informationImpact of IP Layer Routing Policy on MultiLayer Design [Invited]
> REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLECLICK HERE TO EDIT) < 1 Impact of IP Layer Routing Policy on MultiLayer Design [Invited] E. Palkopoulou, O. Gerstel, I. Stiakogiannakis,
More informationIncreasing traffic volume and growing heterogeneity of
1 Impact of Wavelength and Modulation Conversion on Transluscent Elastic Optical Networks Using MILP X. Wang, M. BrandtPearce and S. Subramaniam arxiv:11.6v1 [cs.ni] 7 Dec 1 Abstract Compared to legacy
More informationCAPEX Study for a Multilayer IP/MPLSOverFlexgrid Optical Network
Pedrola et al. VOL. 4, NO. 9/SEPTEMBER 2012/J. OPT. COMMUN. NETW. 1 CAPEX Study for a Multilayer IP/MPLSOverFlexgrid Optical Network O. Pedrola, A. Castro, L. Velasco, M. Ruiz, J. P. FernándezPalacios,
More informationDesigning WDM Optical Networks using BranchandPrice
Designing WDM Optical Networks using BranchandPrice S. Raghavan Smith School of Business & Institute for Systems Research University of Maryland College Park, MD 20742 raghavan@umd.edu Daliborka Stanojević
More informationWavelengthSwitched to FlexGrid Optical Networks
Book Chapter ReviewEvolution from WavelengthSwitched to FlexGrid Optical Networks Tanjila Ahmed Agenda ØObjective ØIdentifying the Problem ØSolution: FlexGrid Network ØFixedgrid DWDM Architecture
More informationGateway Placement for Latency and Energy Efficient Data Aggregation
Gateway Placement for Latency and Energy Efficient Data Aggregation Jennifer L. Wong, Roozbeh Jafari, Miodrag Potkonjak University of California, Los Angeles Computer Science Department {jwong,rjafari,midorag}@cs.ucla.edu
More informationConstruction of MinimumWeight Spanners Mikkel Sigurd Martin Zachariasen
Construction of MinimumWeight Spanners Mikkel Sigurd Martin Zachariasen University of Copenhagen Outline Motivation and Background MinimumWeight Spanner Problem Greedy Spanner Algorithm Exact Algorithm:
More informationOptimal Workload Allocation in FogCloud Computing Toward Balanced Delay and Power Consumption
Optimal Workload Allocation in FogCloud Computing Toward Balanced Delay and Power Consumption Ruilong Deng 1,4, Rongxing Lu 1, Chengzhe Lai 2, Tom H. Luan 3, and Hao Liang 4 1: Nanyang Technological University,
More informationHSM: A Hybrid Streaming Mechanism for Delaytolerant Multimedia Applications Annanda Th. Rath 1 ), Saraswathi Krithivasan 2 ), Sridhar Iyer 3 )
HSM: A Hybrid Streaming Mechanism for Delaytolerant Multimedia Applications Annanda Th. Rath 1 ), Saraswathi Krithivasan 2 ), Sridhar Iyer 3 ) Abstract Traditionally, Content Delivery Networks (CDNs)
More informationIEEE TRANS. ON NETWORK AND SERVICE MANAGEMENT, SPECIAL ISSUE ON ADVANCES IN MANAGEMENT OF SOFTWARIZED NETWORKS 1
IEEE TRANS. ON NETWORK AND SERVICE MANAGEMENT, SPECIAL ISSUE ON ADVANCES IN MANAGEMENT OF SOFTWARIZED NETWORKS 1 Towards a Cost Optimal Design for a G Mobile Core Network based on SDN and NFV Arsany Basta,
More informationOptical considerations for nextgeneration
Optical considerations for nextgeneration network Inder Monga Executive Director, ESnet Division Director, Scientific Networking Lawrence Berkeley National Lab 9 th CEF Networks Workshop 2017 September
More informationAdaptive Weight Functions for Shortest Path Routing Algorithms for MultiWavelength Optical WDM Networks
Adaptive Weight Functions for Shortest Path Routing Algorithms for MultiWavelength Optical WDM Networks Tibor FabryAsztalos, Nilesh Bhide and Krishna M. Sivalingam School of Electrical Engineering &
More informationDesign of LargeScale Optical Networks Λ
Design of LargeScale Optical Networks Λ Yufeng Xin, George N. Rouskas, Harry G. Perros Department of Computer Science, North Carolina State University, Raleigh NC 27695 Email: fyxin,rouskas,hpg@eos.ncsu.edu
More informationAbsolute QoS Differentiation in Optical BurstSwitched Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 22, NO. 9, NOVEMBER 2004 1781 Absolute QoS Differentiation in Optical BurstSwitched Networks Qiong Zhang, Student Member, IEEE, Vinod M. Vokkarane,
More informationA New Architecture for Multihop Optical Networks
A New Architecture for Multihop Optical Networks A. Jaekel 1, S. Bandyopadhyay 1 and A. Sengupta 2 1 School of Computer Science, University of Windsor Windsor, Ontario N9B 3P4 2 Dept. of Computer Science,
More informationPerformance of Optical Burst Switching Techniques in MultiHop Networks
Performance of Optical Switching Techniques in MultiHop Networks ByungChul Kim *, YouZe Cho *, JongHyup Lee **, YoungSoo Choi **, and oug Montgomery * * National Institute of Standards and Technology,
More informationA Review of Traffic Management in WDM Optical Networks: Progress and Challenges
www.ijecs.in International Journal Of Engineering And Computer Science ISSN:23197242 Volume 6 Issue 8 August 2017, Page No. 2230922313 Index Copernicus value (2015): 58.10 DOI: 10.18535/ijecs/v6i8.13
More informationOptical networking technology
1 Optical networking technology Technological advances in semiconductor products have essentially been the primary driver for the growth of networking that led to improvements and simplification in the
More informationDelayminimal Transmission for Energy Constrained Wireless Communications
Delayminimal Transmission for Energy Constrained Wireless Communications Jing Yang Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, M0742 yangjing@umd.edu
More informationToward a Reliable Data Transport Architecture for Optical BurstSwitched Networks
Toward a Reliable Data Transport Architecture for Optical BurstSwitched Networks Dr. Vinod Vokkarane Assistant Professor, Computer and Information Science CoDirector, Advanced Computer Networks Lab University
More informationINTRODUCING THE 5GPPP 5GXHAUL PROJECT
INTRODUCING THE 5GPPP 5GXHAUL PROJECT Anna Tzanakaki (University of Bristol, NKUA) Bristol 5G city testbed with 5GXHaul extensions www.5gxhaulproject.eu 1. CONSORTIUM OVERVIEW IHP GmbH (Coordinator)
More informationRiskAware Rapid Data Evacuation for Large Scale Disasters in Optical Cloud Networks
RiskAware Rapid Data Evacuation for Large Scale Disasters in Optical Cloud Networks Presenter: Yongcheng (Jeremy) Li PhD student, School of Electronic and Information Engineering, Soochow University,
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationGMPLS control plane extensions in support of flexgrid enabled elastic optical networks
Downloaded from orbit.dtu.dk on: Feb 08, 2018 GMPLS control plane extensions in support of flexgrid enabled elastic optical networks Turus, Ioan; Fagertun, Anna Manolova; Dittmann, Lars Published in:
More informationEnhancing Cloud Resource Utilisation using Statistical Analysis
Institute of Advanced Engineering and Science International Journal of Cloud Computing and Services Science (IJCLOSER) Vol.3, No.1, February 2014, pp. 1~25 ISSN: 20893337 1 Enhancing Cloud Resource Utilisation
More informationJoint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hopbyhop forwarding
Joint routing and scheduling optimization in arbitrary ad hoc networks: Comparison of cooperative and hopbyhop forwarding Antonio Capone, Stefano Gualandi and Di Yuan Linköping University Post Print
More informationAGILE OPTICAL NETWORK (AON) CORE NETWORK USE CASES
AGILE OPTICAL NETWORK (AON) CORE NETWORK USE CASES PAOLO FOGLIATA  EMEA IP Transport, Director Optical Networking Dec 3, 2014 1830 PSS MARKET MOMENTUM 100G DEPLOYMENTS ACCELERATE 300+/WEEK 400 Manufactured
More informationNext Generation Requirements for DWDM network
Next Generation Requirements for DWDM network Roman Egorov Verizon Laboratories May 3, 2011 Verizon copyright 2011. NG Requirements for DWDM network: Outline Optical Transport Network Metro vs. LongHaul
More informationA Wavelength Sharing and Assignment Heuristic to Minimize the Number of Wavelength Converters in Resilient WDM Networks
A Wavelength Sharing and Assignment Heuristic to Minimize the Number of Wavelength Converters in Resilient WDM Networks Shreejith Billenahalli, Miguel Razo, Wanjun Huang, Arularasi Sivasankaran, Limin
More informationAssignment 3b: The traveling salesman problem
Chalmers University of Technology MVE165 University of Gothenburg MMG631 Mathematical Sciences Linear and integer optimization Optimization with applications Emil Gustavsson Assignment information AnnBrith
More informationAutomatic Service and Protection Path Computation  A Multiplexing Approach
Automatic Service and Protection Path Computation  A Multiplexing Approach Loay Alzubaidi 1, Ammar El Hassan 2, Jaafar Al Ghazo 3 1 Department of Computer Engineering & Science, Prince Muhammad bin Fahd
More informationBandwidth Aware Routing Algorithms for NetworksonChip
1 Bandwidth Aware Routing Algorithms for NetworksonChip G. Longo a, S. Signorino a, M. Palesi a,, R. Holsmark b, S. Kumar b, and V. Catania a a Department of Computer Science and Telecommunications Engineering
More information1152 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 28, NO. 8, APRIL 15, 2010
1152 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 28, NO. 8, APRIL 15, 2010 Joint Online Routing, Wavelength Assignment and Regenerator Allocation in Translucent Optical Networks Konstantinos Manousakis, Panagiotis
More informationEnergy Efficient Cloud Computing: Challenges and Solutions
Energy Efficient Cloud Computing: Challenges and Solutions Burak Kantarci and Hussein T. Mouftah School of Electrical Engineering and Computer Science University of Ottawa Ottawa, ON, Canada Outline PARTI:
More informationDesign of Logical Topologies in WavelengthRouted IP Networks
DESIGN OF LOGICAL TOPOLOGIES... 1 Design of Logical Topologies in WavelengthRouted IP Networks M.Ajmone Marsan ½ A.Grosso ¾, E.Leonardi ½, M.Mellia ½, A.Nucci ½ ½ Dipartimento di Elettronica  Politecnico
More informationCapacity planning and.
Some economical principles Hints on capacity planning (and other approaches) Andrea Bianco Telecommunication Network Group firstname.lastname@polito.it http://www.telematica.polito.it/ Assume users have
More informationREVIEW ON WDM AND TDM PON USING DIFFERENT CODING SCHEMES FOR EXTENDED REACH
REVIEW ON WDM AND TDM PON USING DIFFERENT CODING SCHEMES FOR EXTENDED REACH Pallavi Katna 1, Anu Sheetal 2 1,2 Guru Nanak Dev University, Regional Campus, Gurdaspur (Punjab) ABSTRACT Telecommunication
More informationMorphological Image Processing
Morphological Image Processing Morphology Identification, analysis, and description of the structure of the smallest unit of words Theory and technique for the analysis and processing of geometric structures
More informationStretchOptimal Scheduling for OnDemand Data Broadcasts
StretchOptimal Scheduling for OnDemand Data roadcasts Yiqiong Wu and Guohong Cao Department of Computer Science & Engineering The Pennsylvania State University, University Park, PA 6 Email: fywu,gcaog@cse.psu.edu
More informationBT Connect Networks that think Optical Connect UK
BT Connect Networks that think Optical Connect UK Fast, reliable, secure and affordable Connecting the heart of your organisation Your organisation and its people rely on its applications email, databases,
More informationIEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 3, MARCH
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 3, MARCH 2016 1907 Joint Flow Routing and DoF Allocation in Multihop MIMO Networks Xiaoqi Qin, Student Member, IEEE, Xu Yuan, Student Member,
More informationThe path toward CRAN and VRAN: benefits and challenges from operator perspective
TELECOM ITALIA GROUP 5G World Summit London, 2930 June 2016 : benefits and challenges from operator perspective Marco Caretti Telecom Italia Engineering & TiLAB Agenda The drivers for the RAN evolution
More informationPerformance Analysis on Various Wavelength Assignment Algorithms with Traffic Grooming
Proc. of Int. Conf. on Emerging Trends in Engineering and Technology Performance Analysis on Various Wavelength Assignment Algorithms with Traffic Grooming Vikas Kaushik 1, R.S Chauhan 2 1 JMIT Radaur/ECE
More informationData Caching in Networks with Reading, Writing and Storage Costs
Data Caching in Networks with Reading, Writing and Storage Costs Bin Tang a, Himanshu Gupta b a Department of Electrical Engineering and Computer Science, Wichita State University, Wichita, KS 67260 b
More informationWIRELESS MESH NETWORKs (WMNs) are comprised
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 17, NO. 1, FEBRUARY 2009 267 A Channel and Rate Assignment Algorithm and a Layer2.5 Forwarding Paradigm for MultiRadio Wireless Mesh Networks Stefano Avallone,
More informationSolving the Euclidean Steiner Tree Problem in nspace
Solving the Euclidean Steiner Tree Problem in nspace Marcia Fampa (UFRJ), Jon Lee (U. Michigan), and Wendel Melo (UFRJ) January 2015 Marcia Fampa, Jon Lee, Wendel Melo Solving the Euclidean Steiner Tree
More informationDiscrete Optimization with Decision Diagrams
Discrete Optimization with Decision Diagrams J. N. Hooker Joint work with David Bergman, André Ciré, Willem van Hoeve Carnegie Mellon University Australian OR Society, May 2014 Goal Find an alternative
More informationReversing Ticket Based Probing Routing Protocol for MANET
Reversing Ticket Based Probing Routing Protocol for MANET TURGUT YUCEL and MIN SONG Department of Electrical and Computer Engineering Old Dominion University Norfolk, VA 23529 U.S.A. http://www.odu.edu/networking
More informationLID Assignment In InfiniBand Networks
LID Assignment In InfiniBand Networks Wickus Nienaber, Xin Yuan, Member, IEEE and Zhenhai Duan, Member, IEEE Abstract To realize a path in an InfiniBand network, an address, known as Local IDentifier (LID)
More informationNetwork Virtualization for Future Internet Research
Network Virtualization for Future Internet Research Mauro Campanella  GARR On behalf of the FEDERICA project Internet2 Fall Meeting New Orleans, October 14th, 2008 Agenda FEDERICA at a glance, vision
More information15.083J Integer Programming and Combinatorial Optimization Fall Enumerative Methods
5.8J Integer Programming and Combinatorial Optimization Fall 9 A knapsack problem Enumerative Methods Let s focus on maximization integer linear programs with only binary variables For example: a knapsack
More informationRollout Algorithms for Integrated Topology Control and Routing in Wireless Optical Backbone Networks. by Abhishek Kashyap, Kwangil Lee, Mark Shayman
TECHNICAL RESEARCH REPORT Rollout Algorithms for Integrated Topology Control and Routing in Wireless Optical Backbone Networks by Abhishek Kashyap, Kwangil Lee, Mark Shayman TR 200351 I R INSTITUTE FOR
More informationOptimization solutions for the segmented sum algorithmic function
Optimization solutions for the segmented sum algorithmic function ALEXANDRU PÎRJAN Department of Informatics, Statistics and Mathematics RomanianAmerican University 1B, Expozitiei Blvd., district 1, code
More information3 NoWait Job Shops with Variable Processing Times
3 NoWait Job Shops with Variable Processing Times In this chapter we assume that, on top of the classical nowait job shop setting, we are given a set of processing times for each operation. We may select
More informationHigh Assurance Communication Technique for. Autonomous File Sharing Community
High Assurance Communication Technique for Autonomous File Sharing Community Khaled Ragab, Takanori Ono and Kinji Mori Tokyo Institute of Technology 2121 Ookayama, Meguro, Tokyo 1528552 Tel: +81357342664,
More informationRollout Algorithms for Logical Topology Design and Traffic Grooming in Multihop WDM Networks
Rollout Algorithms for Logical Topology Design and Traffic Grooming in Multihop WDM Networks Kwangil Lee Department of Electrical and Computer Engineering University of Texas, El Paso, TX 79928, USA. Email:
More informationTrends in Data Centre
Trends in Data Centre The impact on the IT infrastructure Thomas Ko Product Manager Market Situation Standards Update and Topology 40G and 100G Ethernet  Impact on IT Cabling Migration Options with Fiber
More informationSpare Capacity Allocation Using Shared Backup Path Protection for Dual Link Failures
Spare Capacity Allocation Using Shared Backup Path Protection for Dual Link Failures Victor Yu Liu David Tipper Huawei Technologies, Boston, Massachusetts, USA Email: yuliu@ieee.org Graduate Telecommunications
More informationModel and Algorithms for the Density, Coverage and Connectivity Control Problem in Flat WSNs
Model and Algorithms for the Density, Coverage and Connectivity Control Problem in Flat WSNs Flávio V. C. Martins, cruzeiro@dcc.ufmg.br Frederico P. Quintão, fred@dcc.ufmg.br Fabíola G. Nakamura fgnaka@dcc.ufmg.br,fabiola@dcc.ufam.edu.br
More informationPower Efficient Traffic Grooming in Optical WDM Networks
Power Efficient Traffic Grooming in Optical WDM Networks Emre Yetginer Tubitak UEKAE Ilhan Tan Kislasi Umitkoy, Ankara 06800 Turkey Email: emre.yetginer@iltaren.tubitak.gov.tr George N. Rouskas Department
More informationCTO s cloud(y) agenda Clouds on CTO s heaven?
CTO s cloud(y) agenda Clouds on CTO s heaven? Cloud computing is one of the most advertised technological trends and its discussion mainly focuses on cost efficiency aspects of IT infrastructures. This
More informationTransport Performance Evaluation of an ATMbased UMTS Access Network
Transport Performance Evaluation of an based US Access Network Nikos H. Loukas, Christos K. Xenakis, Lazaros Merakos University of Athens, Department of Informatics, Communication Networks Laboratory
More informationAdvanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret
Advanced Algorithms Class Notes for Monday, October 23, 2012 Min Ye, Mingfu Shao, and Bernard Moret Greedy Algorithms (continued) The best known application where the greedy algorithm is optimal is surely
More informationMulticast OLSP Establishment Scheme in OVPN over IP/GMPLS over DWDM
Multicast OLSP Establishment Scheme in OVPN over IP/GMPLS over DWDM JeongMi Kim 1, OhHan Kang 2, JaeIl Jung 3, and SungUn Kim 1,4 1 Pukyong National University, 5991 Daeyeon 3Dong NamGu, Busan,
More informationDiversity Coloring for Distributed Storage in Mobile Networks
Diversity Coloring for Distributed Storage in Mobile Networks Anxiao (Andrew) Jiang and Jehoshua Bruck California Institute of Technology Abstract: Storing multiple copies of files is crucial for ensuring
More informationInsensitive Traffic Splitting in Data Networks
Juha Leino and Jorma Virtamo. 2005. Insensitive traffic splitting in data networs. In: Proceedings of the 9th International Teletraffic Congress (ITC9). Beijing, China, 29 August 2 September 2005, pages
More informationα Coverage to Extend Network Lifetime on Wireless Sensor Networks
Noname manuscript No. (will be inserted by the editor) α Coverage to Extend Network Lifetime on Wireless Sensor Networks Monica Gentili Andrea Raiconi Received: date / Accepted: date Abstract An important
More informationCopyrights IEEE 2016 This is the accepted version of the invited paper entitled A Survey of Multilayer Network Optimization
Accepted version of the manuscript submitted to the 20 th International Conference on Optical Network Design and Modelling (ONDM), May 2016. Copyrights IEEE 2016 This is the accepted version of the invited
More informationGeneralized Network Flow Programming
Appendix C Page Generalized Network Flow Programming This chapter adapts the bounded variable primal simplex method to the generalized minimum cost flow problem. Generalized networks are far more useful
More informationStrategy for SWITCH's next generation optical network
Strategy for SWITCH's next generation optical network Terena Network Architecture Workshop 2012 Felix Kugler, Willi Huber felix.kugler@switch.ch willi.huber@switch.ch 21.11.2012 SWITCH 2012 Introduction!
More informationIN recent years, the amount of traffic has rapidly increased
, March 1517, 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 information