Abstract:There are many service paths which can satisfy the business requirements in polymorphic routing model of reconfigurable networks. For the issue of the best service path selection, this paper proposes a distributed service path selection algorithm under central control. Each node generates routing tables based on the first function and destination node in service request. The controller monitors the network in real time, regulates paths with high costs and balances the bandwidths and loads of the network. Performance analysis and simulation results show that, the distributed routing tables can generate efficient service paths and the convergence time is proportional to the number of functions. When the proportion of central control is 30 percent, the algorithm has a good performance on average cost of paths and load balance. The response delay to service request decreases almost 50 percent compared with other algorithms.
李丹, 兰巨龙, 王鹏, 胡宇翔. 一种集中调控的分布式服务路径选择算法[J]. 电子与信息学报, 2018, 40(4): 785-793.
LI Dan, LAN Julong, WANG Peng, HU Yuxiang. Distributed Service Path Selection Algorithm under Central Control. JEIT, 2018, 40(4): 785-793.
BERNSTEIN P A. Middleware: A model for distributed system services[J]. Communications of the ACM, 1996, 39(2): 86-98. doi:10.1145/230798.230809
[2]
CHU Y H, RAO S G, SESHAN S, et al. A case for end system multicast[J]. IEEE Journal on Selected Areas in Communications, 2002, 20(8): 1456-1471. doi: 10.1109/JSAC. 2002.803066.
[3]
GOLLE P, LEYTON-BROWN K, MIRONOV I, et al. Incentives for Sharing in Peer-to-Peer Networks[M]. Electronic Commerce. Springer Berlin Heidelberg, 2001: 75-87. doi: 10.1007/3-540-45598-1_9
[4]
PERREY R and LYCETT M. Service-oriented architecture [C]. 2003 IEEE Symposium on Applications and the Internet Workshops, Orlando, USA, 2003: 116-119. doi: 10.1109/ SAINTW.2003.1210138
LAN Julong, CHENG Dongnian, and HU Yuxiang. Research on reconfigurable information communication basal network architecture[J]. Journal on Communications, 2014, 35(1): 128-139. doi: 10.3969/j.issn.1000-436x.2014.01.015.
HU Yuxiang, DONG Fang, WANG Peng, et al. Research on polymorphic routing mechanism for customized diversified services[J]. Journal on Communications, 2015, 36(7): 48-59. doi: 10.11959/j.issn.1000-436x.2015096.
[7]
XIAO J and BOUTABA R. QoS-aware service composition and adaptation in autonomic communication[J]. IEEE Journal on Selected Areas in Communications, 2005, 23(12): 2344-2360.
[8]
WANG P, LAN J, ZHANG X, et al. Dynamic function composition for network service chain: Model and optimization[J]. Computer Networks, 2015, 92: 408-418. doi: 10.1016/j.comnet.2015.07.020.
[9]
LEE K, YOON H, and PARK S. A service path selection and adaptation algorithm in service-oriented network virtualization architecture[C]. 2013 IEEE International Conference on Parallel and Distributed Systems (ICPADS), Seoul, South Korea, 2013: 516-521. doi: 10.1109/ICPADS. 2013.93.
[10]
PAIK I, CHEN W, and HUHNS M N. A scalable architecture for automatic service composition[J]. IEEE Transactions on Services Computing, 2014, 7(1): 82-95. doi: 10.1109/TSC. 2012.33.
[11]
GHEZZI C, PANZICA LA MANNA V, MOTTA A, et al. Performance-driven dynamic service selection[J]. Concurrency and Computation: Practice and Experience, 2015, 27(3): 633-650. doi: 10.1002/cpe.3259.
[12]
CHOI S, TURNER J, and WOLF T. Configuring sessions in programmable networks[J]. Computer Networks, 2003, 41(2): 269-284. doi: 10.1016/S1389-1286(02)00396-1.
[13]
BARI F, CHOWDHURY S R, AHMED R, et al. Orchestrating virtualized network functions[J]. IEEE Transactions on Network and Service Management, 2016, 13(4): 725-739. doi:10.1109/TNSM.2016.2569020.
[14]
RAMAN B and KATZ R H. Load balancing and stability issues in algorithms for service composition[C]. Twenty- Second IEEE Annual Joint Conference of the IEEE Computer and Communications. San Francisco, USA, 2003, Vol. 2: 1477-1487. doi: 10.1109/INFCOM.2003.1208983.
[15]
HUANG X, GANAPATHY S, and WOLF T. A distributed routing algorithm for networks with data-path services[C]. 2008 Proceedings of IEEE 17th International Conference on Computer Communications and Networks. St. Thomas, USA, 2008: 1-7. doi: 10.1109/ICCCN.2008.ECP.32.
[16]
VISSICCHIO S, TILMANS O, VANBEVER L, et al. Central control over distributed routing[J]. ACM SIGCOMM Computer Communication Review, 2015, 45(4): 43-56. doi: 10.1145/2829988.2787497.
[17]
CARIA M, JUKAN A, and HOFFMANN M. SDN partitioning: A centralized control plane for distributed routing protocols[J]. IEEE Transactions on Network and Service Management, 2016, 13(3): 381-393. doi: 10.1109/ TNSM.2016.2585759
[18]
GU X, NAHRSTEDT K, and YU B. SpiderNet: An integrated peer-to-peer service composition framework[C]. 13th IEEE International Symposium on High performance Distributed Computing, Honolulu, USA, 2004: 110-119. doi: 10.1109/HPDC.2004.1323507.
[19]
GU X and NAHRSTEDT K. Distributed multimedia service composition with statistical QoS assurances[J]. IEEE Transactions on Multimedia, 2006, 8(1): 141-151. doi: 10.1109/TMM.2005.861284.
[20]
GU X and NAHRSTEDT K. On composing stream applications in peer-to-peer environments[J]. IEEE Transactions on Parallel and Distributed Systems, 2006, 17(8): 824-837. doi: 10.1109/TPDS.2006.107.
[21]
LEE K and PARK S. A service path selection and adaptation algorithm for QoS assurance and load balancing in context- aware service overlay networks[J]. International Journal of Web and Grid Services, 2015, 11(3): 265-282. doi: 10.1504/ IJWGS.2015.070963.
[22]
CANFORA G, DI PENTA M, ESPOSITO R, et al. QoS-aware replanning of composite web services[C]. IEEE International Conference on Web Services (ICWS'05), Orlando, USA, 2005: 121-129. doi: 10.1109/ICWS.2005.96.
[23]
FRANCIOS P and BONAVENTURE O. Avoiding transient loops during the convergence of link-state routing protocols [J]. IEEE/ACM Transactions on Networking (TON), 2007, 15(6): 1280-1292. doi: 10.1109/TNET.2007.902686.
[24]
SALAMA H F. Multicast Routing for Real-time Communication of High-speed Networks[M]. Raleigh, USA, North Carolina State University, 1996: 198.