A QoS-enabled resource management scheme for F-HMIPv6 micro mobility approach

In the near future, wireless networks will certainly run real-time applications with special Quality of Service (QoS) requirements. In this context micro mobility management schemes such as Fast Handovers over Hierarchical Mobile IPv6 (F-HMIPv6) will be a useful tool in reducing Mobile IPv6 (MIPv6) handover disruption and thereby to improve delay and losses. However, F-HMIPv6 alone does not support QoS requirements for real-time applications. Therefore, in order to accomplish this goal, a novel resource management scheme for the Differentiated Services (DiffServ) QoS model is proposed to be used as an add-on to F-HMIPv6. The new resource management scheme combines the F-HMIPv6 functionalities with the DiffServ QoS model and with network congestion control and dynamic reallocation mechanisms in order to accommodate different QoS traffic requirements. This new scheme based on a Measurement-Based Admission Control (MBAC) algorithm is effective, simple, scalable and avoids the well known traditional resource reservation issues such as state maintenance, signaling overhead and processing load. By means of the admission evaluation of new flows and handover flows, it is able to provide the desired QoS requirements for new flows while preserving the QoS of existing ones. The evaluated results show that all QoS metrics analyzed were significantly improved with the new architecture indicating that it is able to provide a highly predictive QoS support to F-HMIPv6

Differentiated Predictive Fair Service for TCP Flows

The majority of the traffic (bytes) flowing over the Internet today have been attributed to the Transmission Control Protocol (TCP). This strong presence of TCP has recently spurred further investigations into its congestion avoidance mechanism and its effect on the performance of short and long data transfers. At the same time, the rising interest in enhancing Internet services while keeping the implementation cost low has led to several service-differentiation proposals. In such service-differentiation architectures, much of the complexity is placed only in access routers, which classify and mark packets from different flows. Core routers can then allocate enough resources to each class of packets so as to satisfy delivery requirements, such as predictable (consistent) and fair service. In this paper, we investigate the interaction among short and long TCP flows, and how TCP service can be improved by employing a low-cost service-differentiation scheme. Through control-theoretic arguments and extensive simulations, we show the utility of isolating TCP flows into two classes based on their lifetime/size, namely one class of short flows and another of long flows. With such class-based isolation, short and long TCP flows have separate service queues at routers. This protects each class of flows from the other as they possess different characteristics, such as burstiness of arrivals/departures and congestion/sending window dynamics. We show the benefits of isolation, in terms of better predictability and fairness, over traditional shared queueing systems with both tail-drop and Random-Early-Drop (RED) packet dropping policies. The proposed class-based isolation of TCP flows has several advantages: (1) the implementation cost is low since it only requires core routers to maintain per-class (rather than per-flow) state; (2) it promises to be an effective traffic engineering tool for improved predictability and fairness for both short and long TCP flows; and (3) stringent delay requirements of short interactive transfers can be met by increasing the amount of resources allocated to the class of short flows.National Science Foundation (CAREER ANI-0096045, MRI EIA-9871022

Traffic Congestion Pricing Methods and Technologies

This paper reviews the methods and technologies for congestion pricing of roads. Congestion tolls can be implemented at scales ranging from individual lanes on single links to national road networks. Tolls can be differentiated by time of day, road type and vehicle characteristics, and even set in real time according to current traffic conditions. Conventional toll booths have largely given way to electronic toll collection technologies. The main technology categories are roadside-only systems employing digital photography, tag and beacon systems that use short-range microwave technology, and in vehicle-only systems based on either satellite or cellular network communications. The best technology choice depends on the application. The rate at which congestion pricing is implemented, and its ultimate scope, will depend on what technology is used and on what other functions and services it can perform. Since congestion pricing calls for the greatest overall degree of toll differentiation, congestion pricing is likely to drive the technology choice.Road pricing; Congestion pricing; Electronic Toll Collection technology

Dynamic Traffic Scheduling and Resource Reservation Algorithms for Output-Buffered Switches

Scheduling algorithms implemented in Internet switches have been dominated by the best-effort and guaranteed service models. Each of these models encompasses the extreme ends of the correlation spectrum between service guarantees and resource utilisation. Recent advancements in adaptive applications have motivated active research in predictive service models and dynamic resource reservation algorithms. The OCcuPancy_Adjusting (OCP_A) is a scheduling algorithm focused on the design of the above-mentioned research areas. Previously, this algorithm has been analysed for a unified resource reservation and scheduling algorithm while implementing a tail discarding strategy. However, the differentiated services provided by the OCP _A algorithm can be further enhanced. In this dissertation, four new algorithms are proposed. Three are extensions of the OCP _A. The fourth algorithm is an enhanced version of the Virtual Clock (VC) algorithm, denoted as ACcelErated (ACE) scheduler. The first algorithm is a priority scheduling algorithm (i.e. known as the M-Tier algorithm) incorporated with a multitier dynamic resource reservation algorithm. Periodical resource reallocations are implemented. Thus. enabling each tier's resource utilisation to converge to its desired Quality of Service (QoS) operating point. In addition. the algorithm integrates a cross-sharing concept of unused resources between the various hierarchical levels to exemplify the respective QoS sensitivity. In the second algorithm. a control parameter is integrated into the M-Tier algorithm to ensure reduction of delay segregation effects towards packet loss sensitive traffic. The third algorithm, introduces a delay approximation algorithm to justify packet admission. The fourth algorithm enhances the VC scheduling algorithm. This is performed via the incorporation of dynamic features in the computation of the VC scheduling tag. Subsequently, the delay bound limitation of the parameter is eliminated