Name
Abstract | ||
|---|---|---|
The IEEE 802.11 protocol has become the de facto standard in wireless LANs. However, it reveals the unfairness problem between unicast flows and multicast flows since multicast packets are not subject to binary exponential backoff. To prevent a multicast flow from overwhelming the wireless link bandwidth is a crucial issue. This paper seeks to achieve fairness between unicast and multicast flows by introducing Unicast-Friendly Multicast (UFM). The central idea behind the UFM algorithm is to dynamically change the contention window size for multicast packets to limit the bandwidth share of a multicast flow equal to that of a unicast flow. The proposed UFM algorithm adjusts the multicast contention window size depending on the number of competing stations. We present two versions of UFM: the first one calculates the multicast window size by inferring the average contention window size of unicast flows, while the second one maintains the mapping table between the number of competing stations and the corresponding multicast window size given by related analysis. Simulation reveals that both versions of UFM achieve the fairness by providing almost the fair share of bandwidth to each flow regardless of unicast or multicast under the saturated network conditions. I. I NTRODUCTION |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/CCNC.2006.1593135 | Consumer Communications and Networking Conference, 2006. CCNC 2006. 3rd IEEE |
Keywords | DocType | Volume |
local area networks,bandwidth,routing protocols,unicast,internet | Conference | 2 |
ISSN | ISBN | Citations |
2331-9852 | 1-4244-0085-6 | 6 |
PageRank | References | Authors |
0.86 | 7 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nakjung Choi | 1 | 389 | 29.64 |
| Jiho Ryu | 2 | 233 | 14.26 |
| Yongho Seok | 3 | 304 | 23.09 |
| Yanghee Choi | 4 | 2235 | 188.82 |
| Taekyoung Kwon | 5 | 1894 | 153.24 |