Abstract not found

In new applications like groupware systems, broadcast communication of various kinds of data like transactions and files is required. In these applications, some of protocol data units (PDUs) with control data like transactions have to be delivered earlier than another PDU. One approach to providing various kinds of communications like control data transmission and file transfer by using a common communication channel is to give a priority to each PDU and to deliver PDUs with higher priority to the destination earlier than lower ones. In this paper, we discuss broadcast protocols which provide priority-based receipt ordering of PDUs for entities in the cluster. We present distributed broadcast protocols which provide the prioritybased receipt ordering of PDUs by using a single channel system like Ethernet and radio systems.

In recent years, fair scheduling and quality of service (QoS) in wireless LANs have received significant attention from the networking research community. This paper presents a distributed algorithm for priority and fair scheduling in a wireless LAN. The proposed protocol is derived from HIPERLAN which is a wireless LAN standard defined by ETSI. The proposed protocol supports multiple priorities, as well as a mechanism (using weights) for controlling the way bandwidth is shared by ows within a given priority level.

EQuB is an overlay mechanism to Ethernet’s MAC protocol that provides QoS guarantees to real-time applications. In its basic form, EQuB relies on the sensing and collision detection abilities of standard network interface cards and, in addition, requires only that those cards be capable of sending jam signals—so called black bursts—of pre-specified durations. EQuB gives access priority to realtime traffic, provides round-robin service among real-time hosts and guarantees a small, bounded delay to real-time packets. We also discuss enhancements to the basic EQuB mechanism that improve its performance. Simulation results are presented that assess the performance of 10 and 100BASE-T Ethernet LANs with a mixed population of data and real-time hosts. We conclude that, in spite of the priority attained by real-time traffic, data packet delays are not significantly affected as data load is traded for real-time load, and this is because EQuB dispatches packets to the channel much more efficiently than Ethernet’s MAC protocol. 1.

Priority and Fair Scheduling in Wireless Local Area Networks. (August 2001) Anurag Dugar, B.E., Karnataka Regional Engineering College, India Co--Chairs of Advisory Committee: Dr. Nitin H. Vaidya Dr. A. L. Narasimha Reddy In recent years, fair scheduling and quality of service (QoS) in Wireless Local Area Networks have received significant attention from the networking research community. This thesis presents a distributed Medium Access Control (MAC) protocol for priority and fair scheduling in a Wireless Local Area Network. The proposed protocol supports multiple priorities, as well as a mechanism (using weights) for controlling the way bandwidth is shared by flows within a given priority level. iv To Nani, Mummy and Papa v ACKNOWLEDGMENTS I would like to thank my advisor and co-chair Dr. Vaidya for all his guidance, encouragement and valuable comments. His enthusiasm towards research and teaching has been a great source of inspiration. He has been a great mentor and has always been there to o#er me advice regarding academics and career. Without his help and support, my graduate school experience would not have been so fulfilling. I would like to thank my co-chair Dr. Reddy for all his guidance and time. He has always been very supportive and helpful. I would like to thank Dr. Choi for being part of my advisory committee. I would like to thank the members of the Mobile Computing and Networking group for the numerous discussions we had in di#erent areas of Wireless and Mobile ad hoc Networks. Being a part of this group has greatly enhanced my knowledge and has opened up my mind to various research possibilities in the area of Wireless and Mobile ad hoc Networks. I would like to thank NSF and Microsoft Research for supporting me financially to carry out resear...

In distributed applications like teleconferencing, various kinds of data like transactions, files, and voice have to be delivered to multiple destinations. Current high-speed networks like the FDDI provide highreliable broadcast communication. However, since the processing speed of the communication entities is slower than the transmission speed of the network, the entities may fail to receive protocol data units (PDUs) transmitted through the network due to the buffer overrun. Some data units like control data have to be delivered to the destinations earlier than another PDUs. One approach to providing various kinds of communication by using a single-channel network is to give a priority to each PDU and to deliver higher-priority PDUs to the destinations earlier than lower-priority ones. In this paper, we discuss a distributed broadcast protocol which provides priority-based receipt ordering of PDUs for the application entities by using the highspeed single-channel network in the pres...