To guarantee the timely provisioning of QoS to real-time oriented multiparty and distributed computing applications (e.g., video conferencing and grid computing) that require the utilization of time and quantity-related resources, the resource should be reserved in advance. However, this new type of reservation (i.e., advance reservation) may collide with legacy (i.e., immediate) reservations that do not specify their session duration. In this paper, to suggest a balanced solution between sharing pools of resources and the managing of collisions between reservation calls, a revenue-based resource sharing scheme (focusing on the bandwidth) is proposed. The proposed scheme attempts to avoid possible collisions by employing a virtual profile of resources reserved in advance in an effort to achieve enhanced resource utilization. It is shown through NS-2 [22] -based network simulations that the proposed scheme can achieve balanced performance when compared with other schemes, including static resource partitioning and complete resource sharing.

This letter addresses the QoS issue of a RSVP flow during handoff events. For the QoS guarantee of real-time applications with RSVP reservation in All-IP wireless networks, mechanisms are required to minimize the resource reservation path changes and the packet loss resulting from handoff events. If the new RSVP reservation is made along the path via a new base station (BS) in advance for soft handoff, on-going RSVP flow session can be kept with the guaranteed QoS. Therefore, we propose a seamless switching scheme of RSVP branch path for soft handoff. We also show that this scheme could provide the QoS guarantee by adaptively adjusting the pilot signal threshold values for soft handoff.

One drawback of Integrated service architecture is the scaling problem. Therefore, flow aggregation is an important solution for supporting quality of service in large-scale network. In advance reservation, priori information of advance-reserved requests can be used for flow aggregation before their initiation time. However, an impolitic aggregation can lead to violate admission control. In this paper, we propose an effective algorithm to aggregate advance-reserved requests with guaranteed delay. The proposed algorithm not only can reduce the amount of state in core network but also minimize the bandwidth consumption. The simulation result indicates that the state in the core network can be reduced as low as 17.3% even in the worst case.