Status | 已发表Published |
Title | A queuing delay utilization scheme for on-path service aggregation in services-oriented computing networks |
Creator | |
Date Issued | 2019 |
Source Publication | IEEE Access
![]() |
ISSN | 2169-3536 |
Volume | 7Pages:23816-23833 |
Abstract | In services-oriented computing networks, packets in the process of routing to a data center must wait for a sufficient amount of data before service aggregation to reduce the network transmission load. However, packets must be uploaded to the data center as soon as possible to reduce delay. With the exponential growth in the number of IoT connected devices, the wait time for packets is longer at routers due to massive amounts of data, which causes a large queuing delay. If this queuing time can be utilized for service aggregation in a service-oriented computing network, the network performance will be substantially improved. Therefore, a queuing delay utilization scheme for on-path service aggregation (SAQD) is proposed in this paper. This scheme has the following innovations: 1) SAQD fully utilizes the queuing delay of packets for service aggregation, which can effectively reduce the transmission volume and communication overhead. Based on the proposed service aggregation algorithm, packets are divided into forwarding packets and aggregating packets, and the service aggregation of aggregating packets is completed by utilizing the transmission time of forwarding packets to ensure that the transmission volume and communication overhead are effectively reduced without additional latency. 2) SAQD can effectively alleviate the traffic pressure of the data center and balance the workload of routers. By the service aggregation and intranet cache of routers, some requests for the data center can be handled by routers, which reduces the traffic pressure of the data center, especially in the peak period. Compared with conventional schemes, the experimental results demonstrate that SAQD reduces the workload of the data center by 55.8%-66.26% and provides users with a better quality of experience by reducing the request response delay by 31.33%51.41%. |
Keyword | big data Internet of things queuing delay service aggregation |
DOI | 10.1109/ACCESS.2019.2899402 |
URL | View source |
Indexed By | SCIE |
Language | 英语English |
WOS Research Area | Computer Science ; Engineering ; Telecommunications |
WOS Subject | Computer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications |
WOS ID | WOS:000460981500001 |
Scopus ID | 2-s2.0-85062735350 |
Citation statistics | |
Document Type | Journal article |
Identifier | http://repository.uic.edu.cn/handle/39GCC9TT/7158 |
Collection | Research outside affiliated institution |
Corresponding Author | Liu, Anfeng |
Affiliation | 1.School of Computer Science and Engineering, Central South University, Changsha, 410083, China 2.School of Informatics, Hunan University of Chinese Medicine, Changsha, 410208, China 3.College of Computer Science and Technology, Huaqiao University, Xiamen, 361021, China 4.Department of Electrical, Computer, Software, and Systems Engineering,Embry-Riddle Aeronautical University, Daytona Beach, 32114, United States 5.School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, 411201, China |
Recommended Citation GB/T 7714 | Huang, Mingfeng,Liu, Wei,Wang, Tianet al. A queuing delay utilization scheme for on-path service aggregation in services-oriented computing networks[J]. IEEE Access, 2019, 7: 23816-23833. |
APA | Huang, Mingfeng, Liu, Wei, Wang, Tian, Song, Houbing, Li, Xiong, & Liu, Anfeng. (2019). A queuing delay utilization scheme for on-path service aggregation in services-oriented computing networks. IEEE Access, 7, 23816-23833. |
MLA | Huang, Mingfeng,et al."A queuing delay utilization scheme for on-path service aggregation in services-oriented computing networks". IEEE Access 7(2019): 23816-23833. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment