A game theory and BCC based flexible QoS unicast routing scheme

被引：0

作者：

Wang, Xingwei ^{[1
]}

Han, Lin ^{[1
]}

Huang, Min ^{[1
]}

机构：

[1] Northeastern Univ, Sch Informat Sci & Engn, Shenyang, Liaoning, Peoples R China

来源：

2007 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-10, PROCEEDINGS | 2007年

关键词：

D O I：

10.1109/CEC.2007.4424782

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

QoS (Quality of Service) routing is essential in NGI (Next Generation Internet). Due to difficulty on the exact expression of the user QoS requirements, the flexible QoS should be supported. In addition, with gradual commercialization of network operation, the benefit conflicts between the network provider and the user ask the so called win-win to be supported. In this paper, the knowledge of the fuzzy mathematics, game theory and artificial life computing method is introduced to design a flexible QoS unicast routing scheme. Based on BCC (Bacteria Colony Chemotaxis), it searches for a QoS unicast path with Pareto optimum under Nash equilibrium between the network provider utility and the user utility achieved or approached. Simulation results have shown that the proposed scheme is both feasible and effective with better performance.

引用

页码：2479 / 2484

页数：6

共 27 条

[1]

AO X, 2006, J BEIJING U POSTS TE, V29, P168

[2]

BAROLLI L, 2002, IEEE COMPUTER SOC, V8, P7

[3] A market managed multi-service Internet (M3I) [J].

Briscoe, B ;

Darlagiannis, V ;

Heckman, O ;

Oliver, H ;

Siris, V ;

Songhurst, D ;

Stiller, B .

COMPUTER COMMUNICATIONS, 2003, 26 (04) :404-414

[4]

CARLOS AS, 2005, COMPUTERS OPERATIONS, V32, P1953

[5]

Cormen T. H., 2001, Introduction to Algorithms, V2nd

[6]

Cui Yong, 2003, Journal of Software, V14, P877

[7]

GELENBE E, 2004, 19 INT S COMP INF SC, P1

[8]

GUO XB, 2002, MICROECONOMICS

[9]

JIAN Z, 2001, J CHINA I COMMUNICAT, V22, P30

[10]

Kim M, 2004, LECT NOTES COMPUT SC, V3046, P56

← 1 2 3 →