A Fair Admission Control for Differentiated Servicein Traffic Groomed Optical NetworksReporter:Yuan_Bin HsuDate:2008_09_11**DCNLab

DCNLab

OutlineIntroductionRelative workMotivationMethodologyConclusion

**DCNLab

DCNLab

Introduction(1/4) 2.5Gb/s 10 Gb/s (WDM) (Grooming)

**DCNLab

DCNLab

Introduction(2/4)(traffic grooming)**DCNLab

DCNLab

Introduction(3/4)

**DCNLab

DCNLab

Introduction(4/4)(CAC)**DCNLab

DCNLab

Relative work(CAC):Bandwidth reserve Maximum revenue Capacity fairness **DCNLab

DCNLab

Bandwidth reserve(1/2)Complete partition**DCNLab

DCNLab

Bandwidth reserve(2/2)Threshold setting

**DCNLab

DCNLab

Maximum revenue(1/2)**DCNLab

DCNLab

Maximum revenue(2/2)[13]CAC

**DCNLab

DCNLab

Capacity fairness(1/2)mnnm:1-(1-Pm)n=1-(1-Pn) mj 1 j Pj'=1j 1Pj

**DCNLab

DCNLab

Capacity fairness(2/2)Accept the call if

Else reject the call with

Fairness ratio

warm time

**DCNLab

DCNLab

Motivation

**DCNLab

DCNLab

MethodologyIn WDM grooming networkWTkt1,t2,.,tk:Classk Poisson Classk **DCNLab

DCNLab

MethodologySingle-wavelength and single-hop sub-system network model**DCNLab

DCNLab

MethodologyMDP- A single-wavelength link nk Classk :

tkk -1kk**DCNLab

DCNLab

Methodologyk Bfk k :

k nk- Bfk

**DCNLab

DCNLab

MethodologySTATEt k [15](Uniformization technique)**DCNLab

DCNLab

Methodologyi**DCNLab

DCNLab

State i

State b

State c

State d

State a

Vib

Via

Vid

Vic

Uniformization

State i

State b

State c

State d

State a

Vib/Vmax

Via/Vmax

Vid/Vmax

Vic/Vmax

Vi = Via+Vib+Vic+VidVmax >= MAX{Vi}

1-Vi/Vmax

Methodologyvmax

**DCNLab

DCNLab

Methodologyi :

kK

**DCNLab

DCNLab

Methodology*DCNLab*

DCNLab

State i

State j

State j

State j

j = 1

j = 2

j = S

Current State

Next State

Methodology i PLj

