Anfu Zhou | Chinese Academy of Sciences (original) (raw)

Papers by Anfu Zhou

The information of available bandwidth on an endto-end path is important for various network appl... more The information of available bandwidth on an endto-end path is important for various network applications, and several probing methods have been proposed to estimate it in recent years. However, previous methods are either based on fluid model or are only partially suitable for bursty real internet cross traffic; and the accuracy of their estimation degrades at different extents in multi-hop situations. Moreover, all previous PGM (Probing Gap Model) based methods require the knowledge of bottleneck link capacity, which may not be available in practice. In this paper, we extend the analysis of queuing behavior of probing packets from single-hop scenarios to multi-hop scenarios and propose a novel hybrid probing technique, called PATHCOS++, which integrates the advantages of both PRM (Probing Rate Model) and PGM based methods, to estimate the end-to-end available bandwidth. Unlike previous works, PATHCOS++ does not make fluid cross traffic assumption and does not require the information about bottleneck link capacity. Simulation results show that PATHCOS++ is quite efficient and provides end-to-end available bandwidth estimation that is significantly more accurate than current state-of-the-art techniques do. The accuracy of PATHCOS++ is nearly unaffected when there are multiple congestible links.

Eurasip Journal on Wireless Communications and Networking, 2011

Mobile IP is one of the dominating protocols that enable a mobile node to remain reachable while ... more Mobile IP is one of the dominating protocols that enable a mobile node to remain reachable while moving around in the Internet. However, it suffers from long handoff latency and route inefficiency. In this article, we present a novel distributed mobility management architecture, ADA (Asymmetric Double-Agents), which introduces double mobility agents to serve one end-to-end communication. One mobility agent is located close to the MN and the other close to the CN. ADA can achieve both low handoff latency and low transmission latency, which is crucial for improvement of user perceived QoS. It also provides an easy-to-use mechanism for MNs to manage and control each traffic session with a different policy and provide specific QoS support. We apply ADA to MIPv6 communications and present a detailed protocol design. Subsequently, we propose an analytical framework for systematic and thorough performance evaluation of mobile IP-based mobility management protocols. Equipped with this model, we analyze the handoff latency, single interaction delay and total time cost under the bidirectional tunneling mode and the route optimization mode for MIPv6, HMIPv6, CNLP, and ADA. Through both quantitative analysis and NS2-based simulations, we show that ADA significantly outperforms the existing mobility management protocols.

As is known to us, the handover latency of FMIPv6 in its predictive mode is given little concerns... more As is known to us, the handover latency of FMIPv6 in its predictive mode is given little concerns. However our previous work [4] shows that FMIPv6 may suffer long handover latency in its predictive mode, and [4] identifies three key issues raising such problems. In this paper, we propose a practical cross-layer fast handover management mechanism (PCLF) to address these issues and improve success rate of mobility prediction. To solve the problem, PCLF includes a smart link layer trigger, a TBScan algorithm, a TBAPS algorithm, a buffering support Bi-Binding scheme and the smart link event notification policy. Experiment results show that our mechanism can achieve reasonable mobility prediction and seamless handover with no interruptions on upper layer applications (VoIP) in IEEE 802.11 WLANs. The average handover latency is less than 50ms, the success rate of mobility prediction is 97.7% and no packet loss is observed.

Most existing soft handoff approaches lead to plenty of out-of-order packets during downward vert... more Most existing soft handoff approaches lead to plenty of out-of-order packets during downward vertical handoffs (VHOs). We have presented a soft VHO scheme, called SHORDER, to avoid packet reordering caused by downward VHOs. In this paper, we analyze the effects of our SHORDER scheme and another typical existing soft VHO method on the handoff latency and the received data size during a downward VHO for TCP applications. Then, we approximately derive the applicable conditions of the two approaches, and further propose a diagnosis-based soft vertical handoff (DSVH) mechanism which can self-adaptively deal with reordering packets. The mechanism has practical advantages of no changes to correspondent nodes and compatibility with various enhanced TCP variants. With numerical analysis and test-bed experiments, we show that the DSVH mechanism has better performance than the SHORDER scheme and the typical existing method. Furthermore, experimental and analytical results are consistent with each other.

Previous Probe Gap Model (PGM) based available bandwidth (AB) estimation methods all request the ... more Previous Probe Gap Model (PGM) based available bandwidth (AB) estimation methods all request the "busy assumption" that probing packet pairs should be in the same busy period when transmitted on bottleneck link, which is hard to satisfy especially for the low utilization path. In this paper, we first present a new probabilistic methodology to estimate AB under "non busy assumption". The methodology is quite accurate on the low utilization network path. Secondly, we propose a metric to weigh the busyness of a network path based on the distribution of output probe gap. Using the metric, we combine our new methodology and previous methodology, and present a new AB estimation method called Adaptive Available Bandwidth Estimation (A_ABE) which is fit for both low utilization and high utilization paths. We use NS-2 simulation and reproduce traffic from real Internet links to evaluate A_ABE. Compared with previous methods, A_ABE shows its advantages in terms of accuracy, overhead, and also the robustness when confronted with non-persistent cross traffic in multiple hop situations.

IEEE Transactions on Wireless Communications, 2012

One major problem of cross-layer control algorithms in multi-hop wireless networks is that they l... more One major problem of cross-layer control algorithms in multi-hop wireless networks is that they lead to large end-to-end delays. Recently there have been many studies devoted to solving the problem to guarantee order-optimal per-flow delay. However, these approaches also bring the adverse effect of sacrificing a lot of network utility. In this paper, we solve the large-delay problem without sacrificing network utility. We take a fundamentally different approach of delay differentiation, which is based on the observation that flows in a network usually have different requirements for end-to-end delay. We propose a novel joint rate control, routing and scheduling algorithm called CLC_DD, which ensures that the flow delays are proportional to certain pre-specified delay priority parameters. By adjusting delay priority parameters, the end-to-end delays of preferential flows achieved by CLC_DD can be as small as those achieved by delay-order-optimal algorithms. In contrast to high network utility loss in previous approaches, we prove that our approach achieves maximum network utility. Furthermore, we incorporate opportunistic routing into the cross-layer design framework to improve network performance under the environment of dynamic wireless channels.

In wireless mesh networks with frequency-agile radios, an algorithm of dynamically combining cons... more In wireless mesh networks with frequency-agile radios, an algorithm of dynamically combining consecutive channels has recently been proposed. However, the available channel widths are limited in the algorithm. In order to further improve the fairness or the throughput under given fairness, we propose a joint variable width spectrum allocation and link scheduling optimization algorithm. Our algorithm is composed of time division multiple access for no interface conflict and frequency division multiple access for no signal interference. In the first phase, we use as few time slots as possible to assign at least one time slots to each radio link with Max-Min fairness. In the second phase, our design jointly allocates the lengths of time slots as well as the spectral widths and center frequencies of radio links in each time slot. Numerical results indicate that compared to the existing algorithm, our algorithm significantly increases the fairness or the throughput under given fairness.

The information of available bandwidth on an endto-end path is important for various network appl... more The information of available bandwidth on an endto-end path is important for various network applications, and several probing methods have been proposed to estimate it in recent years. However, previous methods are either based on fluid model or are only partially suitable for bursty real internet cross traffic; and the accuracy of their estimation degrades at different extents in multi-hop situations. Moreover, all previous PGM (Probing Gap Model) based methods require the knowledge of bottleneck link capacity, which may not be available in practice. In this paper, we extend the analysis of queuing behavior of probing packets from single-hop scenarios to multi-hop scenarios and propose a novel hybrid probing technique, called PATHCOS++, which integrates the advantages of both PRM (Probing Rate Model) and PGM based methods, to estimate the end-to-end available bandwidth. Unlike previous works, PATHCOS++ does not make fluid cross traffic assumption and does not require the information about bottleneck link capacity. Simulation results show that PATHCOS++ is quite efficient and provides end-to-end available bandwidth estimation that is significantly more accurate than current state-of-the-art techniques do. The accuracy of PATHCOS++ is nearly unaffected when there are multiple congestible links.

Eurasip Journal on Wireless Communications and Networking, 2011

Mobile IP is one of the dominating protocols that enable a mobile node to remain reachable while ... more Mobile IP is one of the dominating protocols that enable a mobile node to remain reachable while moving around in the Internet. However, it suffers from long handoff latency and route inefficiency. In this article, we present a novel distributed mobility management architecture, ADA (Asymmetric Double-Agents), which introduces double mobility agents to serve one end-to-end communication. One mobility agent is located close to the MN and the other close to the CN. ADA can achieve both low handoff latency and low transmission latency, which is crucial for improvement of user perceived QoS. It also provides an easy-to-use mechanism for MNs to manage and control each traffic session with a different policy and provide specific QoS support. We apply ADA to MIPv6 communications and present a detailed protocol design. Subsequently, we propose an analytical framework for systematic and thorough performance evaluation of mobile IP-based mobility management protocols. Equipped with this model, we analyze the handoff latency, single interaction delay and total time cost under the bidirectional tunneling mode and the route optimization mode for MIPv6, HMIPv6, CNLP, and ADA. Through both quantitative analysis and NS2-based simulations, we show that ADA significantly outperforms the existing mobility management protocols.

