SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
|
|
- Annice Hicks
- 6 years ago
- Views:
Transcription
1 SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway Sunnyvale, CA USA ABSTRACT A novel survivable IP over WDM network esign problem is propose The IP network uses lightpath services of the WDM network to implement its IP links The WDM network can provie unprotecte an protecte lightpaths, as well as a new lightpath service referre to as survivable pair The IP network must support two traffic matrices, one uner normal conitions an the other whenever there is a failure A mixe integer linear programming (MILP) formulation of the problem is presente An example is given where the survivable pair service can lea to significantly lower costs, sometimes by at least 30% KEY WORDS Optical networks, survivable networks, IP over WDM, overlay networks, network esign, mixe integer linear programming 1 Introuction We consiere esigning a survivable IP network where the IP links are realize by subscribing to lightpath services from a WDM network as shown in Figure 1 The IP network is part of some organization, perhaps a commercial Internet Service Provier (ISP) or government entity We refer to the organization as Company X The WDM network is part of another organization, which we refer to as Company Y We refer to Company Y as an optical transport service provier (OT-SP) Company Y provies ifferent graes of lightpath services, where each grae is a type of protection from faults Two services we consier are unprotecte an protecte Unprotecte service means that the lightpath can fail, while protecte service means that the lightpath cannot, ie, it has back-ups that it can switch to in case of faults Note that protecte service will cost more than unprotecte Lightpath Fiber-Link Router for Company X Optical Cross- Connect (OXC) Company Y (OT-SP) Figure 1 An IP network overlaye over a WDM network We assume that Company Y oes not reveal its resources such as its fiber-link layout Thus, the view of the OT-SP by Company X is more like Figure 2 rather than Figure 1 This is realistic because telecommunication companies typically keep their resources secret from competitors an customers However, they will reveal the type an price of their lightpath services We consier the following questions: What is an appropriate efinition of survivable IP networks over WDM networks? We assume there are two traffic matrices T an R that the IP network must support The IP network is require to carry T uner normal conitions, ie, no faults It is require to carry R whenever a fault occurs Thus, R is a survivable (guarantee) network capacity Note that R will be chosen to balance network costs with survivable performance Presumably R will be significantly smaller than T since IP network users are cost sensitive What kins of lightpath services will support survivable IP networks over WDM networks? We
2 consier unprotecte an protecte lightpath services These services are for iniviual lightpaths We also consier protection for pairs of lightpaths that have the same en routers We refer to such a pair as a survivable pair An example is shown in Figure 3 They are two unprotecte lightpaths that are route so that one of them is guarantee to survive a fault, ie, their routes o not have a common point of failure Note that survivable pair service only makes sense when there can be multiple IP links between routers, ie, when link bunling can be applie IP Link Figure 2 Company X's view of the OT-SP Router Lightpath Lightpath Figure 3 A survivable pair Company Y (OT-SP) Router In Section 2, we present a mixe integer linear programming (MILP) problem formulation of esigning an IP network that can support the traffic matrix T uner normal conitions, an support traffic matrix R whenever a fault occurs The problem assumes that unprotecte, protecte, an survivable pair lightpath services are available Note that esigning a survivable IP network over a WDM network has been consiere before in [1][2][3] However, in these works the esign problem is ifferent in a number of ways First, the input to the problem is an IP topology rather than traffic matrices Secon, only unprotecte lightpath service is available rather than a variety of protection types Thir, part of their esign problem is to route the unprotecte lightpaths, while we o not consier lightpath routing Finally, their iea of a survivable IP network is ifferent They only require that the IP network remain connecte after a fault Thus, they have very minimal surviving network banwith requirements This may be insufficient for networks with many users that nee quality of service On the other han, our problem requires that a prescribe network traffic R be supporte by the network even after a fault In Section 3, we show that the survivable pair lightpath service can reuce costs consierably by giving an example The costs can be reuce by as much as 30% for a 50 noe network Our final remarks are given in Section 4 2 Network Design Problem The following is the IP network esign problem we consier The network esigner is given a collection of IP routers, where we enote their number by n The IP routers are labele 1, 2,, n The esigner is given a traffic matrix T, where for each pair of routers {}, T( enotes the rate of traffic from i to The esigner is also given another traffic matrix R We assume that R is no greater than T, ie, for all pairs of routers {}, R( T ( Note that the traffic matrices may be asymmetric The IP network esigner must set up IP links between the routers to create an IP network, that in turn supports traffic matrix T The traffic may be route over multiple hops an bifurcate This can be accomplishe by MPLS traffic engineering In aition, the network is survivable in the following sense For any fault, the surviving IP network must support traffic matrix R, where rerouting of traffic is allowe The esigner leases lightpaths from Company Y (ie, the OT-SP) an uses them as the IP links The lightpaths are assume to be full uplex an have unit capacity Company Y is able to provie any number of lightpaths to connect any pair of routers In aition, Company Y provies ifferent types of lightpaths which correspons to ifferent protection The protection types are as follows: Unprotecte: An unprotecte lightpath is an orinary one If a failure occurs along its path then it goes own We enote the cost of leasing an unprotecte lightpath between routers {} by ucost( Note that since the IP network esigner oes not know how the lightpaths are route in the WDM network, she must assume that a single fault may bring own all unprotecte lightpaths Protecte: A protecte lightpath has back-ups When the lightpath fails, its signal is switche over to a back-up Thus, the IP network esigner may assume that a protecte lightpath will never fail We enote the cost of leasing a protecte lightpath between routers {} by pcost( Survivable Pair: Survivable pairs service is for a pair of IP links between the same routers The lightpaths
3 are unprotecte, ie, they may fail iniviually However, at least one lightpath will survive any failure We enote the cost of leasing a survivable pair between routers {} by scost( The esign problem for the IP network esigner is to choose the number of lightpaths between the routers an their protection types to support T an R In aition, there may be IP router port constraints at each router which is enote by D(u) This is an upper boun on the number of IP links that may terminate at the router u The esign problem can be formulate as an MILP problem as follows: Input Parameters: Matrix T: the traffic that the network must support uner normal conitions We refer to this as the nominal traffic Matrix R: the traffic that the network must support whenever there is a failure We refer to this as the surviving traffic Vector D: port constraints at each router Costs: for each router pair {}, ucost(, the cost of an unprotecte lightpath between {} pcost(, the cost of a protecte lightpath between {} scost(, the cost of a survivable pair between {} Integer Variables: Matrix C: for each pair of routers {}, C( is the number of unprotecte lightpaths (that are not part of survivable pairs) between them Matrix P: for each pair of routers {}, P( is the number of protecte lightpaths between them Matrix S: for each pair of routers {}, S( is the number of survivable pairs between them Continuous Variables: For all orere pairs of routers {} an estination router, t is the amount of nominal traffic that is carrie on some IP link between {}, from i to, an that is estine for For all orere pairs of routers {} an estination router, r is the amount of surviving traffic that is carrie on some IP link between {}, from i to, an that is estine for Constraints: All variables are nonnegative Lightpaths are full uplex: Since the lightpaths are full uplex, the matrices C, P, an S are symmetric Thus, for each pair of routers { }, C ( = C (, i), P ( = P(, i), S ( = S (, i) Port constraints: for each router v ( + P( + 2S( ) C ( D( u) The summation is the number of IP links that are incient to router u Thus, the inequality insures that there are at most D(u) incient IP links Link capacity constraints fort : for each router pair { }, ( C( + P( 2S( ) t + The summation is the amount of nominal traffic carrie on links between routers { } from i to This cannot excee the total capacity of the IP links between the routers Link capacity constraints for r : for each router pair { }, r S( + P( The summation is the amount of surviving traffic carrie on links between routers { } from i to This cannot excee the total capacity of the surviving IP links between the routers It is assume that only protecte lightpaths an one of every survivable pair will survive failures This assumption is necessary because the exact routes of the lightpaths are unknown, an so it is unclear which lightpaths will fail together when a physical fault occurs In aition, the surviving traffic must be supporte Flow conservation constraints fort : for each router i an estination router, t t i T( ) = T(, ) if if i i = Note that the left han sie of the equality is the "net flow" of nominal traffic that is estine for that comes out of router i The right han sie is what the net flow shoul be for router i If i is not then the net flow shoul be T(), which is the require amount of traffic that router i sources that is estine for If i is equal to then the net flow shoul be the total amount of traffic that must sink
4 Flow conservation constraints for r : for each router i an estination router, R( ) if i r ri = = R(, ) if i This constraint is for surviving traffic, an is similar to the flow conservation constraints for t escribe above Obective: the obective is to minimize ( ( : u< v ucost( C( + pcost( P( + scost( S( v Thus, the obective is to minimize the total cost of leasing lightpaths 3 Cost Efficiency of Survivable Pairs In this section, we will iscuss whether survivable pairs can reuce cost A natural approach to illustrate the cost effectiveness is to create instances of traffic matrices T an R an lightpath costs, an then esign IP networks with an without the survivable pair lightpath service For the case when survivable pair service is available, the esign woul be accomplishe by solving the MILP of Section 2 For the case when survivable pair service is unavailable, the esign is accomplishe by first moifying the MILP so that the service is unavailable (which is straightforwar), an then solving it The resulting network costs can be compare to etermine the effectiveness of the survivable pair service However, we foun that solving the MILP of Section 2 can be time consuming for even small networks For example, we solve the MILP for a case of six routers an uniform traffic matrices T an R using the AMPL an CPLEX software package on a SUN Blae 100 workstation The run time ("elapse time") to solve the MILP took approximately 5 minutes an 43 secons We also trie an example of seven routers but the run time exceee a couple of hours, an so we terminate it before completion Therefore, we will use another approach to illustrate the cost efficiency of survivable pairs We will erive two formulas for the cost of IP networks The first formula will be a lower boun on network cost without survivable pair lightpath service, an the secon formula will be an upper boun on cost with the service Then the formulas will be compare We will make the following simplifying assumptions Traffic matrices T an R are uniform: We assume that there are values τ an ρ such that for all pairs of )) routers {}, T( = τ an R( = ρ Note that uniform traffic matrices are commonly use in the research community for performance evaluation Also note that R is a fraction ρ/τ of T No port constraints: For all routers the value D(u) is essentially infinite, ie, it is ignore Cost of a lightpath is inepenent of the pair of routers it connects We assume the values of ucost(, pcost(, an scost( are inepenent of the pair of routers {} This assumption may be false for long-haul lightpath service Then lightpath costs may epen on istance, which can vary consierably However, the assumption may be reasonable for metro networks, where lightpath lengths are less variable Without loss of generality, we may further assume that for all router pairs {}, ucost( = 1 In aition, without loss of generality, we may assume that there are constants σ an π such that for all router pairs {}, scost( = 2 + σ an pcost( = 1 + π Note that the value of σ shoul be nonnegative (ie, 2 + σ shoul be at least 2) because a survivable pair is compose of two lightpaths In aition, σ can be significant To illustrate this, consier the following example Suppose the WDM network is a large ring network Suppose unprotecte lightpaths follow shortest hop paths Note that, on average, a shortest hop path traverses approximately 1/4 of the fiberlinks However, the lightpaths of a survivable pair must traverse all fiber-links of the ring because the lightpaths must be isoint Thus, on average, a survivable pair uses about four times as many fiberlinks as an unprotecte lightpath This suggests σ = 2 Note that the value of π epens on the type of protecte lightpaths The two types of protecte lightpaths are eicate an share Deicate protection means that the back-up lightpath has eicate, reserve banwith, eg, 1+1 an 1:1 protection The avantage of eicate protection is simpler an faster switching to the back-up Typically, a lightpath has only one back-up Then the lightpath must be isoint from its back-up to avoi a common point of failure Therefore, a protecte lightpath an its back-up consumes as much banwith as a survivable pair Hence, for eicate protection, 1 + π = 2 + σ, or equivalently, π = 1 + σ Share protection means that the back-ups of lightpaths may share banwith The avantage of share protection is smaller banwith use an lower
5 cost Note that if π < σ then survivable pairs are not cost effective because there will be a cheaper alternative The alternative to a survivable pair is another pair of lightpaths, one protecte an the other unprotecte It has cost 2+π, which is less than the 2+σ cost of a survivable pair It also supports the same traffic (2 units of capacity uner normal conitions an 1 unit of capacity if there is a failure) The following is an example of when π < σ Suppose the WDM network is a ring network Then σ = 2, as we have shown earlier Suppose that the scheme to share protection banwith is the same as in a biirectional line switche ring (BLSR) BLSR requires twice as much banwith as an unprotecte network because half of its banwith is for protection Hence, if cost is epenent on banwith then a protecte lightpath has twice the cost of an unprotecte one Then π = 1, an so π < σ Now we will erive the lower boun formula for IP network cost without survivable pair lightpath service We will use the following proposition Proposition 1 Consier a network with n noes, fulluplex links with capacity 1, an a traffic matrix T' such that for all pairs of noes {}, T'( = t Let L enote the total number of links Then ( ) nt L 1 + t Proof Let a enote the amount of traffic that is route along one-hop paths, an b the amount of traffic that is route on multi-hop paths Since one-hop traffic traverses one link, it consumes a unit amount of link banwith per unit of traffic Since multi-hop traffic traverses two or more links, it consumes at least 2 units of link banwith per unit of traffic Also note that each link is full uplex an can carry a unit of banwith in both irections Therefore, 2 L a + 2b Next, note that the total amount of traffic is n 2 t 2 Thus, n b = 2 t a, which implies 2 n n 2 L a + 2 t a 2 = 4 t a Finally, note 2 2 that if there are L links then at most 2L orere pairs of noes will have their traffic route along one-hop paths n Hence, a 2Lt This implies 2L 4 t 2Lt 2 After some algebra, we get the inequality of the proposition QED The proposition implies that we nee at least ( ) nτ 1 + τ lightpaths to support T If survivable pair lightpaths are unavailable, we woul nee ( ) nρ 1 + ρ protecte lightpaths to support R Thus, to insure we have enough lightpaths to support T, we nee least ( ) nt ( ) nρ 1 + t 1 + ρ unprotecte lightpaths Hence, the cost is at least ( ) nρ ( ) nτ ( ) nρ (1 + π ) ρ 1 + τ 1 + ρ This is our lower boun for the cost of an IP network that can support T an R without survivable pair lightpath service We enote this lower boun by LB Next we will erive an upper boun on IP network cost when survivable pair lightpaths are available We accomplish this by efining an IP network that can carry traffic matrices T an R, an then evaluate its cost Since the network can carry the require traffic, its cost is an upper boun The network has the star topology shown in Figure 4 It has one router esignate as the center, an all other routers are referre to as peripheral The peripheral routers are irectly connecte to the center by unprotecte an survivable pair lightpaths The number of survivable pairs between a peripheral router an the center is ( )ρ because ( ) ρ is the amount of traffic that the peripheral router must source/sink even when there is a failure The number unprotecte lightpaths between a peripheral router an the center is max { 0, ( 1) τ 2 ( )ρ } n Then the total number of lightpaths between the peripheral router an the center is at least ( )τ This insures that the lightpaths can carry ( n 1) τ amount of traffic, which is the amount that the peripheral router must source/sink uner normal conitions Thus, the cost of the lightpaths between the peripheral router an the center is K, where ( 2 + σ ) ( n 1) ρ + max{ 0, ( n 1) τ 2 ( 1) ρ } K = n Since there are n 1 peripheral routers, the total network cost is ( n 1)K This is our upper boun on the IP network cost if survivable pairs are available, an we enote it by Star
6 Next, we numerically compare the lower boun LB with the upper boun Star For parameter values, we choose τ an ρ so that ρ = τ/2, ie, the surviving matrix R is half of T We choose π = 1 + σ, ie, the case when protecte lightpaths use eicate protection We consier σ = 0 (the minimum value for σ), σ = 1, an σ = 2 (the case when the WDM network is a ring) 5 Acknowlegements The authors woul like to thank the reviewers who provie valuable comments This research was supporte in part by Fuitsu Laboratories of America an the National Science Founation uner grant NCR Peripheral Routers Figure 4 Star topology for an IP network Figure 5 shows δ, which is efine to be 100 % LB Star LB, for n = 50 The value δ inicates the percent ecrease in cost of using survivable pairs It is plotte as a function of τ, which ranges from 2 to 8 Note that for positive values c, if c τ = then each peripheral router must have at least c lightpaths Since LB an Star are bouns, the actual ecrease in cost coul be greater than δ This is why δ is sometimes negative The figure shows that the ecrease in cost can excee 30% This occurs when σ = 0 an 2 τ = = 0041 Also note that survivable pairs are more cost effective for smaller values of σ, which suggests that they will be more effective in WDM networks with mesh topologies 4 Conclusions Center We have efine a survivable IP over WDM network esign problem an formulate it into an MILP The resulting network guarantees a survivable network throughput We introuce survivable pairs as a lightpath service an emonstrate that in certain cases, it can achieve a ecrease in cost of at least 30% A future irection for research is to investigate other lightpath services that support survivable network throughput at lower cost δ Figure 5 Percentage ecrease in cost δ as a function of τ for n = 50 References σ = 0 σ = 1 σ = 2 [1] O Crochat, J-Y Le Bouec, Design protection for WDM networks, IEEE J Selecte Areas on Communications, 16(7), 1998, [2] E Moiano an A Narula-Tam, Designing survivable networks using effective routing an wavelength assignment (RWA), Proc OFC 2001, Anaheim, CA [3] E Moiano an A Narula-Tam, Survivable routing in logical topologies in WDM networks, ProcIEEE Infocom 2001, Anchorage, AK, τ
Simple 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 informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationECE442 Communications Lecture 4. Optical Networks
ECE442 Communications Lecture 4. Optical Networks Husheng Li Dept. of Electrical Engineering and Computer Science Spring, 2014 Network Elements 1 WDM networks provide circuit switched end-to-end optical
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationMessage Transport With The User Datagram Protocol
Message Transport With The User Datagram Protocol User Datagram Protocol (UDP) Use During startup For VoIP an some vieo applications Accounts for less than 10% of Internet traffic Blocke by some ISPs Computer
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationAdaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots
Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationIntensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2
This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar
More informationQuestions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!
EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an
More informationSpare Capacity Planning Using Survivable Alternate Routing for Long-Haul WDM Networks
Spare Capacity Planning Using Survivable lternate Routing for Long-Haul WDM Networks in Zhou an Hussein T. Mouftah Department of lectrical an Computer ngineering Queen s University, Kingston, Ontario,
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationOptimal Oblivious Path Selection on the Mesh
Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationDisjoint Multipath Routing in Dual Homing Networks using Colored Trees
Disjoint Multipath Routing in Dual Homing Networks using Colore Trees Preetha Thulasiraman, Srinivasan Ramasubramanian, an Marwan Krunz Department of Electrical an Computer Engineering University of Arizona,
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationCS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing
CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing Tim Roughgaren October 19, 2016 1 Routing in the Internet Last lecture we talke about elay-base (or selfish ) routing, which
More informationEFFICIENT ON-LINE TESTING METHOD FOR A FLOATING-POINT ADDER
FFICINT ON-LIN TSTING MTHOD FOR A FLOATING-POINT ADDR A. Droz, M. Lobachev Department of Computer Systems, Oessa State Polytechnic University, Oessa, Ukraine Droz@ukr.net, Lobachev@ukr.net Abstract In
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationModule13:Interference-I Lecture 13: Interference-I
Moule3:Interference-I Lecture 3: Interference-I Consier a situation where we superpose two waves. Naively, we woul expect the intensity (energy ensity or flux) of the resultant to be the sum of the iniviual
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationProvisioning Virtualized Cloud Services in IP/MPLS-over-EON Networks
Provisioning Virtualize Clou Services in IP/MPLS-over-EON Networks Pan Yi an Byrav Ramamurthy Department of Computer Science an Engineering, University of Nebraska-Lincoln Lincoln, Nebraska 68588 USA Email:
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationPairwise alignment using shortest path algorithms, Gunnar Klau, November 29, 2005, 11:
airwise alignment using shortest path algorithms, Gunnar Klau, November 9,, : 3 3 airwise alignment using shortest path algorithms e will iscuss: it graph Dijkstra s algorithm algorithm (GDU) 3. References
More informationOn Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation
On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member
More informationAdditional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication
Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last
More informationSocially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach
Socially-optimal ISP-aware P2P Content Distribution via a Primal-Dual Approach Jian Zhao, Chuan Wu The University of Hong Kong {jzhao,cwu}@cs.hku.hk Abstract Peer-to-peer (P2P) technology is popularly
More informationUninformed search methods
CS 1571 Introuction to AI Lecture 4 Uninforme search methos Milos Hauskrecht milos@cs.pitt.eu 539 Sennott Square Announcements Homework assignment 1 is out Due on Thursay, September 11, 014 before the
More informationClassical Mechanics Examples (Lagrange Multipliers)
Classical Mechanics Examples (Lagrange Multipliers) Dipan Kumar Ghosh Physics Department, Inian Institute of Technology Bombay Powai, Mumbai 400076 September 3, 015 1 Introuction We have seen that the
More informationOn-path Cloudlet Pricing for Low Latency Application Provisioning
On-path Cloulet Pricing for Low Latency Application Provisioning Argyrios G. Tasiopoulos, Onur Ascigil, Ioannis Psaras, Stavros Toumpis, George Pavlou Dept. of Electronic an Electrical Engineering, University
More informationTHE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM
International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationDistributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationArchitecture Design of Mobile Access Coordinated Wireless Sensor Networks
Architecture Design of Mobile Access Coorinate Wireless Sensor Networks Mai Abelhakim 1 Leonar E. Lightfoot Jian Ren 1 Tongtong Li 1 1 Department of Electrical & Computer Engineering, Michigan State University,
More information6.823 Computer System Architecture. Problem Set #3 Spring 2002
6.823 Computer System Architecture Problem Set #3 Spring 2002 Stuents are strongly encourage to collaborate in groups of up to three people. A group shoul han in only one copy of the solution to the problem
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationFigure 1: 2D arm. Figure 2: 2D arm with labelled angles
2D Kinematics Consier a robotic arm. We can sen it commans like, move that joint so it bens at an angle θ. Once we ve set each joint, that s all well an goo. More interesting, though, is the question of
More informationThe Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract
The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationA Classification of 3R Orthogonal Manipulators by the Topology of their Workspace
A Classification of R Orthogonal Manipulators by the Topology of their Workspace Maher aili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S.
More informationModifying ROC Curves to Incorporate Predicted Probabilities
Moifying ROC Curves to Incorporate Preicte Probabilities Cèsar Ferri DSIC, Universitat Politècnica e València Peter Flach Department of Computer Science, University of Bristol José Hernánez-Orallo DSIC,
More informationParallel Directionally Split Solver Based on Reformulation of Pipelined Thomas Algorithm
NASA/CR-1998-208733 ICASE Report No. 98-45 Parallel Directionally Split Solver Base on Reformulation of Pipeline Thomas Algorithm A. Povitsky ICASE, Hampton, Virginia Institute for Computer Applications
More informationSecure Network Coding for Distributed Secret Sharing with Low Communication Cost
Secure Network Coing for Distribute Secret Sharing with Low Communication Cost Nihar B. Shah, K. V. Rashmi an Kannan Ramchanran, Fellow, IEEE Abstract Shamir s (n,k) threshol secret sharing is an important
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationPreamble. Singly linked lists. Collaboration policy and academic integrity. Getting help
CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure
More informationSupporting Fully Adaptive Routing in InfiniBand Networks
XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationVariable Independence and Resolution Paths for Quantified Boolean Formulas
Variable Inepenence an Resolution Paths for Quantifie Boolean Formulas Allen Van Geler http://www.cse.ucsc.eu/ avg University of California, Santa Cruz Abstract. Variable inepenence in quantifie boolean
More informationDesign Principles for Practical Self-Routing Nonblocking Switching Networks with O(N log N) Bit-Complexity
IEEE TRANSACTIONS ON COMPUTERS, VOL. 46, NO. 10, OCTOBER 1997 1 Design Principles for Practical Self-Routing Nonblocking Switching Networks with O(N log N) Bit-Complexity Te H. Szymanski, Member, IEEE
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stoylar arxiv:15.4984v1 [cs.ni] 27 May 21 Abstract
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationConsidering bounds for approximation of 2 M to 3 N
Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for
More informationQuestions? Post on piazza, or Radhika (radhika at eecs.berkeley) or Sameer (sa at berkeley)!
EE122 Fall 2013 HW3 Instructions Recor your answers in a file calle hw3.pf. Make sure to write your name an SID at the top of your assignment. For each problem, clearly inicate your final answer, bol an
More informationAdjusted Probabilistic Packet Marking for IP Traceback
Ajuste Probabilistic Packet Marking for IP Traceback Tao Peng, Christopher Leckie, an Kotagiri Ramamohanarao 2 ARC Special Research Center for Ultra-Broaban Information Networks Department of Electrical
More informationOne-to-Many Multicast Restoration Based on Dynamic Core-Based Selection Algorithm in WDM Mesh Networks
Proceeings of the International MultiConference of Engineers an Computer Scientists 9 Vol I IMECS 9, March 18 -, 9, Hong Kong One-to-Many Multicast Restoration Base on Dynamic Core-Base Selection Algorithm
More informationAll-to-all Broadcast for Vehicular Networks Based on Coded Slotted ALOHA
Preprint, August 5, 2018. 1 All-to-all Broacast for Vehicular Networks Base on Coe Slotte ALOHA Mikhail Ivanov, Frerik Brännström, Alexanre Graell i Amat, an Petar Popovski Department of Signals an Systems,
More informationOptimal Routing and Scheduling for Deterministic Delay Tolerant Networks
Optimal Routing an Scheuling for Deterministic Delay Tolerant Networks Davi Hay Dipartimento i Elettronica olitecnico i Torino, Italy Email: hay@tlc.polito.it aolo Giaccone Dipartimento i Elettronica olitecnico
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 informationNon-Uniform Sensor Deployment in Mobile Wireless Sensor Networks
01 01 01 01 01 00 01 01 Non-Uniform Sensor Deployment in Mobile Wireless Sensor Networks Mihaela Carei, Yinying Yang, an Jie Wu Department of Computer Science an Engineering Floria Atlantic University
More informationd 3 d 4 d d d d d d d d d d d 1 d d d d d d
Proceeings of the IASTED International Conference Software Engineering an Applications (SEA') October 6-, 1, Scottsale, Arizona, USA AN OBJECT-ORIENTED APPROACH FOR MANAGING A NETWORK OF DATABASES Shu-Ching
More informationSection 19. Thin Prisms
Section 9 Thin Prisms 9- OPTI-50 Optical Design an Instrumentation I opyright 08 John E. Greivenkamp Thin Prism Deviation Thin prisms introuce small angular beam eviations an are useful as alignment evices.
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationSection 20. Thin Prisms
OPTI-0/0 Geometrical an Instrumental Optics opyright 08 John E. Greivenkamp 0- Section 0 Thin Prisms Thin Prism Deviation Thin prisms introuce small angular beam eviations an are useful as alignment evices.
More informationAlgorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
Algorithm for Intermoal Optimal Multiestination Tour with Dynamic Travel Times Neema Nassir, Alireza Khani, Mark Hickman, an Hyunsoo Noh This paper presents an efficient algorithm that fins the intermoal
More informationOptimal Link Capacity Dimensioning in Proportionally Fair Networks
Optimal Link Capacity Dimensioning in Proportionally Fair Networks Micha l Pióro 1,Gábor Malicskó 2, an Gábor Foor 3 1 Department of Communication Systems, Lun Institute of Technology, Sween, Michal.Pioro@telecom.lth.se
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationFrequent Pattern Mining. Frequent Item Set Mining. Overview. Frequent Item Set Mining: Motivation. Frequent Pattern Mining comprises
verview Frequent Pattern Mining comprises Frequent Pattern Mining hristian Borgelt School of omputer Science University of Konstanz Universitätsstraße, Konstanz, Germany christian.borgelt@uni-konstanz.e
More informationPerformance Modelling of Necklace Hypercubes
erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract
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 informationA Duality Based Approach for Realtime TV-L 1 Optical Flow
A Duality Base Approach for Realtime TV-L 1 Optical Flow C. Zach 1, T. Pock 2, an H. Bischof 2 1 VRVis Research Center 2 Institute for Computer Graphics an Vision, TU Graz Abstract. Variational methos
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 informationProbabilistic Medium Access Control for. Full-Duplex Networks with Half-Duplex Clients
Probabilistic Meium Access Control for 1 Full-Duplex Networks with Half-Duplex Clients arxiv:1608.08729v1 [cs.ni] 31 Aug 2016 Shih-Ying Chen, Ting-Feng Huang, Kate Ching-Ju Lin, Member, IEEE, Y.-W. Peter
More informationSoftware Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency
Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science
More informationUNIT 9 INTERFEROMETRY
UNIT 9 INTERFEROMETRY Structure 9.1 Introuction Objectives 9. Interference of Light 9.3 Light Sources for 9.4 Applie to Flatness Testing 9.5 in Testing of Surface Contour an Measurement of Height 9.6 Interferometers
More informationRobust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks
Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,
More informationOn the Role of Multiply Sectioned Bayesian Networks to Cooperative Multiagent Systems
On the Role of Multiply Sectione Bayesian Networks to Cooperative Multiagent Systems Y. Xiang University of Guelph, Canaa, yxiang@cis.uoguelph.ca V. Lesser University of Massachusetts at Amherst, USA,
More informationPolitecnico di Torino. Porto Institutional Repository
Politecnico i Torino Porto Institutional Repository [Proceeing] Automatic March tests generation for multi-port SRAMs Original Citation: Benso A., Bosio A., i Carlo S., i Natale G., Prinetto P. (26). Automatic
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationTable-based division by small integer constants
Table-base ivision by small integer constants Florent e Dinechin, Laurent-Stéphane Diier LIP, Université e Lyon (ENS-Lyon/CNRS/INRIA/UCBL) 46, allée Italie, 69364 Lyon Ceex 07 Florent.e.Dinechin@ens-lyon.fr
More informationControl of Scalable Wet SMA Actuator Arrays
Proceeings of the 2005 IEEE International Conference on Robotics an Automation Barcelona, Spain, April 2005 Control of Scalable Wet SMA Actuator Arrays eslie Flemming orth Dakota State University Mechanical
More information