-
[show abstract]
[hide abstract]
ABSTRACT: The paper extends our proposed admission control scheme which was designed to handle only real time UDP flows to also accommodate elastic TCP flows in the network. The proposed implicit proactive admission control technique operates by reserving network resources on a proactive manner. The blocking probability measure is used as a flow admission decision parameter. Effectiveness of the proposed admission control scheme is shown here through a detailed simulation. The scheme is found to be robust for different aggregates of UDP and TCP traffic flows. The technique also results in a better bottleneck link utilization at a comparatively lower overhead traffic.
Advances in Recent Technologies in Communication and Computing, 2009. ARTCom '09. International Conference on; 11/2009
-
[show abstract]
[hide abstract]
ABSTRACT: The paper proposes an admission control scheme which reserves network resources on a proactive basis. The current flow arrival and departure patterns are used to determine the future demand for network resources using the telephone networks Erlang-B model. The Erlang model derives the traffic-QoS relationship in terms of the blocking probability of the network resource given the network capacity, its current utilization and future demand. The same principle is remodeled here to suit the IP network. The blocking probability thus measured is used as a flow admission decision parameter. The effectiveness of the scheme over the other flow admission control algorithms is determined here. Detailed simulations of the proposed algorithm result in a higher admission rate and higher bottleneck link utilization at a comparatively lower overhead traffic.
Networks, 2006. ICON '06. 14th IEEE International Conference on; 10/2006
-
[show abstract]
[hide abstract]
ABSTRACT: A DiffServ network is capable of providing varying quality of service based on the policies defined for an aggregate. The traffic flows which form the aggregate get monitored. The flow packets which do not confine the policies get dropped. Such policy definitions are prefixed and they do not reflect the current internal state of the network. For this, it is proposed to make use of an endpoint admission control strategy. In such schemes admission decisions are usually based on packet drop rate and to some extent on inter-packet delay variation. In this paper we propose an admission decision scheme which extends the principles of estimation of blocking probability in a telecommunication network to the IP network. This scheme is then compared with the above two varieties of decision schemes. Such a comparison leads to a fact that by the use of the proposed scheme an effective utilization of the bottleneck link equivalent to inter-packet delay variation scheme can be achieved at a reduced overhead traffic. Whereas, packet drop rate based admission control results in far lower link utilization.
INDICON, 2005 Annual IEEE; 01/2006