As is known to us, the handover latency of FMIPv6 in its predictive mode is given little concerns... more As is known to us, the handover latency of FMIPv6 in its predictive mode is given little concerns. However our previous work [4] shows that FMIPv6 may suffer long handover latency in its predictive mode, and [4] identifies three key issues raising such problems. In this paper, we propose a practical cross-layer fast handover management mechanism (PCLF) to address these issues and improve success rate of mobility prediction. To solve the problem, PCLF includes a smart link layer trigger, a TBScan algorithm, a TBAPS algorithm, a buffering support Bi-Binding scheme and the smart link event notification policy. Experiment results show that our mechanism can achieve reasonable mobility prediction and seamless handover with no interruptions on upper layer applications (VoIP) in IEEE 802.11 WLANs. The average handover latency is less than 50ms, the success rate of mobility prediction is 97.7% and no packet loss is observed.

Most existing soft handoff approaches lead to plenty of out-of-order packets during downward vert... more Most existing soft handoff approaches lead to plenty of out-of-order packets during downward vertical handoffs (VHOs). We have presented a soft VHO scheme, called SHORDER, to avoid packet reordering caused by downward VHOs. In this paper, we analyze the effects of our SHORDER scheme and another typical existing soft VHO method on the handoff latency and the received data size during a downward VHO for TCP applications. Then, we approximately derive the applicable conditions of the two approaches, and further propose a diagnosis-based soft vertical handoff (DSVH) mechanism which can self-adaptively deal with reordering packets. The mechanism has practical advantages of no changes to correspondent nodes and compatibility with various enhanced TCP variants. With numerical analysis and test-bed experiments, we show that the DSVH mechanism has better performance than the SHORDER scheme and the typical existing method. Furthermore, experimental and analytical results are consistent with each other.

Previous Probe Gap Model (PGM) based available bandwidth (AB) estimation methods all request the ... more Previous Probe Gap Model (PGM) based available bandwidth (AB) estimation methods all request the "busy assumption" that probing packet pairs should be in the same busy period when transmitted on bottleneck link, which is hard to satisfy especially for the low utilization path. In this paper, we first present a new probabilistic methodology to estimate AB under "non busy assumption". The methodology is quite accurate on the low utilization network path. Secondly, we propose a metric to weigh the busyness of a network path based on the distribution of output probe gap. Using the metric, we combine our new methodology and previous methodology, and present a new AB estimation method called Adaptive Available Bandwidth Estimation (A_ABE) which is fit for both low utilization and high utilization paths. We use NS-2 simulation and reproduce traffic from real Internet links to evaluate A_ABE. Compared with previous methods, A_ABE shows its advantages in terms of accuracy, overhead, and also the robustness when confronted with non-persistent cross traffic in multiple hop situations.

IEEE Transactions on Wireless Communications, 2012

One major problem of cross-layer control algorithms in multi-hop wireless networks is that they l... more One major problem of cross-layer control algorithms in multi-hop wireless networks is that they lead to large end-to-end delays. Recently there have been many studies devoted to solving the problem to guarantee order-optimal per-flow delay. However, these approaches also bring the adverse effect of sacrificing a lot of network utility. In this paper, we solve the large-delay problem without sacrificing network utility. We take a fundamentally different approach of delay differentiation, which is based on the observation that flows in a network usually have different requirements for end-to-end delay. We propose a novel joint rate control, routing and scheduling algorithm called CLC_DD, which ensures that the flow delays are proportional to certain pre-specified delay priority parameters. By adjusting delay priority parameters, the end-to-end delays of preferential flows achieved by CLC_DD can be as small as those achieved by delay-order-optimal algorithms. In contrast to high network utility loss in previous approaches, we prove that our approach achieves maximum network utility. Furthermore, we incorporate opportunistic routing into the cross-layer design framework to improve network performance under the environment of dynamic wireless channels.

In wireless mesh networks with frequency-agile radios, an algorithm of dynamically combining cons... more In wireless mesh networks with frequency-agile radios, an algorithm of dynamically combining consecutive channels has recently been proposed. However, the available channel widths are limited in the algorithm. In order to further improve the fairness or the throughput under given fairness, we propose a joint variable width spectrum allocation and link scheduling optimization algorithm. Our algorithm is composed of time division multiple access for no interface conflict and frequency division multiple access for no signal interference. In the first phase, we use as few time slots as possible to assign at least one time slots to each radio link with Max-Min fairness. In the second phase, our design jointly allocates the lengths of time slots as well as the spectral widths and center frequencies of radio links in each time slot. Numerical results indicate that compared to the existing algorithm, our algorithm significantly increases the fairness or the throughput under given fairness.