The Experts below are selected from a list of 2976 Experts worldwide ranked by ideXlab platform
Hongke Zhang - One of the best experts on this subject based on the ideXlab platform.
-
dynamic time threshold based Receive Buffer for vehicle to cloud multipath transmission
2020 International Conference on Computing Networking and Communications (ICNC), 2020Co-Authors: Yuyang Zhang, Ping Dong, Hongbin Luo, Hongke Zhang, Mohsen GuizaniAbstract:Vehicle-to-cloud is a network access model that aims to share computing resources for vehicles. In vehicle-to-cloud communication, reliable links are critical. Through multipath transmission, comprehensive utilization of heterogeneous wireless networks between the vehicle and the cloud server can effectively improve the reliability and efficiency of transmission. A large number of studies have pointed out that a Receive butter can greatly improve the performance of multipath transmission in vehicle-to-cloud communication. However, most of these studies, which use Receive Buffers to improve multipath transmission performance, do not explicitly specify the design details of the Receive butter. A classic design idea is to use a fixed length Receive butter. However, this idea makes it difficult to determine the appropriate butter length in a complex vehicle-to-cloud communication scenario. This paper proposes a Dynamic Time-Threshold (DTT) Receive Buffer. The DTT Receive Buffer takes into account the instability of vehicular wireless networks, and dynamically adjusts the time-threshold so that the packets in the Receive butter do not affect the overall communication performance due to premature departure or excessive waiting. We verified the performance of the DTT Receive butter through a large number of simulations and real tests. By comparison, the performance of DTT Receive butter is significantly better than the fixed length Receive butter.
-
ICNC - Dynamic Time-Threshold Based Receive Buffer for Vehicle-to-Cloud Multipath Transmission
2020 International Conference on Computing Networking and Communications (ICNC), 2020Co-Authors: Yuyang Zhang, Ping Dong, Hongbin Luo, Hongke Zhang, Mohsen GuizaniAbstract:Vehicle-to-cloud is a network access model that aims to share computing resources for vehicles. In vehicle-to-cloud communication, reliable links are critical. Through multipath transmission, comprehensive utilization of heterogeneous wireless networks between the vehicle and the cloud server can effectively improve the reliability and efficiency of transmission. A large number of studies have pointed out that a Receive butter can greatly improve the performance of multipath transmission in vehicle-to-cloud communication. However, most of these studies, which use Receive Buffers to improve multipath transmission performance, do not explicitly specify the design details of the Receive butter. A classic design idea is to use a fixed length Receive butter. However, this idea makes it difficult to determine the appropriate butter length in a complex vehicle-to-cloud communication scenario. This paper proposes a Dynamic Time-Threshold (DTT) Receive Buffer. The DTT Receive Buffer takes into account the instability of vehicular wireless networks, and dynamically adjusts the time-threshold so that the packets in the Receive butter do not affect the overall communication performance due to premature departure or excessive waiting. We verified the performance of the DTT Receive butter through a large number of simulations and real tests. By comparison, the performance of DTT Receive butter is significantly better than the fixed length Receive butter.
-
Smart Collaborative Automation for Receive Buffer Control in Multipath Industrial Networks
IEEE Transactions on Industrial Informatics, 2020Co-Authors: Fei Song, Yutong Zhou, Ilsun You, Kim-kwang Raymond Choo, Hongke ZhangAbstract:Artificial intelligence is being utilized in multipath industrial networks to enhance service supporting ability. However, existing obstacles in controlling Receive Buffer restrict throughput even when higher bandwidth is available. Therefore, in this article, we propose a smart collaborative automation (SCA) scheme to improve resource usage and overcome Buffer limitations. First, a mathematical model is established to describe primary system operations with considerations of chunk loss. The inf-supremum methodology and probability theory are adopted to track congestion window variations. Second, differences in disordered chunk expectations are analyzed to locate the critical condition of round numbers. Specific algorithm details are provided via simplifying comparison to achieve comprehensive policy selections. Third, evaluation topologies and environments are created with reasonable parameter settings. Validation results demonstrate that model-driven SCA can reduce unexpected occupations at the Receiver-side. Comparing to intuition-driven schemes, overall performances, in terms of the sender's transmission capacity and Receiver's Buffer utilization, are improved under different experimental configurations.
-
INFOCOM Workshops - A smart heuristic for relieving RBB in dependable transmission environment
2016 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2016Co-Authors: Fei Song, Wei Quan, Huifeng Yang, Wei Zhao, Hongke ZhangAbstract:Wireless access technologies had effectively accelerated the evolution of Internet and enhanced the overall capacity of networks. However, due to the complexity of multiple paths in mobile scenarios, the managements of network and terminal are more and more challenging. For instance, when disordered packets arrive at the destination, they have to be stored within the transport layer Buffer at the Receiver side, which may seriously restrict the transmission performance. We present a smart heuristic to handle and relieve such Receive Buffer Blocking (RBB) issue in dependable environment. A novel modeling approach for describing the properties of RBB is also presented by selecting “Theoretical maximum of disordered packets” as the target. Both loss free and loss occurs circumstances are considered comprehensively. The functionality of our scheme is confirmed via mathematical perspective based on the proposed model. The reasonable treatment method for one way delay and packet loss during the scheduling policy design are also discussed.
Minghui Shi - One of the best experts on this subject based on the ideXlab platform.
-
goodput improvement for multipath tcp by congestion window adaptation in multi radio devices
Consumer Communications and Networking Conference, 2013Co-Authors: Dizhi Zhou, Wei Song, Minghui ShiAbstract:Multipath Transport Control Protocol (MPTCP) has been standardized by Internet Engineering Task Force (IETF) to support simultaneous delivery of transport control protocol (TCP) packets over multiple interfaces of multi-radio mobile devices. Although MPTCP provides an efficient solution to aggregate the available bandwidth of multiple paths, the goodput of MPTCP is usually far lower than the aggregate throughput due to out-of-order Received packets. One key reason for the out-of-order issue is the large variation of end-to-end delay for multiple paths over wireless channels. In this paper, we propose a congestion window adaption algorithm for the MPTCP source (referred to as CWA-MPTCP), which dynamically adjusts the congestion window for each TCP subflow so as to mitigate the variation of end-to-end path delay. We consider typical multipath transmission scenarios over wireless links, as well as a cooperative multi-hop wireless network with multiple relays. For wired paths with stable end-to-end delay, we further develop a proactive scheduling algorithm to determine the packet sending sequence to each path. This algorithm effectively reduces the out-of-order packets by predicting the receiving sequence. Experiments are conducted to evaluate the goodput performance of the two enhancements to MPTCP. Significant performance gain is achieved in terms of goodput, while the Receive Buffer requirement is minimized.
-
CCNC - Goodput improvement for multipath TCP by congestion window adaptation in multi-radio devices
2013 IEEE 10th Consumer Communications and Networking Conference (CCNC), 2013Co-Authors: Dizhi Zhou, Wei Song, Minghui ShiAbstract:Multipath Transport Control Protocol (MPTCP) has been standardized by Internet Engineering Task Force (IETF) to support simultaneous delivery of transport control protocol (TCP) packets over multiple interfaces of multi-radio mobile devices. Although MPTCP provides an efficient solution to aggregate the available bandwidth of multiple paths, the goodput of MPTCP is usually far lower than the aggregate throughput due to out-of-order Received packets. One key reason for the out-of-order issue is the large variation of end-to-end delay for multiple paths over wireless channels. In this paper, we propose a congestion window adaption algorithm for the MPTCP source (referred to as CWA-MPTCP), which dynamically adjusts the congestion window for each TCP subflow so as to mitigate the variation of end-to-end path delay. We consider typical multipath transmission scenarios over wireless links, as well as a cooperative multi-hop wireless network with multiple relays. For wired paths with stable end-to-end delay, we further develop a proactive scheduling algorithm to determine the packet sending sequence to each path. This algorithm effectively reduces the out-of-order packets by predicting the receiving sequence. Experiments are conducted to evaluate the goodput performance of the two enhancements to MPTCP. Significant performance gain is achieved in terms of goodput, while the Receive Buffer requirement is minimized.
Hideki Tode - One of the best experts on this subject based on the ideXlab platform.
-
adaptive qos control adjusting Receive Buffer sizes and parallel tcp connections on information gathering server
Local Computer Networks, 2013Co-Authors: Yasutaka Sakajiri, Yosuke Tanigawa, Hideki TodeAbstract:In this paper, we focus on an information gathering service like human sensing systems and supervisory system for nursing care, where a server collects information from many clients at the same time, under the current IP network following so-called Best-Effort Discipline. In such applications, especially, communication quality should be enhanced in order to attain application-specific target throughput at maximum. To tackle this technical issue, we propose a method which adaptively tunes TCP socket Buffer size and the number of TCP connections according to the policy which preferentially ensures target QoS for high priority clients. This is an unprecedented research about many-to-one transport protocol which has functions to coordinate between multiple sessions. In addition, the proposed method is suitable for the system which transports information to a server considering various network access and priority levels. Through extensive simulation experiments, we demonstrate that proposed methods can ensure the required communication quality within physical limitations according to priorities, regardless of TCP versions.
-
LCN - Adaptive QoS control adjusting Receive Buffer sizes and parallel TCP connections on information gathering server
38th Annual IEEE Conference on Local Computer Networks, 2013Co-Authors: Yasutaka Sakajiri, Yosuke Tanigawa, Hideki TodeAbstract:In this paper, we focus on an information gathering service like human sensing systems and supervisory system for nursing care, where a server collects information from many clients at the same time, under the current IP network following so-called Best-Effort Discipline. In such applications, especially, communication quality should be enhanced in order to attain application-specific target throughput at maximum. To tackle this technical issue, we propose a method which adaptively tunes TCP socket Buffer size and the number of TCP connections according to the policy which preferentially ensures target QoS for high priority clients. This is an unprecedented research about many-to-one transport protocol which has functions to coordinate between multiple sessions. In addition, the proposed method is suitable for the system which transports information to a server considering various network access and priority levels. Through extensive simulation experiments, we demonstrate that proposed methods can ensure the required communication quality within physical limitations according to priorities, regardless of TCP versions.
Abdallah Shami - One of the best experts on this subject based on the ideXlab platform.
-
On-demand scheduling for concurrent multipath transfer using the stream control transmission protocol
Journal of Network and Computer Applications, 2015Co-Authors: T. Daniel Wallace, Khalim Amjad Meerja, Abdallah ShamiAbstract:Disparate path characteristics and a constrained Receive Buffer can frustrate the promised performance gains of concurrent multipath transfer (CMT). Known as the Receive Buffer blocking problem, out-of-order arrivals disrupt the sender's ability to transmit new packets while Buffering delays ensue at the multihomed Receiver. To mitigate this effect, earlier work used scheduling algorithms that assigned new packets to the Receiver's destination address with the lowest delay. Unfortunately, this approach is not always successful; and in some cases, even a simpler method will achieve better results.Our research suggests that congestion and flow control-standard elements of the stream control transmission protocol (SCTP)-counteract the scheduling process. Since congestion and flow control dictate when packets are actually transmitted to a destination address, making a scheduling decision prior to a transmission opportunity can be ineffective.In this paper, we propose an on-demand scheduler (ODS); a scheduling approach for CMT that waits for a transmission opportunity before assigning a packet to one of the Receiver's destination addresses. In some circumstances, however, ODS will enable one destination address to monopolize shared resources, such as the Receive Buffer (RBUF). To circumvent this issue we have also developed a new congestion window update policy for CMT. When compared to previous scheduling algorithms, ODS and our new update policy can significantly improve throughput for CMT under delay and bandwidth-based disparity.
-
Concurrent Multipath Transfer Using SCTP: Modelling and Congestion Window Management
IEEE Transactions on Mobile Computing, 2014Co-Authors: T. Daniel Wallace, Abdallah ShamiAbstract:Concurrent multipath transfer (CMT) using the stream control transmission protocol (SCTP) can exploit multihomed devices to enhance data communications. While SCTP is a new transport layer protocol supporting multihomed end-points, CMT provides a framework so that transport layer resources are used efficiently and effectively when sending to the same destination with multiple IP addresses. In this paper, we present two techniques for modelling the expected throughput of a CMT session; while one is based on renewal theory, the other uses a Markov chain. As far as we know, ours is the first paper to model CMT whilst considering practical transport layer resources like a shared Receive Buffer (RBUF). A comparison of the models showed the Markov chain to be more accurate, but suffered from scalability issues. Alternatively, the renewal model was more cost effective, but also less accurate. We also applied our models to a new problem called congestion window management, where the size of each congestion window is reconfigured for optimal performance. Again, we compared two approaches: a dynamic method that makes decisions based on instantaneous throughput, and a static method that uses an integer linear program (ILP) to generate a global solution. Results showed the static method outperforming the dynamic approach by as much as 12 percent.
-
on demand scheduling for concurrent multipath transfer under delay based disparity
International Conference on Wireless Communications and Mobile Computing, 2012Co-Authors: Daniel T Wallace, Abdallah ShamiAbstract:This paper proposes a new scheduling algorithm for concurrent multipath transfer (CMT) called the on-demand scheduler (ODS). Unlike previous algorithms, ODS waits for a transmission opportunity before making a scheduling decision. We showed ODS can outperform previous scheduling algorithms for CMT under various network scenarios. Moreover, this paper offers new insight into the effects of congestion and flow control on the Receive Buffer blocking problem associated with CMT.
-
IWCMC - On-demand scheduling for concurrent multipath transfer under delay-based disparity
2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC), 2012Co-Authors: T. Daniel Wallace, Abdallah ShamiAbstract:This paper proposes a new scheduling algorithm for concurrent multipath transfer (CMT) called the on-demand scheduler (ODS). Unlike previous algorithms, ODS waits for a transmission opportunity before making a scheduling decision. We showed ODS can outperform previous scheduling algorithms for CMT under various network scenarios. Moreover, this paper offers new insight into the effects of congestion and flow control on the Receive Buffer blocking problem associated with CMT.
Randall Stewart - One of the best experts on this subject based on the ideXlab platform.
-
Concurrent Multipath Transfer during path failure
Computer Communications, 2009Co-Authors: Preethi Natarajan, Paul D. Amer, Nasif Ekiz, Randall StewartAbstract:We investigate how path failure influences Concurrent Multipath Transfer (CMT) using SCTP multihoming. We show that CMT suffers from significant ''Receive Buffer blocking'' which degrades performance during both permanent and short-term failure. To improve performance, we introduce a new ''Potentially-Failed'' (PF) destination state, and revise CMT's failure detection and (re)transmission policies to include the PF state. Using simulation, we demonstrate that the modification called CMT-PF outperforms CMT during failure - even with aggressive failure detection thresholds and varying Receive Buffer constraints. In non-failure scenarios, CMT-PF performs on par or better but never worse than CMT. Finally, we confirm these simulation results using FreeBSD implementations of CMT and CMT-PF. Based on our findings, we recommend CMT-PF be used in existing and future CMT implementations and RFCs.
-
concurrent multipath transfer using sctp multihoming introducing the potentially failed destination state
International IFIP-TC Networking Conference, 2008Co-Authors: Preethi Natarajan, Janardhan Iyengar, Paul D. Amer, Nasif Ekiz, Randall StewartAbstract:Previously, we identified the failure-induced Receive Buffer (rbuf) blocking problem in Concurrent Multipath Transfer using SCTP multihoming (CMT), and proposed CMT with a Potentially-failed destination state (CMTPF) to alleviate rbuf blocking. In this paper, we complete our evaluation of CMT vs. CMT-PF. Using ns-2 simulations we show that CMT-PF performs on par or better than CMT during more aggressive failure detection thresholds than recommended by RFC4960. We also examine whether the modified sender behavior in CMT-PF degrades performance during non-failure scenarios. Our evaluations consider: (i) realistic loss model with symmetric and asymmetric path loss, (ii) varying path RTTs. We find that CMT-PF performs as well as CMT during non-failure scenarios, and interestingly, outperforms CMT when the paths experience asymmetric rbuf blocking conditions. We recommend that CMT be replaced by CMT-PF in future CMT implementations and RFCs.
-
Networking - Concurrent multipath transfer using SCTP multihoming: introducing the potentially-failed destination state
NETWORKING 2008 Ad Hoc and Sensor Networks Wireless Networks Next Generation Internet, 2008Co-Authors: Preethi Natarajan, Janardhan Iyengar, Paul D. Amer, Nasif Ekiz, Randall StewartAbstract:Previously, we identified the failure-induced Receive Buffer (rbuf) blocking problem in Concurrent Multipath Transfer using SCTP multihoming (CMT), and proposed CMT with a Potentially-failed destination state (CMTPF) to alleviate rbuf blocking. In this paper, we complete our evaluation of CMT vs. CMT-PF. Using ns-2 simulations we show that CMT-PF performs on par or better than CMT during more aggressive failure detection thresholds than recommended by RFC4960. We also examine whether the modified sender behavior in CMT-PF degrades performance during non-failure scenarios. Our evaluations consider: (i) realistic loss model with symmetric and asymmetric path loss, (ii) varying path RTTs. We find that CMT-PF performs as well as CMT during non-failure scenarios, and interestingly, outperforms CMT when the paths experience asymmetric rbuf blocking conditions. We recommend that CMT be replaced by CMT-PF in future CMT implementations and RFCs.
-
Performance implications of a bounded Receive Buffer in concurrent multipath transfer
Computer Communications, 2007Co-Authors: Janardhan Iyengar, Paul D. Amer, Randall StewartAbstract:We study the performance of Concurrent Multipath Transfer using SCTP multihoming (CMT) in the presence of a bounded Receive Buffer (rbuf). We demonstrate using simulation that if two paths are used for CMT, the lower quality (i.e., higher loss rate) path degrades overall throughput of an rbuf-constrained CMT association by blocking the rbuf. We argue that rbuf blocking is not specific to the transport layer, but applies to multipath transfers at other layers as well. We present and discuss CMT performance using several retransmission policies and various constrained rbuf values. We also study the impact of rbuf blocking with different combinations of end-to-end loss rate and delay on the two paths and show that when large differences exist in path delays and loss rates, using only the better path outperforms using two paths concurrently. While rbuf blocking cannot be eliminated, it can be reduced by choice of retransmission policy - a mechanism available to only the transport layer.
-
concurrent multipath transfer using sctp multihoming over independent end to end paths
IEEE ACM Transactions on Networking, 2006Co-Authors: Janardhan Iyengar, Paul D. Amer, Randall StewartAbstract:Concurrent multipath transfer (CMT) uses the Stream Control Transmission Protocol's (SCTP) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. We identify three negative side-effects of reordering introduced by CMT that must be managed before efficient parallel transfer can be achieved: (1) unnecessary fast retransmissions by a sender; (2) overly conservative congestion window (cwnd) growth at a sender; and (3) increased ack traffic due to fewer delayed acks by a Receiver. We propose three algorithms which augment and/or modify current SCTP to counter these side-effects. Presented with several choices as to where a sender should direct retransmissions of lost data, we propose five retransmission policies for CMT. We demonstrate spurious retransmissions in CMT with all five policies and propose changes to CMT to allow the different policies. CMT is evaluated against AppStripe, which is an idealized application that stripes data over multiple paths using multiple SCTP associations. The different CMT retransmission policies are then evaluated with varied constrained Receive Buffer sizes. In this foundation work, we operate under the strong assumption that the bottleneck queues on the end-to-end paths used in CMT are independent.
