位置:成果数据库 > 期刊 > 期刊详情页
Resource scheduling virtualization in service-oriented future Internet architecture
  • ISSN号:1005-8885
  • 期刊名称:《中国邮电高校学报:英文版》
  • 分类:TP393[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术] TH165[机械工程—机械制造及自动化]
  • 作者机构:[1]State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China, [2]Beijing Key Laboratory of Network System Architecture and Convergence, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • 相关基金:supported by the National Natural Science Foundation of China (61201153); the National Basic Research Program of China (2012CB315801); the Fundamental Research Funds for the Central Universities (2013RC0118); the Prospective Research Project on Future Networks in Jiangsu Future Networks Innovation Institute (BY2013095-2-16)
中文摘要:

面向服务的未来因特网建筑学(SOFIA ) 是干净板岩的网络体系结构。在 SOFIA,一个服务请求主要通过服务分辨率和网络资源分配被处理。认识到网络资源分配,我们引用网络虚拟化的想法并且建议资源安排虚拟化。在安排虚拟化的资源,一个服务请求作为一个虚拟网络(VN ) 被提炼,网络资源被印射 VN 到物理网络上分配。资源安排虚拟化提供在一个自治系统以内安排控制的集中的资源(作为) 并且与分布式的计划相比完成更好的可控制性。而且,资源安排虚拟化也支持多地点选择。同时,我们建议基于适应不同情形的最大的资源树(MRT ) 安排算法的许多资源。根据模拟结果,建议算法在关键度量标准上显示出好性能,例如接受比率,收入,费用和利用。而且,模拟结果表明我们的算法比传统的更有效。

英文摘要:

Service-oriented future internet architecture(SOFIA) is a clean-slate network architecture. In SOFIA, a service request is mainly processed through service resolution and network resource allocation. To realize the network resource allocation, we reference the idea of network virtualization and propose resource scheduling virtualization. In resource scheduling virtualization, a service request is abstracted as a virtual network(VN) and the network resources are allocated by mapping the VN onto the physical network. Resource scheduling virtualization provides centralized resource scheduling control within an autonomous system(AS) and achieves better controllability compared with the distributed schemes. Besides, resource scheduling virtualization supports multi-site selection as well. Meanwhile, we propose a collection of resource scheduling algorithms based on maximum resource tree(MRT) adapting to different scenarios. According to the simulation results, the proposed algorithms show good performance on the key metrics, such as acceptance ratio, revenue, cost and utilization. Moreover, the simulation results reveal that our algorithm is more efficient than the traditional ones.

同期刊论文项目
期刊论文 11 会议论文 25 获奖 2 著作 2
同项目期刊论文
期刊信息
  • 《中国邮电高校学报:英文版》
  • 主管单位:高教部
  • 主办单位:北京邮电大学、南邮、重邮、西邮、长邮、石邮
  • 主编:LU Yinghua
  • 地址:北京231信箱(中国邮电大学)
  • 邮编:100704
  • 邮箱:jchupt@bupt.edu.cn
  • 电话:010-62282493
  • 国际标准刊号:ISSN:1005-8885
  • 国内统一刊号:ISSN:11-3486/TN
  • 邮发代号:2-629
  • 获奖情况:
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,波兰哥白尼索引,荷兰文摘与引文数据库,美国工程索引,美国剑桥科学文摘,英国科学文摘数据库
  • 被引量:127