Construction of Service Composition Chain Relying on Atomic Capacity over Re-SCNet

被引:0
作者
Zhao, Dan [1 ]
Lan, Julong [1 ]
Cheng, Guozhen [1 ]
Wang, Peng [1 ]
机构
[1] Natl Digital Switching Syst Engn & Technol Res Ct, Zhengzhou, Henan, Peoples R China
来源
2016 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER AND COMMUNICATIONS (ICCC) | 2016年
基金
中国国家自然科学基金;
关键词
next generation networking; customer service; combination chain; dynamic programming; NetFPGA-10G; INTERNET; NETWORKS;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Aiming at the flexibility, mobility, scalability and other problems in current existing network architectures, this paper proposes a Reconfigurable Service-Centric Network(Re-SCNet) architecture to meet the needs of mass diverse customer service of the future network. Network function combination is one of the main directions to enhance the adaptability of the Internet. Re-SCNet mainly concentrates on the following three points: firstly, decomposes the network layer and transport layer into the atomic capacities which is fine-grained building blocks; Secondly, builds combination chains by combining atomic capacities dynamically inside the node in an optimal way, then forms reliable AS which can be identified and invoked by network business. Finally, a nonlinear integer optimal problem is formulated for the composition of atomic capacities driven by users' requests, and the dynamic programming(DP) algorithm is proposed to reach an appropriate balance between computation costs and optimal solutions. We implement the prototype system based on innovation experiment platform NetFPGA-lOG of reconfigurable network and verify the feasibility of Re-SCNet, simulation results show that DP has a better performance in time consuming, the number of iterations, and the utility value.
引用
收藏
页码:2503 / 2510
页数:8
相关论文
共 25 条
[1]  
Aldrin S., 2014, SERVICE FUNCTION CHA
[2]   Overcoming the Internet impasse through virtualization [J].
Anderson, T ;
Peterson, L ;
Shenker, S ;
Turner, J .
COMPUTER, 2005, 38 (04) :34-+
[3]   A Brief Overview of the NEBULA Future Internet Architecture [J].
Anderson, Tom ;
Birman, Ken ;
Broberg, Robert ;
Caesar, Matthew ;
Comer, Douglas ;
Cotton, Chase ;
Freedman, Michael J. ;
Haeberlen, Andreas ;
Ives, Zachary G. ;
Krishnamurthy, Arvind ;
Lehr, William ;
Loo, Boon Thau ;
Mazieres, David ;
Nicolosi, Antonio ;
Smith, Jonathan M. ;
Stoica, Ion ;
van Renesse, Robbert ;
Walfish, Michael ;
Weatherspoon, Hakim ;
Yoo, Christopher S. .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2014, 44 (03) :81-86
[4]  
Aziziyeh A., 2011, 10 ACM WORKSH HOT TO, V634, P879
[5]  
Bhatti N. T., 1995, Computer Communication Review, V25, P138, DOI 10.1145/217391.217424
[6]   A tutorial on geometric programming [J].
Boyd, Stephen ;
Kim, Seung-Jean ;
Vandenberghe, Lieven ;
Hassibi, Arash .
OPTIMIZATION AND ENGINEERING, 2007, 8 (01) :67-127
[7]   From protocol stack to protocol heap role-based architecture [J].
Braden, R ;
Faber, T ;
Handley, M .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2003, 33 (01) :17-22
[8]  
Chandrashekar J., 2003, SERVICE ORIENTED COM, V89, P2292
[9]   Configuring sessions in programmable networks [J].
Choi, S ;
Turner, J ;
Wolf, T .
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING, 2003, 41 (02) :269-284
[10]   Tussle in cyberspace: Defining tomorrow's Internet [J].
Clark, DD ;
Wroclawski, J ;
Sollins, KR ;
Braden, R .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (03) :462-475