Optimization Algorithms for Data Center Location Problem in Elastic Optical Networks
|
|
- Rhoda Snow
- 6 years 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. M.Klinkowski@itl.waw.pl 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 well-known 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 cost-efficient cloud- and anycast-ready 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 cloud-ready transport networks it is highly required to enable cooperation between these two environments including, among others, coordinated network planning and design. In a cross-stratum 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 P-complete [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 Branch-and-Bound (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 pre-calculate 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) Price-and-Branch (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. Price-and-Branch (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 one-by-one 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 pre-calculated 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 Price-and-Branch - 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 BB-based 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 cross-strata 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., Branch-and- 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 DEC-2011/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: state-of-the-art 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 cloud-ready 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 next-generation 100Gb/s networks, IEEE Comm. Mag., vol. 50, no. 11, pp , [11] A. Bocoi et al., Reach-dependent capacity in optical networks enabled by OFDM, in Proc. of OFC, San Diego, USA, 2009.
Optimization of Spectrally and Spatially Flexible Optical Networks with Spatial Mode Conversion
148 Regular papers ONDM 2018 Optimization of Spectrally and Spatially Flexible Optical Networks with Spatial Mode Conversion Mirosław Klinkowski, Grzegorz Zalewski, Krzysztof Walkowiak, National Institute
More informationOn 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 informationImpact of Aggregation Level on the Performance of Dynamic Lightpath Adaptation under Time-Varying Traffic
Impact of Aggregation Level on the Performance of Dynamic Lightpath Adaptation under Time-Varying Traffic A. Asensio 1, M. Klinkowski 2, M. Ruiz 1, V. López 3, A. Castro 1, L. Velasco 1, J. Comellas 1
More informationImpact of Aggregation Level on the Performance of Dynamic Lightpath Adaptation under Time-Varying Traffic
Impact of Aggregation Level on the Performance of Dynamic Lightpath Adaptation under Time-Varying Traffic A. Asensio 1, M. Klinkowski 2, M. Ruiz 1, V. López 3, A. Castro 1, L. Velasco 1, J. Comellas 1
More informationSelection of Spectral-Spatial Channels in SDM Flexgrid Optical Networks
Selection of Spectral-Spatial Channels in SDM Flexgrid Optical Networks Piotr Lechowicz, Krzysztof Walkowiak Wroclaw University of Science and Technology Mirosław Klinkowski ENGINE Centre and National
More informationSelection of Spectral-Spatial Channels in SDM Flexgrid Optical Networks
Selection of Spectral-Spatial 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 informationAn Evolutionary Algorithm Approach for Dedicated Path Protection Problem in Elastic Optical Networks
An Evolutionary Algorithm Approach for Dedicated Path Protection Problem in Elastic Optical Networks Mirosław Klinkowski Department of Transmission and Optical Technologies, National Institute of Telecommunications,
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 informationAn Efficient Algorithm for Solving Traffic Grooming Problems in Optical Networks
An Efficient Algorithm for Solving Traffic Grooming Problems in Optical Networks Hui Wang, George N. Rouskas Operations Research and Department of Computer Science, North Carolina State University, Raleigh,
More informationDynamic Routing and Resource Allocation in a Elastic Optical Network Using Learning Algorithms. Tanjila Ahmed
Dynamic Routing and Resource Allocation in a Elastic Optical Network Using Learning Algorithms Tanjila Ahmed Contents Motivation Novelties of Elastic Optical Network Enabling Technology for Elastic Optical
More informationMigration Towards Terascale Flexible-Grid Optical Networks. Tanjila Ahmed
Migration Towards Terascale Flexible-Grid Optical Networks Tanjila Ahmed Motivation With traffic growing at 40 percent annually, optical spectrum is becoming scarce, network architectures supporting channels
More informationSpectrum Allocation Policies in Fragmentation Aware and Balanced Load Routing for Elastic Optical Networks
Spectrum Allocation Policies in Fragmentation Aware and Balanced Load Routing for Elastic Optical Networks André C. S. Donza, Carlos R. L. Francês High Performance Networks Processing Lab - LPRAD Universidade
More informationColumn Generation Method for an Agent Scheduling Problem
Column Generation Method for an Agent Scheduling Problem Balázs Dezső Alpár Jüttner Péter Kovács Dept. of Algorithms and Their Applications, and Dept. of Operations Research Eötvös Loránd University, Budapest,
More informationDynamic Service Provisioning of Advance Reservation Requests in Elastic Optical Networks
JOURNAL OF LIGHTWAVE TECHNOLOGY 1621 Dynamic Service Provisioning of Advance Reservation Requests in Elastic Optical Networks Wei Lu, Student Member, IEEE, and Zuqing Zhu, Senior Member, IEEE Abstract
More informationA Network Optimization Model for Multi-Layer IP/MPLS over OTN/DWDM Networks
A Network Optimization Model for Multi-Layer IP/MPLS over OTN/DWDM Networks Iyad Katib and Deep Medhi Computer Science & Electrical Engineering Department University of Missouri-Kansas City, USA {IyadKatib,
More informationA Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks
A Novel Class-based Protection Algorithm Providing Fast Service Recovery in IP/WDM Networks Wojciech Molisz and Jacek Rak Gdansk University of Technology, G. Narutowicza 11/12, Pl-8-952 Gdansk, Poland
More informationAn Integer Programming Approach to Packing Lightpaths on WDM Networks 파장분할다중화망의광경로패킹에대한정수계획해법. 1. Introduction
Journal of the Korean Institute of Industrial Engineers Vol. 32, No. 3, pp. 219-225, September 2006. An Integer Programming Approach to Packing Lightpaths on WDM Networks Kyungsik Lee 1 Taehan Lee 2 Sungsoo
More informationMigration Steps Towards Flexi-grid Networks
Future Network & MobileSummit 2013 Conference Proceedings Paul Cunningham and Miriam Cunningham (Eds) IIMC International Information Management Corporation, 2013 ISBN: 978-1-905824-36-6 Migration Steps
More informationA Novel Genetic Approach to Provide Differentiated Levels of Service Resilience in IP-MPLS/WDM Networks
A Novel Genetic Approach to Provide Differentiated Levels of Service Resilience in IP-MPLS/WDM Networks Wojciech Molisz, DSc, PhD Jacek Rak, PhD Gdansk University of Technology Department of Computer Communications
More informationWDM Network Provisioning
IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the
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 informationDynamic connection establishment and network re-optimization in flexible optical networks
Photon Netw Commun (2015) 29:307 321 DOI 10.1007/s11107-015-0500-8 Dynamic connection establishment and network re-optimization in flexible optical networks P. Soumplis 1,2 K. Christodoulopoulos 1,2 E.
More informationDynamic RMSA in Spectrum-Sliced Elastic Optical Networks for High-Throughput Service Provisioning
2013 International Conference on Computing, Networking and Communications, Optical and Grid Networking Symposium Dynamic RMSA in Spectrum-Sliced Elastic Optical Networks for High-Throughput Service Provisioning
More informationSpectrum Allocation Policies for Flex Grid Network with Data Rate Limited Transmission
Spectrum Allocation Policies for Flex Grid Network with Data Rate Limited Transmission Kruthika Lohith 1, Triveni C L 2, Dr. P.C Srikanth 3 1Malnad College of Engineering, Hassan, Karnataka 2 Asst Professor,
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 trade-offs for WDM network design To
More informationA Study on Layer Correlation Effects Through a Multilayer Network Optimization Problem
A Study on Layer Correlation Effects Through a Multilayer Network Optimization Problem Iyad Katib and Deep Medhi University of Missouri Kansas City, USA Abstract Multilayer network design has received
More informationDesign Methodologies and Algorithms for Survivable C-RAN
16 Regular papers ONDM 218 Design Methodologies and Algorithms for Survivable C-RAN Bahare M. Khorsandi, Federico Tonini, Carla Raffaelli DEI, University of Bologna Viale Risorgimento 2, 4136 Bologna,
More informationSplitter Placement in All-Optical WDM Networks
plitter Placement in All-Optical WDM Networks Hwa-Chun Lin Department of Computer cience National Tsing Hua University Hsinchu 3003, TAIWAN heng-wei Wang Institute of Communications Engineering National
More informationBandwidth Defragmentation in Dynamic Elastic Optical Networks with Minimum Traffic Disruptions
IEEE ICC 2013 - Optical Networks and Systems Bandwidth Defragmentation in Dynamic Elastic Optical Networks with Minimum Traffic Disruptions Mingyang Zhang, Weiran Shi, Long Gong, Wei Lu, Zuqing Zhu School
More informationWDM Network Provisioning
IO2654 Optical Networking WDM Network Provisioning Paolo Monti Optical Networks Lab (ONLab), Communication Systems Department (COS) http://web.it.kth.se/~pmonti/ Some of the material is taken from the
More informationReduction of Periodic Broadcast Resource Requirements with Proxy Caching
Reduction of Periodic Broadcast Resource Requirements with Proxy Caching Ewa Kusmierek and David H.C. Du Digital Technology Center and Department of Computer Science and Engineering University of Minnesota
More informationTraffic Grooming and Regenerator Placement in Impairment-Aware Optical WDM Networks
Traffic Grooming and Regenerator Placement in Impairment-Aware Optical WDM Networks Ankitkumar N. Patel, Chengyi Gao, and Jason P. Jue Erik Jonsson School of Engineering and Computer Science The University
More informationDesign of Hierarchical Crossconnect WDM Networks Employing a Two-Stage Multiplexing Scheme of Waveband and Wavelength
166 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 1, JANUARY 2002 Design of Hierarchical Crossconnect WDM Networks Employing a Two-Stage Multiplexing Scheme of Waveband and Wavelength
More informationCrosstalk-Aware Spectrum Defragmentation based on Spectrum Compactness in SDM-EON
Crosstalk-Aware Spectrum Defragmentation based on Spectrum Compactness in SDM-EON Yongli Zhao State Key Laboratory of Information Photonics and Optical Communications, Beijing University of Posts and Telecommunications
More informationSurvivable Multipath Provisioning in OFDM-Based Flexible Optical Networks
Survivable Multipath Provisioning in OFDM-Based Flexible Optical Networks Nan Xiao and Lu Ruan Department of Computer Science Iowa Stat University, Ames, IA 11 Email: {nxiao, ruanlu}@iastate.edu Abstract
More informationSolving Routing and Spectrum Allocation Related Optimization Problems
Optical Communications Group Solving Routing and Spectrum Allocation Related Optimization Problems, Alberto Castro, Marc Ruiz lvelasco@ac.upc.edu ECOC 2013 Outline I. RSA Basics II. Solving Techniques
More informationHierarchical Traffic Grooming in WDM Networks
Hierarchical Traffic Grooming in WDM Networks George N. Rouskas Department of Computer Science North Carolina State University Joint work with: Rudra Dutta (NCSU), Bensong Chen (Google Labs), Huang Shu
More informationPerformance Evaluation of Brute Force Techniques for Routing and Spectrum Assignment in Elastic Optical Network using MPI and CUDA
Performance Evaluation of rute Force Techniques for Routing and Spectrum Assignment in Elastic Optical Network using MPI and CUDA Mahmoud Fayez mahmoud.fayez@cis.asu.edu.eg Tarek F. Gharib Information
More informationDynamic Unicast/Multicast-Capable RMSA in Elastic Optical Networks
Dynamic Unicast/Multicast-Capable RMSA in Elastic Optical Networks Zuqing Zhu, Xiang Zhou, Long Gong, Wenwen Zhao, Wei Lu School of Information Science and Technology University of Science and Technology
More informationA Novel Optimization Method of Optical Network Planning. Wu CHEN 1, a
A Novel Optimization Method of Optical Network Planning Wu CHEN 1, a 1 The engineering & technical college of chengdu university of technology, leshan, 614000,china; a wchen_leshan@126.com Keywords:wavelength
More informationCrew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm. Santos and Mateus (2007)
In the name of God Crew Scheduling Problem: A Column Generation Approach Improved by a Genetic Algorithm Spring 2009 Instructor: Dr. Masoud Yaghini Outlines Problem Definition Modeling As A Set Partitioning
More information3350 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 29, NO. 21, NOVEMBER 1, Reach Adapting Algorithms for Mixed Line Rate WDM Transport Networks
3350 JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 29, NO. 21, NOVEMBER 1, 2011 Reach Adapting Algorithms for Mixed Line Rate WDM Transport Networks Konstantinos Christodoulopoulos, Konstantinos Manousakis, and
More informationNetwork Protection Design for MPLS Networks
Network Protection Design for MPLS Networks Gaurav Agrawal, Dijiang Huang, Deep Medhi Computer Science and Electrical Engineering Department University of Missouri-Kansas City, MO 64110, USA Computer Science
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, 13083-970 Campinas, SP-BRAZIL Tel: +55-19-37883793,
More informationHierarchical Traffic Grooming Formulations
Hierarchical Traffic Grooming Formulations Hui Wang, George N. Rouskas Operations Research and Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206 USA Abstract Hierarchical
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 informationSimple Layout Algorithms To Maintain Network Connectivity Under Faults
Simple Layout Algorithms To Maintain Network Connectivity Under Faults Galen H. Sasaki 1 Department of Electrical, University of Hawaii 2540 Dole Street, Honolulu, HI 96822 USA Ching-Fong Su and David
More informationOptical Switching and Networking
Optical Switching and Networking 14 (14) 25 259 Contents lists available at ScienceDirect Optical Switching and Networking journal homepage: www.elsevier.com/locate/osn Spectrum-efficient anycast in elastic
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 21, NO. 7, SEPTEMBER 2003 1173 A Comprehensive Study on Next-Generation Optical Grooming Switches Keyao Zhu, Student Member, IEEE, Hui Zang, Member,
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 informationLayer-Wise Topology Design for Cost Effective IP-Optical Networks
Communications and Networ, 2012, 4, 88-92 http://dx.doi.org/10.4236/cn.2012.41012 Published Online February 2012 (http://www.scirp.org/journal/cn) Layer-Wise Topology Design for Cost Effective IP-Optical
More informationA Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks
A Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks Arie M.C.A. Koster, Zuse Institute Berlin (ZIB), Takustr. 7, D-495 Berlin, koster@zib.de Matthias
More informationPATH SPLITTING FOR VIRTUAL NETWORK EMBEDDING IN ELASTIC OPTICAL NETWORKS
PATH SPLITTING FOR VIRTUAL NETWORK EMBEDDING IN ELASTIC OPTICAL NETWORKS Badr Oulad Nassar and Takuji Tachibana Graduate School of Engineering, University of Fukui, Fukui City, Japan ABSTRACT In elastic
More informationInterference Mitigation Technique for Performance Enhancement in Coexisting Bluetooth and WLAN
2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Interference Mitigation Technique for Performance Enhancement in Coexisting
More informationOPTICAL GRID NETWORK DIMENSIONING, PROVISIONING, AND JOB SCHEDULING
OPTICAL GRID NETWORK DIMENSIONING, PROVISIONING, AND JOB SCHEDULING Ali Asghar Shaikh A thesis in The Department of Computer Science and Software Engineering Presented in Partial Fulfillment of the Requirements
More informationA Network Protection Design Model and A Study of Three-Layer Networks with IP/MPLS, OTN, and DWDM
A Network Protection Design Model and A Study of Three-Layer Networks with IP/MPLS, OTN, and DWDM Iyad Katib and Deep Medhi University of Missouri Kansas City, USA Abstract In this paper, we present an
More informationLink Selection Algorithms for Link-Based ILPs and Applications to RWA in Mesh Networks
Link Selection Algorithms for Link-Based ILPs and Applications to RWA in Mesh Networks Zeyu Liu, George N. Rouskas Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206,
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 Co-Advisor:
More informationDynamic Wavelength Assignment for WDM All-Optical Tree Networks
Dynamic Wavelength Assignment for WDM All-Optical Tree Networks Poompat Saengudomlert, Eytan H. Modiano, and Robert G. Gallager Laboratory for Information and Decision Systems Massachusetts Institute of
More informationTwo-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics
Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics Sebastian Orlowski, Zuse Institute Berlin, Takustr. 7, D-14195 Berlin, orlowski@zib.de Arie M.C.A. Koster, Zuse Institute Berlin,
More informationWavelength Assignment in a Ring Topology for Wavelength Routed WDM Optical Networks
Wavelength Assignment in a Ring Topology for Wavelength Routed WDM Optical Networks Amit Shukla, L. Premjit Singh and Raja Datta, Dept. of Computer Science and Engineering, North Eastern Regional Institute
More informationResearch on Control Routing Technology in Communication Network
Appl. Math. Inf. Sci. 6 No. 1S pp. 129S-133S (2012) Applied Mathematics & Information Sciences An International Journal @ 2012 NSP Natural Sciences Publishing Cor. Research on Control Routing Technology
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 informationAdapted and Constrained Dijkstra for Elastic Optical Networks
Adapted and Constrained Dijkstra for Elastic Optical Networks Ireneusz Szcześniak AGH University of Science and Technology Department of Telecommunications al. Mickiewicza 30 30-059 Krakow Poland Bożena
More informationDesign of CapEx-Efficient IP-over-WDM 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 informationJOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 33, NO. 1, JANUARY 1,
JOURNAL OF LIGHTWAVE TECHNOLOGY, VOL. 33, NO. 1, JANUARY 1, 2015 275 Dynamic Multipath Routing With Traffic Grooming in OFDM-Based Elastic Optical Path Networks Zheyu Fan, Student Member, IEEE, Yang Qiu,
More informationMaximization of Single Hop Traffic with Greedy Heuristics
Maximization of Single Hop Traffic with Greedy Heuristics Esa Hyytiä Networking Laboratory, HUT, Finland, email: esa@netlab.hut.fi, ABSTRACT Maximization of the single hop traffic has been proposed as
More informationOvercoming the Energy versus Delay Trade-off in Cloud Network Reconfiguration
Overcoming the Energy versus Delay Trade-off in Cloud Network Reconfiguration Burak Kantarci and Hussein T. Mouftah School of Electrical Engineering and Computer Science University of Ottawa Ottawa, ON,
More informationToward the joint design of electronic and optical layer protection
Toward the joint design of electronic and optical layer protection Massachusetts Institute of Technology Slide 1 Slide 2 CHALLENGES: - SEAMLESS CONNECTIVITY - MULTI-MEDIA (FIBER,SATCOM,WIRELESS) - HETEROGENEOUS
More informationPerformance Evaluation of Non-Hitless Spectrum Defragmentation Algorithms in Elastic Optical Networks
Performance Evaluation of Non-Hitless Spectrum Defragmentation Algorithms in Elastic Optical Networks Sergio Fernández Martínez and Diego P. Pinto-Roa Facultad Politécnica Universidad Nacional de Asunción
More informationDiversity Coded 5G Fronthaul Wireless Networks
IEEE Wireless Telecommunication Symposium (WTS) 2017 Diversity Coded 5G Fronthaul Wireless Networks Nabeel Sulieman, Kemal Davaslioglu, and Richard D. Gitlin Department of Electrical Engineering University
More informationOn the Robustness of Distributed Computing Networks
1 On the Robustness of Distributed Computing Networks Jianan Zhang, Hyang-Won Lee, and Eytan Modiano Lab for Information and Decision Systems, Massachusetts Institute of Technology, USA Dept. of Software,
More informationDeadline-Aware Co-Scheduling Using Anycast Advance Reservations in Wavelength Routed Lambda Grids
Deadline-Aware Co-Scheduling Using Anycast Advance Reservations in Wavelength Routed Lambda Grids Hitesh Kulkarni, Arush Gadkar, and Vinod M. Vokkarane Department of Computer and Information Science University
More informationTHE EXPLOSIVE growth of Web-related services over the. A Practical Approach to Operating Survivable WDM Networks
34 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 20, NO. 1, JANUARY 2002 A Practical Approach to Operating Survivable WDM Networks Murari Sridharan, Student Member, IEEE, Murti V. Salapaka, and
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 informationCost Evaluation for Flexible-Grid Optical Networks
Cost Evaluation for Flexible-Grid Optical Networks Jorge López Vizcaíno 1, 3, Yabin Ye 1, Víctor López 2, Felipe Jiménez 2, Raúl Duque 2, Peter M. Krummrich 3 1 Huawei Technologies Duesseldorf GmbH, European
More informationVirtual-Pod-Assisted Routing and Resource Assignment in Elastic All-Optical Intra- Datacenter Networks
Virtual-Pod-Assisted Routing and Resource Assignment in Elastic All-Optical Intra- Datacenter Networks Speaker: Lin Wang Peng, L et al, Virtual-Pod-Assisted Routing and Resource Assignment in Elastic All-Optical
More informationTraffic Prediction for Inter-Data Center Cross-Stratum Optimization Problems
Traffic Prediction for Inter-Data Center Cross-Stratum Optimization Problems Michał Aibin and Krzysztof Walkowiak Department of Systems and Computer Networks Faculty of Electronics Wroclaw University of
More informationRecursive column generation for the Tactical Berth Allocation Problem
Recursive column generation for the Tactical Berth Allocation Problem Ilaria Vacca 1 Matteo Salani 2 Michel Bierlaire 1 1 Transport and Mobility Laboratory, EPFL, Lausanne, Switzerland 2 IDSIA, Lugano,
More informationIntelligent Energy Aware Networks - a Content Perspective
Intelligent Energy Aware Networks - a Content Perspective Jaafar Elmirghani, University of Leeds, UK j.m.h.elmirghani@leeds.ac.uk Outline Introduction The Intelligent Energy Aware Networks (INTERNET) project
More informationIndex Terms Backbone Networks Optimization, Resilience, Virtual Private Network, Traffic Demands and Traffic Flows
International Journal of Computer Science and Telecommunications [Volume 2, Issue 8, November 2011] 12 ISSN 2047-3338 Designing Different Models of Robust IP/MPLS over DWDM Networks Marko Rožman University
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-/Multi-Path Routing Zuqing Zhu, Senior Member, IEEE, Wei
More informationOptimal Topology Design for Overlay Networks
Optimal Topology Design for Overlay Networks Mina Kamel 1, Caterina Scoglio 1, and Todd Easton 2 1 Electrical and computer Engineering Department 2 Industrial and Manufacturing Systems Engineering Department
More informationMULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION
MULTICAST CONNECTION CAPACITY OF WDM SWITCHING NETWORKS WITHOUT WAVELENGTH CONVERSION B. CHIDHAMBARARAJAN a,1 K.KALAMANI a,2 N. NAGARAJAN b,2 S.K.SRIVATSA a,3 Department of Electronics and Communication
More informationFault-Tolerant Design of Wavelength-Routed Optical. Networks. S. Ramamurthy and Biswanath Mukherjee
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Fault-Tolerant Design of Wavelength-Routed Optical Networks S. Ramamurthy and Biswanath Mukherjee Abstract. This paper considers optical
More informationEconomics of Multi-Domain Software-Defined EONs: Games among Brokers
Economics of Multi-Domain Software-Defined EONs: Games among Brokers Zuqing Zhu School of Information Science and Technology, University of Science and Technology of China, Hefei, China Email: {zqzhu}@ieee.org
More informationOptimal Network Service Chain Provisioning
JOURNAL OF L A TE CLASS FILES, VOL. 6, NO. 1, JANUARY 2007 1 Optimal Network Service Chain Provisioning Nicolas Huin, Brigitte Jaumard, and Frédéric Giroire Abstract Service chains consist of a set of
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 informationINTERNET traffic has witnessed enormous growth over the
A Heuristic Algorithm for Network Optimization of OTN over DWDM Network Govardan C., Sri Krishna Chaitanya K., Krishna Kumar Naik B., Shreesha Rao D. S., Jagadeesh C., Gowrishankar R. and Siva Sankara
More information10 Optical Network Engineering
10 Optical Network Engineering George N. Rouskas Department of Computer Science North Carolina State University Raleigh, NC 27695-7534 Email: rouskas@csc.ncsu.edu 10.1 INTRODUCTION Over the last few years
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 informationDistributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks
Distributed Traffic Adaptive Wavelength Routing in IP-Over- WDM networks Balaji Palanisamy, T. Siva Prasad, N.Sreenath 1 Department of Computer Science & Engineering and Information technology Pondicherry
More informationCost-Effective Traffic Grooming in WDM Rings
618 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 8, NO. 5, OCTOBER 2000 Cost-Effective Traffic Grooming in WDM Rings Ornan Gerstel, Member, IEEE, Rajiv Ramaswami, Fellow, IEEE, and Galen H. Sasaki, Member,
More informationThis is a repository copy of Energy Efficient Tapered Data Networks for Big Data Processing in IP/WDM Networks.
This is a repository copy of Energy Efficient Tapered Data Networks for Big Data Processing in IP/WDM Networks. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/88009/ Version:
More informationOn the Robustness of Distributed Computing Networks
1 On the Robustness of Distributed Computing Networks Jianan Zhang, Hyang-Won Lee, and Eytan Modiano Lab for Information and Decision Systems, Massachusetts Institute of Technology, USA Dept. of Software,
More informationGraph Coloring via Constraint Programming-based Column Generation
Graph Coloring via Constraint Programming-based Column Generation Stefano Gualandi Federico Malucelli Dipartimento di Elettronica e Informatica, Politecnico di Milano Viale Ponzio 24/A, 20133, Milan, Italy
More informationMODERN communication networks are constructed
1000 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 19, NO. 4, AUGUST 2011 Cross-Layer Survivability in WDM-Based Networks Kayi Lee, Member, IEEE, Eytan Modiano, Senior Member, IEEE, and Hyang-Won Lee, Member,
More informationAvailable online at ScienceDirect
Available online at www.sciencedirect.com ScienceDirect Procedia Technology 0 ( 0 ) 900 909 International Conference on Computational Intelligence: Modeling, Techniques and Applications (CIMTA-0) Multicast
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 informationInternet Traffic Characteristics. How to take care of the Bursty IP traffic in Optical Networks
Internet Traffic Characteristics Bursty Internet Traffic Statistical aggregation of the bursty data leads to the efficiency of the Internet. Large Variation in Source Bandwidth 10BaseT (10Mb/s), 100BaseT(100Mb/s),
More information