CACPL1/0/*DCNLab*

DCNLab

**DCNLab

DCNLab

MethodologyExample:t1=1t2=4T=8:For n2 = 0 to for n1 = 0 to create state{n1, n2}

For n2 = 0 to create state{ , n2}

For n1 = 0 to create state{ n1, } (7)**DCNLab

DCNLab

Methodology

**DCNLab

DCNLab

0,0

1,0

2,0

3,0

4,0

5,0

6,0

7,0

8,0

0,1

1,1

2,1

3,1

4,1

0,2

0,3

9,0

5,1

6,1

7,1

8,1

1,2

2,2

3,2

4,2

5,1

1,2

Methodology={4,1} ={1,1}={4,1} ={1,2}**DCNLabLoad=8

DCNLab

5,1

1,2

0,0

1,0

2,0

3,0

4,0

5,0

6,0

7,0

8,0

0,1

1,1

2,1

3,1

4,1

0,2

0,3

9,0

5,1

6,1

7,1

8,1

1,2

2,2

3,2

4,2

5,1

1,2

0,0

1,0

2,0

3,0

4,0

5,0

6,0

7,0

8,0

0,1

1,1

2,1

3,1

4,1

0,2

0,3

9,0

5,1

6,1

7,1

8,1

1,2

2,2

3,2

4,2

Methodology={8,2} ={1,1}={8,2} ={1,2}**DCNLabLoad=16

DCNLab

5,1

1,2

0,0

1,0

2,0

3,0

4,0

5,0

6,0

7,0

8,0

0,1

1,1

2,1

3,1

4,1

0,2

0,3

9,0

5,1

6,1

7,1

8,1

1,2

2,2

3,2

4,2

5,1

1,2

0,0

1,0

2,0

3,0

4,0

5,0

6,0

7,0

8,0

0,1

1,1

2,1

3,1

4,1

0,2

0,3

9,0

5,1

6,1

7,1

8,1

1,2

2,2

3,2

4,2

Methodology CACpolicy-based CAC:**DCNLab

DCNLab

Policy-based CAC Algorithm:Inputk Begin1 k s d L2 P k Pk3 For w4{5 if L g 6 {7 if L 8 {9 if PkP10 k 11 else12 k 13 }14 else15 POLICYoptimal k 16 }17 else //L k 18 {19 if L 20 k L 21 else //L 22 23 }24}25 k End**DCNLab

DCNLab

*DCNLab*

DCNLab

Conclusion:Multipath

*DCNLab*

DCNLab

*Reference[1] B. Mukherjee, et al. Traffic grooming in mesh optical networks, OFC-2004, Vol. 2,pp. 23-27, Mar. 2004.[2] K. Zhu, H. Zang, B. Mukherjee, A comprehensive study of next-generation optical grooming switches, IEEE JSAC, Vol. 21, no. 7, pp. 1173-1186, Sep. 2003.[3] A. K. Somani, Survivability and Traffic Grooming in WDM Optical Networks, Cambridge University Press 2006.[4] K. Zhu, B. Mukherjee, A Review of Traffic Grooming in WDM optical networks: Architectures and Challenges, Optical Networks Magazine, vol. 4, no. 2, pp. 55-64 , Mar./Apr. 2003.[5] C. S. R. Murthy, M. Gurusamy, WDM Optical Networks: Concepts, Design, and Algorithms, PHPTR Press, Nov. 2001.[6] M. Sivakumar, K.M. Sivalingam, S. Subramaniam, On factors affecting the performance of dynamically groomed optical WDM mesh networks , HPSR. 2005, Vol.1, pp. 411- 415 May 2005.[7] K. Zhu; H. Zhu; B. Mukherjee, Traffic engineering in multigranularity heterogeneous optical WDM mesh networks through dynamic traffic grooming, MNET , 2003, Vol. 17, no 2,pp.8-15, Mar./ Apr. 2003 .[8] K.W. ,Ross , D.H.K., Tsang , The Stochastic Knapsack Problem, IEEE Transaction on Communications, Vol. 37, no.7, pp. 740-747, July 1989.

*Reference[9] I. Cerutti, P. Sudhakar, A. Fumagalli, A Threshold-Based Blocking Differentiation Mechanism for Networks with Wavelength Continuity Constraint, Transparent Optical Networks, 2005, Vol.1, pp. 179- 182, July 2005.[10] J. Choi, T. Kwon, Y. Choi, M. Naghshineh, Call admission control for multimedia service in mobile cellular networks: a Markov decision approach, IEEE ISCC 2000, Antibes, pp. 594-599, July 2000.[11] L. Yuan-Cheng, L. Yu-Dar, A Fair Admission Control for Large-Bandwidth Multimedia Applications, ICDCSW, pp. 317-322 , 2002.[12] R, A, Howard, Dynamic Programming and Markov Process, M.I.T. Press, Cambridge,1960[13] K. Mosharaf, J. Talim, L. Lambadaris, L. Marmorkos, "Service differentiation and fairness control in WDM grooming networks", GLOBECOM 04, Vol. 3, pp.19681973, Nov. 2004.[14] S. Thiagarajan , A. K. Somani, Capacity Fairness of WDM Networks with grooming capabilities, Optical Network Magazine, Vol. 2, no. 3, pp. 24-32, May/June 2001.[15] D. P. Bertsekas, Dynamic programming deterministic and stochastic models, PHPTR Press, , Apr. 1987.[16] S. Subramaniam, R.A. Barry, Wavelength Assignment in Fixed Routing WDM Networks, ICC 97, Vol.1, pp. 406-410 , 1997.

*