BCTCP:A Feedback-Based Congestion Control Method

Delay and throughput are the two network indicators that users most care about.Traditional congestion control methods try to occupy buffer aggressively until packet loss being detected,causing high delay and variation.Using AQM and ECN can highly reduce packet drop rate and delay,however they may also lead to low utilization.Managing queue size of routers properly means a lot to congestion control method.Keeping traffic size varying around bottleneck bandwidth creates some degree of persistent queue in the router,which brings in additional delay into network unwillingly,but a corporation between sender and router can keep it under control.Proper persistent queue not only keeps routers being fully utilized all the time,but also lower the variation of throughput and delay,achieving the balance between delay and utilization.In this paper,we present BCTCP(Buffer Controllable TCP),a congestion control protocol based on explicit feedback from routers.It requires sender,receiver and routers cooperating with each other,in which senders adjust their sending rate according to the multiple bit load factor information from routers.It keeps queue length of bottleneck under control,leading to very good delay and utilization result,making it more applicable to complex network environments.

Core Placement Algorithm for Multicast Routing with QoS Requirements

Differing from the source oriented algorithms, the Core Based Tree (CBT) multicast routing architecture establishes a single shared tree for multiple connections on a multicast group, which results in higher ratio of network resources utilization. In alluding to the problem of Core Placement, we propose a simple method (QOCP) to locate an optimal core node, which can minimize the multicast delay and inter destination delay variation simultaneously. The simulation results show that our method is very effective, and outperforms the other algorithms studied in this paper.

Dynamic data packing towards the optimization of QoC and QoS in networked control systems

A class of networked control systems is investigated whose communication network is shared with other applications. The design objective for such a system setting is not only the optimization of the control performance but also the efficient utilization of the communication resources. We observe that at a large time scale the data packet delay in the communication network is roughly varying piecewise constant, which is typically true for data networks like the Internet. Based on this observation, a dynamic data packing scheme is proposed within the recently developed packet-based control framework for networked control systems. As expected this proposed approach achieves a fine balance between the control performance and the communication utilization: the similar control performance can be obtained at dramatically reduced cost of the communication resources. Simulations illustrate the effectiveness of the proposed approach.