基于拍卖博弈的可重构服务承载网动态构建算法

针对不同业务对有限的底层网络共享时产生竞争的问题,提出了一种基于拍卖博弈的构建模型,以业务为参与者,业务资源需求为策略空间。基于该模型,设计了基于拍卖博弈的服务承载网动态构建算法,以最大化服务承载网整体构建收益。仿真实验表明,该算法在服务承载网构建整体收益、构建成功率和网络资源占用率等方面,较其他算法具有明显优势。...

Full description

Saved in:
Bibliographic Details
Published in电信科学 Vol. 31; no. 5; pp. 82 - 87
Main Author 梁宁宁 兰巨龙 程国振 杨琴
Format Journal Article
LanguageChinese
Published 中国通信学会 01.05.2015
人民邮电出版社有限公司
国家数字交换系统工程技术研究中心 郑州450002%78006部队,成都610066
Subjects
Online AccessGet full text
ISSN1000-0801
DOI10.11959/j.issn.1000-0801.2015106

Cover

More Information
Summary:针对不同业务对有限的底层网络共享时产生竞争的问题,提出了一种基于拍卖博弈的构建模型,以业务为参与者,业务资源需求为策略空间。基于该模型,设计了基于拍卖博弈的服务承载网动态构建算法,以最大化服务承载网整体构建收益。仿真实验表明,该算法在服务承载网构建整体收益、构建成功率和网络资源占用率等方面,较其他算法具有明显优势。
Bibliography:11-2103/TN
reconfigurable service carrying network, auction game, RSCN construction revenue, service request
Liang Ningning, Lan Julong, Cheng Guozhen, Yang Qin (1. National Digital Switching System Engineering & Technological Research & Development Center, Zhengzhou 450002, China; 2. Troops 78006, Chengdu 610066, China)
Based on the competition of various applications sharing the limited substrate network resource, an algorithm of dynamic auction game-based reconfigurable service carrying network construction(DAGR) was proposed. This algorithm constructs auction game model which defines services as players and service requests as strategy space. Based on this model, the DAGR algorithm maximizes the total reconfigurable service carrying network(RSCN) revenue. Experimental results show that comparing with the existing algorithms, the proposed algorithm achieves higher construction success ratio, gains higher revenue and occupancy for substrate network.
ISSN:1000-0801
DOI:10.11959/j.issn.1000-0801.2015106