Browsing by Author "Saha, Debanjan"
Now showing 1 - 3 of 3
Results Per Page
Sort Options
Item Carry-Over Round Robin: A Simple Cell Scheduling Mechaniasm for ATM Networks(1998-10-15) Saha, Debanjan; Mukherjee, Sarit; Tripathi, Satish K.We propose a simple cell scheduling mechanism for ATM networks. The proposed mechanism, named Carry-Over Round Robin (CORR), is an extension of weighted round robin scheduling. We show that albeit its simplicity, CORR achieves tight bounds on end-to-end delay and near perfect fairness. Using a variety of video traffic traces we show that CORR often outperforms some of the more complex scheduling disciplines such as Packet-by-Packet Generalized Processor Sharing (PGPS). (Also cross-referenced as UMIACS-TR-96-45)Item Multirate Scheduling of VBR Video Traffic in ATM Networks(1998-10-15) Saha, Debanjan; Mukherjee, Sarit; Tripathi, Satish K.(Also cross-referenced as UMIACS-TR-96-44)Item Title of Dissertation: Supporting Distributed Multimedia Applications on ATM Networks(1998-10-15) Saha, DebanjanATM offers a number of features, such as high-bandwidth, and provision for per-connection quality of service guarantees, making it particularly attractive to multimedia applications. Unfortunately, the bandwidth available at ATM's data-link layer is not visible to the applications due to operating system (OS) bottlenecks at the host-network interface. Similarly, the promise of per-connection service guarantees is still elusive due to the lack of appropriate traffic control mechanisms. In this dissertation, we investigate both of these problems, taking multimedia applications as examples. The OS bottlenecks are not limited to the network interfaces, but affect the performance of the entire I/O subsystem. We propose to alleviate OS's I/O bottleneck by according more autonomy to I/O devices and by using a connection oriented framework for I/O transfers. We present experimental results on a video conferencing testbed demonstrating the tremendous performance impact of the proposed I/O architecture on networked multimedia applications. To address the problem of quality of service support in ATM networks, we propose a simple cell scheduling mechanism, named carry-over round robin (CORR). Using analytical techniques, we analyze the delay performance of CORR scheduling. Besides providing guarantees on delay, CORR is also fair in distributing the excess bandwidth. We show that albeit its simplicity, CORR is very competitive with other more complex schemes both in terms of delay performance and fairness. (Also cross-referenced as UMIACS-TR-95-88)