The success of future ATM networks depends on their ability to support a wide range of services and applications. Service scheduling schemes that control the order of servicing the cells within an ATM node are very important in providing diversify services. Recent research on service scheduling have focused on guaranteeing the delay performance. An infinite buffer ATM node is typically assumed and excessive cell losses may occur when used in a finite ATM node in practical situations. In this paper, we propose two novel service scheduling schemes that not only consider the delay performance but also improve the cell loss performance in finite buffer ATM nodes.
Network bandwidth is one of the major factors that impacts the cost of a video service.
These strategies are based on exploiting the periodic nature of MPEG compression for the purpose of reducing the bandwidth requirements while maintaining a high level of quality of service. We derive a theoretical bound on the call blocking probability at the server, and show how this bound can be used in off-line capacity planning and resource dimensioning. For on-line operation, we provide a simple CAC test that can be used in conjunction with the proposed bandwidth allocation and stream scheduling strategies. The effectiveness of our approach is evaluated through simulations of a video distribution network that consists of a server and several switches. Issues related to its practicality and implementation feasibility are discussed.