IP Routing. Overview Static routing Default routing Dynamic routing.
Routing, Flow, and Capacity Design in Communication &...
Transcript of Routing, Flow, and Capacity Design in Communication &...
![Page 1: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/1.jpg)
RFaCD, dm, figs/tables
Technology-Related Examples
Nelson Fonseca
![Page 2: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/2.jpg)
RFaCD, dm, figs/tables
Chapter 3: Technology-Related Modeling Examples
•Routing, Flow, and Capacity Design in Communication & Computer Networks by Michal Pioro and Deepankar Medhi
•Permission to reproduce the figures in this file was given by Deepankar Medhi
![Page 3: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/3.jpg)
RFaCD, dm, figs/tables
IP Networks:Intra-Domain Traffic
Engineering
![Page 4: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/4.jpg)
RFaCD, dm, figs/tables
IP Networks:Intra-Domain Traffic
Engineering• How to minimize the delay for packets
transversing through the networks?• How to determine (costs) of links so that
the shortest paths are determined in a way minimizing the delay as an overall network goal?
• How to formulate the problem of minimizing the maximum link utilization given under routing policies imposed by OSPF and IS-IS?
![Page 5: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/5.jpg)
IP Networks
Intra-Domain Traffic Engineering (3.1.1)• indices
d = 1, 2, ..., D demandsp = 1, 2, ..., Pd candidate paths for flows realizing demand d
e = 1, 2, ..., E links• constants
ce capacity of link e
δedp = 1, if link e belongs to path p realizing demand d; 0, otherwisehd volume of demand d
• variableswe metric of link e, w = (w1, w2, ..., wE) (primary)xdp(w) flow allocated to path p of demand d determined by the link system w
ye(w) load of link e determined by the link system w
r maximum link utilization variable, r = maxe=1,...,E
�
ye(w)/ce
�
• The problem of minimizing the maximum link utilization can be formulated as
minimizew ,r F = r
subject to�
pxdp(w) = hd d = 1, 2, ..., D�
d
�
pδedpxdp(w) ≤ cer e = 1, 2, ..., E
r continuouswe non-negative integers.
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.2/16
![Page 6: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/6.jpg)
RFaCD, dm, figs/tables
MPLS Networks: Tunneling Optimization
![Page 7: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/7.jpg)
RFaCD, dm, figs/tables
MPLS Networks: Tunneling Optimization
• End-to-end virtual paths of predefined capacities to different streams associated to different service classes
• How to carry different traffic classes in an MPLS network through the creation of tunnels in such a way that the number of tunnels on each MPLS router/link is minimized and balanced?
![Page 8: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/8.jpg)
MPLS Networks
Tunneling Optimization (3.2.1 )
• indicesd = 1, 2, ..., D demandsp = 1, 2, ..., Pd number of possible tunnels for demand d
e = 1, 2, ..., E links• constants
ce capacity of link e
δedp = 1, if link e belongs to tunnel p realizing demand d; 0, otherwisehd volume of demand d
• variablesxdp fraction of the demand volume d carried over tunnel p
ε lower bound on fraction of flow on a tunnel (path)udp = 1, to denote selection of a tunnel if the lower bound is satisfied; 0, otherwiser maximum number of tunnels over all links.
(Contd.)
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.3/16
![Page 9: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/9.jpg)
MPLS Networks
Tunneling Optimization (3.2.1)
(Contd.)• The problem of minimizing the number of tunnels on each MPLS router/link and
load balancing in an MPLS network can be formulated as
minimizex ,u ,r F = r
subject to
�
pxdp = 1 d = 1, 2, ..., D
�
dhd
�
pδedpxdp ≤ ce e = 1, 2, ..., E
εudp ≤ hdxdp d = 1, 2, ..., D p = 1, 2, ..., Pd
xdp ≤ udp d = 1, 2, ..., D p = 1, 2, ..., Pd�
d
�
pδedpudp ≤ r e = 1, 2, ..., E
xdp continuous and non-negativeudp binary, r integer.
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.4/16
![Page 10: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/10.jpg)
RFaCD, dm, figs/tables
ATM Networks: Virtual Path Design
![Page 11: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/11.jpg)
RFaCD, dm, figs/tables
ATM Networks: Virtual Path Design
• Permanent and semi-permanent virtual paths with guaranteed data rates
• How to determine link capacity so that the total link cost is minimized given that the ATM virtual path demand requirement and so that link capacacity can be in modular units such as 155 Mbps?
![Page 12: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/12.jpg)
ATM Networks
Virtual Path Design (3.3.2)• indices
d = 1, 2, ..., D demandsp = 1, 2, ..., Pd number of possible paths for a virtual path (VP) for demand d
e = 1, 2, ..., E links• constants
δedp = 1, if VP path p for demand d uses link e; 0, otherwisehd volume of demand d (Mbps)ξe unit cost of a 155 Mbps link(LCU) on link e
M capacity unit of an ATM link (in terms of the the number of modules)• variables
udp = 1, if path p for demand d is selected link e; 0, otherwiseye capacity of link e (expressed in 155Mbps modules)
• The problem of determining the link capacity so that the total cost is minimizedgiven that the ATM virtual path demand requirement and link capacity is inmodular units (155 Mbps)
minimizeu ,y F =�
eξeye
subject to�
pudp = 1, d = 1, 2, ..., D�
dhd
�
pδedpudp ≤ Mye, e = 1, 2, ..., E
udp binary, ye integers.
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.5/16
![Page 13: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/13.jpg)
RFaCD, dm, figs/tables
Telephone NetworksSingle-busy and Multi-busy hours
Network Dimensioning
![Page 14: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/14.jpg)
RFaCD, dm, figs/tables
Telephone NetworksSingle-busy and Multi-busy hours
Network Dimensioning• Access nodes (end nodes) and digital
exchanges (switches) • Deman expressed in Erlangs• Trunk-groups of 24 (T1) or 30 (E1)
voice channels of 64 kbps• Single-busy hour – peak offered traffic
estimated over the entire day• Multi-busy hours – different offered
traffic during the day
![Page 15: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/15.jpg)
RFaCD, dm, figs/tables
Telephone NetworksSingle-busy and Multi-busy hours
Network Dimensioning• Originally fixed order of trying different
routes, in the 80’s changed with the introduction of dynamic non-hierarchical rputing (DNHR), dynamically controled routing (DHR) etc
• How to do modular capacity design given that traffic volume is different for different hours of a day, and by taking into account functional characteristics of routing scheme?
![Page 16: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/16.jpg)
Digital Circuit-Switched Telephone Networks
Single Busy-Hour Network Dimensioning (3.4.2)
• indicesd = 1, 2, ..., D demandse = 1, 2, ..., E linksp = 1, 2, ..., Pd number of available routes for demand d
• constantsδedp = 1, if link e belongs to path p realizing demand d; 0, otherwisehd volume of demand d in Erlangs(Erl)ξe unit modular capacity cost of link e
be call blocking probability for link e to maintain a certain grade of serviceM modular capacity (e.g., in T1 – 24 voice circuits, or, E1 – 30 voice circuits)
• variablesxdp flow allocated to path p of demand d
ye capacity of link e expressed as number of modules M .• The problem of determining the modular capacity needed in a network so that
offered traffic is carried with an acceptable grade -of-service can be formulated as
minimizex ,y F =
�
eξeye
subject to
�
pxdp = hd, d = 1, 2, ..., D
Fe(
�d
�pδedpxdp) ≤ Mye, e = 1, 2, ..., E
xdp continuous, non-negativeyeintegers
where Fe(a) = C(a; be). The function C(a; b) is the inverse of the Erlang blockingformula for offered load a and blocking b.Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.6/16
![Page 17: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/17.jpg)
Digital Circuit-Switched Telephone Networks
Multi Busy-Hour Network Dimensioning (3.4.3)• indices
d = 1, 2, ..., D demandse = 1, 2, ..., E linksp = 1, 2, ..., Pd number of available routes for demand d
t = 1, 2, ..., T number of traffic hour partitions• constants
hdt volume of demand d in Erlangs(Erl) for time partition (hour) t
δedpt = 1, if link e belongs to path p demand d for time partition t;= 0, otherwise
bet call blocking probability for link e for time partition t
ξe unit modular capacity cost of link e• variables
xdpt flow allocated to path p of demand d for time partition t
ye capacity of link e expressed as number of modules M .• The problem of determining the modular capacity given that traffic volume is
different for different hours of a day
minimizex ,y F =
�
eξeye
subject to
�
pxdpt = hdt, d = 1, 2, ..., D t = 1, 2, ..., T
Fet
� �d
�
pδedptxdpt
�
≤ Mye, e = 1, 2, ..., E t = 1, 2, ..., T
xdpt continuous, non-negative ye integers,
where Fet(a) = C(a; bet). The function C(a; b) is the inverse of the Erlangblocking formula for offered load a and blocking b.
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.7/16
![Page 18: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/18.jpg)
RFaCD, dm, figs/tables
SONET/SDHCapacity and Protection Design
![Page 19: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/19.jpg)
RFaCD, dm, figs/tables
SONET/SDHCapacity and Protection Design
![Page 20: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/20.jpg)
RFaCD, dm, figs/tables
SONET/SDHCapacity and Protection Design
![Page 21: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/21.jpg)
SONET/SDH Transport Networks
Capacity and Protection Design (3.5.1)• indices
d = 1, 2, ..., D demandse = 1, 2, ..., E linksp = 1, 2, ..., Pd number of available routes for demand d
• constantsδedp = 1, if link e belongs to path p realizing demand d; 0, otherwisehd volume of demand d in term,s of VC-12sξe cost of one LCU(STM-1 system ) on link e
M= 63 (Each STM-1 module can carry 63 VC-12 containers)• variables
xdp flow allocated to path p of demand d
ye capacity of link e (expressed in STM-1 modules)
• The SDH transport network capacity design problem can be formulated asfollows :
minimizex ,y F =
�
eξeye
subject to
�
pxdp = hd, d = 1, 2, ..., D
�
d
�pδedpxdp ≤ Mye, e = 1, 2, ..., E
xdp, ye non-negative integers
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.8/16
![Page 22: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/22.jpg)
SONET/SDH Transport Networks
Capacity and Protection Design (3.5.2)
• indicesd = 1, 2, ..., D demandse = 1, 2, ..., E linksp = 1, 2, ..., Pd number of available routes for demand d
• constantsδedp = 1, if link e belongs to path p realizing demand d; 0, otherwisehd volume of demand d in term,s of VC-12sξen cost of one transmission system STM-n realized on link e
Mn = 63 n, the modularity of STM-n system• variables
xdp flow allocated to path p of demand d
yen number of STM-n systems realized on link e
• The SDH transport network capacity design problem that differentiates costs ofSTM modules can be formulated as follows :
minimizex ,y F =
�
e
�
nξenyen
subject to
�
pxdp = hd, d = 1, 2, ..., D
�
d�
pδedpxdp ≤
�
nMnyen, e = 1, 2, ..., E
xdp, yen non-negative integers
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.9/16
![Page 23: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/23.jpg)
SONET/SDH Transport Networks
Capacity and Protection Design (3.5.5)
• indicesd = 1, 2, ..., D demandse = 1, 2, ..., E linksq = 1, 2, ..., Qe list of restoration paths available for link e
• constantsξe unit cost of link e
hd volume of demand d in Erlangs(Erl)ce capacity of link e
βfeq =1, if link f belongs to path q restoring link; 0, otherwise• variables
ye protection capacity of link e
zfq capacity restored by path q that restores link f
• The problem of minimizing the cost of the necessary link protection capacity canbe formulated as follows :
minimizez ,y F =
�
eξeye
subject to
�
qzeq = ce, e = 1, 2, ..., E
�
e�
qβfekzeq = yf , f = 1, ..., E, e = 1, 2, ..., E, f 6= e
zeq , ye non-negative integers.
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.10/16
![Page 24: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/24.jpg)
RFaCD, dm, figs/tables
SONET/SDH RINGS: RING BANDWIDTH DESIGN
![Page 25: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/25.jpg)
RFaCD, dm, figs/tables
SONET/SDH RINGS: RING BANDWIDTH DESIGN
• Restoration intrinsic to network functionality: < 50 ms restoration capability from single-link failure
• ADM nodes capable of extracting containers• Given the inherent routing nature of a
SONET/SDH ring and the demand volume, how do we determine what is the minimal number and type of (parallel) rings needed?
![Page 26: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/26.jpg)
RFaCD, dm, figs/tables
SONET/SDH RINGS: RING BANDWIDTH DESIGN
![Page 27: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/27.jpg)
SONET/SDH Rings
Ring Bandwidth Design (3.6.1)
• indicesv = 1, 2, ..., V nodese = 1, 2, ..., E segments
• constantshvw demand volume between nodes v and w, with v < w
M Modularity of the STM systemδevw = 1, if v ≤ e < w ; 0, otherwise
• variablesuvw flow on the clockwise path from w to v
zvw flow on the clockwise path from v to w
• The problem of determining the minimal number and type of (parallel) ringsneeded can be formulated as
minimizeu ,z ,r r
subject to uvw + zvw = hvw, v, w = 1, 2, ..., V, v < w
δevwuvw + (1 − δevw)zvw ≤ Mr, e = 1, 2, ..., E
uvw, zvw, r non-negative integers.
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.11/16
![Page 28: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/28.jpg)
RFaCD, dm, figs/tables
WDM Networks:Restoration Design
![Page 29: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/29.jpg)
RFaCD, dm, figs/tables
WDM Networks:Restoration Design
• Wavelengths typically carries 10 Gbps (1 DVU = 10 Gbps)
• Optical cross connect with and without wavelength conversion
• A light-path (route) can use different colours
![Page 30: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/30.jpg)
WDM Networks
Restoration Design with Optical Cross-Connects (3.7.1)• indices
c = 1, 2, ..., C colorse = 1, 2, ..., E linksv = 1, 2, ..., V nodess = 0, 1, ..., S failure situations
• constantshds (d = 1, 2, ..., D) volume of demand d to be realized in situation s,ξe (e = 1, 2, ..., E) cost of one LCU (i.e., optical fibre) on link e
αes = 0 if link e is failed in situation s ; 1, otherwiseδedp = 1 if link e belongs to path p realizing demand d, ; 0, otherwiseθdps =0 if path p of demand d is failed in situation s ; 1, otherwise
• variablesxdpc flow (number of light-paths) realizing demand d in color c on path p
zce number of times the color c is used on link e
ye capacity of link e expressed in the number of fibers• The optimization problem for the OXCs without wavelength conversion can be
formulated asminimizex ,z ,y F =
�eξeye
subject to�
pθdps
�
cxdpc ≥ hds, d = 1, 2, ..., D s = 0, 1, 2, ..., S�
d
�
pδedpxdpc = zce, c = 1, ..., C, e = 1, 2, ..., E
ye ≥ zce, c = 1, ..., C, e = 1, 2, ..., E.
xdpc, zce, yes non-negative integersDeep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.12/16
![Page 31: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/31.jpg)
WDM Networks:
Restoration Design with Optical Cross-Connects (3.7.2)
• indicesc = 1, 2, ..., C colorse = 1, 2, ..., E linksv = 1, 2, ..., V nodess = 0, 1, ..., S failure situations
• constantshds volume of demand d to be realized in situation s,ξe cost of one LCU (i.e., optical fibre) on link e
κe link opening cost for the link e
αes = 0 if link e is failed in situation s ; 1, otherwiseδedp = 1 if link e belongs to path p realizing demand d, ; 0, otherwiseθdps =0 if path p of demand d is failed in situation s ; 1, otherwise
• variablesxdpc flow (number of light-paths) realizing demand d in color c on path p
zce number of times the color c is used on link e
ye capacity of link e expressed in the number of fibersue =0 if the link e is installed; 1, otherwise
(Contd.)
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.13/16
![Page 32: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/32.jpg)
WDM Networks
Restoration Design with Optical Cross-Connects (3.7.2)
(Contd.)• The optimization problem for the OXCs without wavelength conversion that takes
in to account the link opening costs can be formulated as
minimizex ,z ,y ,u F =
�
e (ξeye + κeue)
subject to
�
pθdps
�
cxdpc ≥ hds, d = 1, 2, ..., D s = 0, 1, 2, ..., S
�
d
�
pδedpxdpc = zce, c = 1, ..., C, e = 1, 2, ..., E
ye ≥ zce, c = 1, ..., C, e = 1, 2, ..., E
ye ≤ Mue, e = 1, 2, ..., E.
xdpc, zce, yes non-negative integersM is a large number
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.14/16
![Page 33: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/33.jpg)
RFaCD, dm, figs/tables
IPIP
IP
IP
IP
IPIP
CKT SWCKT SW
CKT SW
CK SW
CKT SW
CKT SW
CKT SWDS1,DS3
OC-3/OC-12
PCMVoice
DCS3/1
DCS3/1
DCS3/1
DCS3/1IP
Layer
OET = OTS End TerminalOTS = Optical Transport System
DigitalTransmission
Layer
ADM
ADMADM
ADMADM
Bi-Ring
FT Series GLinear Sys
ADM
ADM
ADM
ADMBi-Ring
DS3,OC-3
OC-48
DCSLayer(s)
DCS3/3
DCS3/3
DCS3/3
DCS3/3
DS3/OC-3
DS3
OpticLayerOET
Optical MuxSignal
OET
OET
OETOET
OET
OET
OET
OETOET
OC-48
MediaLayer
Fiber Conduit/Sheath
CircuitSwitched
Layer
CKT SW(LEC)
DS-1/T1
IP
IP DCS1/0
DCS1/0
DCS1/0
DCS1/0 DS1
DS-0Private Line
ADMDS-3/T3
OC-3/OC-12
OC-48
Internet
DS3/STS-1
![Page 34: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/34.jpg)
RFaCD, dm, figs/tables
IP Over SONET
![Page 35: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/35.jpg)
RFaCD, dm, figs/tables
IP over SONET• Given an IP intra-domain network and
that the IP links are realized as transmission paths over a capacitated SONET network, how do we determine capacity required for the IP links, and the routing of these links in the SONET network in an integrated manner to minimize the IP network cost?
![Page 36: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/36.jpg)
IP Over SONET: Combined Two-Layer Design (3.8.1)
• indicesd = 1, 2, ..., D demandse = 1, 2, ..., E linksq = 1, 2, ..., Qe list of candidate paths for link e
• constantscg capacity of link g in the SONET network expressed in OC-48 modulesδedp = 1, if link e belongs to path p realizing demand d; 0, otherwisehd volume of demand d
ξe link termination cost by the cost of the OC-3 interfaces at the end routers of link e
ζeq routing cost at the SONET layerρ link utilization coefficientM =size of the link capacity in IP network(e.g., 155.52 Mbps)N =size of the link capacity in SONET network (e.g., 2,488.32 Mbps)
• variableswe metric of link e, w = (w1, w2, ..., wE)
xdp(w) flow allocated to path p of demand d determined by the link system w
ye modular capacity of the IP layer link e
zeq flow allocated to path q realizing capacity link e
γgeq =1, if path q on the transport layer for demand e uses link g ; and 0, otherwise
(Contd.)
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.15/16
![Page 37: Routing, Flow, and Capacity Design in Communication & Computernfonseca/pisa2007/download/optimum2… · Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication](https://reader033.fdocuments.us/reader033/viewer/2022060818/60971488ff434209c4560f8d/html5/thumbnails/37.jpg)
IP Over SONET: Combined Two-Layer Design (3.8.1)
(Contd.)• The problem to determine the capacity required for the IP links, and the routing of
these links in the SONET network in an integrated manner to minimize the IPnetwork cost can be formulated as
minimizew ,y ,z
�
eξeye +
�
e
�
qζeqzeq
subject to
�
pxdp(w) = hd, d = 1, 2, ..., D
�
d
�
pδedpxdp(w) ≤ ρMye, e = 1, 2, ..., E
�
q
�
czeq = ye, e = 1, 2, ..., E
�
eM
�
qγgeqzeq ≤ Ncg , g = 1, 2, ..., G
we non-negative integerye, zeq non-negative integer .
Deep Medhi/Version August 2005 Routing, Flow, and Capacity Design in Communication and Computer Networks – p.16/16