Routing and wavelength assignment in GMPLS networks
被引:208
作者:
Hua, Y
论文数: 0引用数: 0
h-index: 0
机构:
Wuhan Univ, Sch Comp, Wuhan 430079, Peoples R ChinaWuhan Univ, Sch Comp, Wuhan 430079, Peoples R China
Hua, Y
[1
]
Xu, W
论文数: 0引用数: 0
h-index: 0
机构:
Wuhan Univ, Sch Comp, Wuhan 430079, Peoples R ChinaWuhan Univ, Sch Comp, Wuhan 430079, Peoples R China
Xu, W
[1
]
Wu, CL
论文数: 0引用数: 0
h-index: 0
机构:
Wuhan Univ, Sch Comp, Wuhan 430079, Peoples R ChinaWuhan Univ, Sch Comp, Wuhan 430079, Peoples R China
Wu, CL
[1
]
机构:
[1] Wuhan Univ, Sch Comp, Wuhan 430079, Peoples R China
来源:
PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS AND TECHNOLOGIES, PDCAT'2003, PROCEEDINGS
|
2003年
关键词:
D O I:
10.1109/PDCAT.2003.1236303
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
The Routing and Wavelength Assignment (RWA) problem is a hot spot in realizing the Quality of Service (QoS) in Generalized Multiprotocol Label Switching (GMPLS) networks. In this paper, the RWA problem is formulated as a Markov Decision Process (MDP) in order to realize the multi-class service and the resource allocation dynamically. At the same time, we put forward the blocking probability model and burst traffic model. The simulation results show that the method not only provides service differentiation but also reduces the overall average blocking probability in the burst traffic model.
引用
收藏
页码:268 / 271
页数:4
相关论文
共 6 条
[1]
CHAN K, 1994, P IEEE INFOCOM 94, P962
[2]
Harai H, 1997, IEEE INFOCOM SER, P516, DOI 10.1109/INFCOM.1997.644501