In data centers, the transmission control protocol(TCP) incast causes catastrophic goodput degradation to applications with a many-to-one traffic pattern. In this paper, we intend to tame incast at the receiver-side a...In data centers, the transmission control protocol(TCP) incast causes catastrophic goodput degradation to applications with a many-to-one traffic pattern. In this paper, we intend to tame incast at the receiver-side application. Towards this goal, we first develop an analytical model that formulates the incast probability as a function of connection variables and network environment settings. We combine the model with the optimization theory and derive some insights into minimizing the incast probability through tuning connection variables related to applications. Then,enlightened by the analytical results, we propose an adaptive application-layer solution to the TCP incast.The solution equally allocates advertised windows to concurrent connections, and dynamically adapts the number of concurrent connections to the varying conditions. Simulation results show that our solution consistently eludes incast and achieves high goodput in various scenarios including the ones with multiple bottleneck links and background TCP traffic.展开更多
Today,Internet of Things(IoT)is a technology paradigm which convinces many researchers for the purpose of achieving high performance of packets delivery in IoT applications such as smart cities.Interconnecting various...Today,Internet of Things(IoT)is a technology paradigm which convinces many researchers for the purpose of achieving high performance of packets delivery in IoT applications such as smart cities.Interconnecting various physical devices such as sensors or actuators with the Internet may causes different constraints on the network resources such as packets delivery ratio,energy efficiency,end-to-end delays etc.However,traditional scheduling methodologies in large-scale environments such as big data smart cities cannot meet the requirements for high performance network metrics.In big data smart cities applications which need fast packets transmission ratio such as sending priority packets to hospitals for an emergency case,an efficient schedulingmechanism ismandatory which is the main concern of this paper.In this paper,we overcome the shortcoming issues of the traditional scheduling algorithms that are utilized in big data smart cities emergency applications.Transmission information about the priority packets between the source nodes(i.e.,people with emergency cases)and the destination nodes(i.e.,hospitals)is performed before sending the packets in order to reserve transmission channels and prepare the sequence of transmission of theses priority packets between the two parties.In our proposed mechanism,Software Defined Networking(SDN)with centralized communication controller will be responsible for determining the scheduling and processing sequences for priority packets in big data smart cities environments.In this paper,we compare between our proposed Priority Packets Deadline First scheduling scheme(PPDF)with existing and traditional scheduling algorithms that can be used in urgent smart cities applications in order to illustrate the outstanding network performance parameters of our scheme such as the average waiting time,packets loss rates,priority packets end-to-end delay,and efficient energy consumption.展开更多
With the wide application of Web-2.0 and social software, there are more and more tag-related studies and applications. Because of the randomness and the personalization in users' tagging, tag research continues t...With the wide application of Web-2.0 and social software, there are more and more tag-related studies and applications. Because of the randomness and the personalization in users' tagging, tag research continues to encounter data space and semantics obstacles. With the min-max similarity (MMS) to establish the initial centroids, the traditional K-means clustering algorithm is firstly improved to the MMSK-means clustering algorithm, the superiority of which has been tested; based on MMSK-means and combined with latent semantic analysis (LSA), here secondly emerges a new tag clustering algorithm, LMMSK. Finally, three algorithms for tag clustering, MMSK-means, tag clustering based on LSA (LSA-based algorithm) and LMMSK, have been run on Matlab, using a real tag-resource dataset obtained from the Delicious Social Bookmarking System from 2004 to 2009. LMMSK's clustering result turns out to be the most effective and the most accurate. Thus, a better tag-clustering algorithm is found for greater application of social tags in personalized search, topic identification or knowledge community discovery. In addition, for a better comparison of the clustering results, the clustering corresponding results matrix (CCR matrix) is proposed, which is promisingly expected to be an effective tool to capture the evolutions of the social tagging system. ? 2017 Beijing Institute of Aerospace Information.展开更多
基金supported by the Fundamental Research Fundsfor the Central Universities under Grant No.ZYGX2015J009the Sichuan Province Scientific and Technological Support Project under Grants No.2014GZ0017 and No.2016GZ0093
文摘In data centers, the transmission control protocol(TCP) incast causes catastrophic goodput degradation to applications with a many-to-one traffic pattern. In this paper, we intend to tame incast at the receiver-side application. Towards this goal, we first develop an analytical model that formulates the incast probability as a function of connection variables and network environment settings. We combine the model with the optimization theory and derive some insights into minimizing the incast probability through tuning connection variables related to applications. Then,enlightened by the analytical results, we propose an adaptive application-layer solution to the TCP incast.The solution equally allocates advertised windows to concurrent connections, and dynamically adapts the number of concurrent connections to the varying conditions. Simulation results show that our solution consistently eludes incast and achieves high goodput in various scenarios including the ones with multiple bottleneck links and background TCP traffic.
基金This study is supported through Taif University Researchers Supporting Project Number(TURSP-2020/150),Taif University,Taif,Saudi Arabia.
文摘Today,Internet of Things(IoT)is a technology paradigm which convinces many researchers for the purpose of achieving high performance of packets delivery in IoT applications such as smart cities.Interconnecting various physical devices such as sensors or actuators with the Internet may causes different constraints on the network resources such as packets delivery ratio,energy efficiency,end-to-end delays etc.However,traditional scheduling methodologies in large-scale environments such as big data smart cities cannot meet the requirements for high performance network metrics.In big data smart cities applications which need fast packets transmission ratio such as sending priority packets to hospitals for an emergency case,an efficient schedulingmechanism ismandatory which is the main concern of this paper.In this paper,we overcome the shortcoming issues of the traditional scheduling algorithms that are utilized in big data smart cities emergency applications.Transmission information about the priority packets between the source nodes(i.e.,people with emergency cases)and the destination nodes(i.e.,hospitals)is performed before sending the packets in order to reserve transmission channels and prepare the sequence of transmission of theses priority packets between the two parties.In our proposed mechanism,Software Defined Networking(SDN)with centralized communication controller will be responsible for determining the scheduling and processing sequences for priority packets in big data smart cities environments.In this paper,we compare between our proposed Priority Packets Deadline First scheduling scheme(PPDF)with existing and traditional scheduling algorithms that can be used in urgent smart cities applications in order to illustrate the outstanding network performance parameters of our scheme such as the average waiting time,packets loss rates,priority packets end-to-end delay,and efficient energy consumption.
基金supported by the National Natural Science Foundation of China(7127101871531001)
文摘With the wide application of Web-2.0 and social software, there are more and more tag-related studies and applications. Because of the randomness and the personalization in users' tagging, tag research continues to encounter data space and semantics obstacles. With the min-max similarity (MMS) to establish the initial centroids, the traditional K-means clustering algorithm is firstly improved to the MMSK-means clustering algorithm, the superiority of which has been tested; based on MMSK-means and combined with latent semantic analysis (LSA), here secondly emerges a new tag clustering algorithm, LMMSK. Finally, three algorithms for tag clustering, MMSK-means, tag clustering based on LSA (LSA-based algorithm) and LMMSK, have been run on Matlab, using a real tag-resource dataset obtained from the Delicious Social Bookmarking System from 2004 to 2009. LMMSK's clustering result turns out to be the most effective and the most accurate. Thus, a better tag-clustering algorithm is found for greater application of social tags in personalized search, topic identification or knowledge community discovery. In addition, for a better comparison of the clustering results, the clustering corresponding results matrix (CCR matrix) is proposed, which is promisingly expected to be an effective tool to capture the evolutions of the social tagging system. ? 2017 Beijing Institute of Aerospace Information.