Presentation is loading. Please wait.

Presentation is loading. Please wait.

Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005.

Similar presentations


Presentation on theme: "Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005."— Presentation transcript:

1 Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005

2 Wireless Mesh Networks Similar to ad-hoc networks Characteristics Cheaper deployment Connectivity Redundancy Current Technologies Hardware 802.11b Proprietary Software Proprietary Open Source Open Challenges Security No standard yet – 802.11s

3 Internet Motivation Multiple user access causes contention for network access MAC layer governs individual node access Network layer governs flows Study network layer queuing methods Implement packet assignment to control flows for QoS

4 802.11 – MAC layer Carrier Sense Multiple Access / Collision Avoidance (CSMA/CA) Optional RTS/CTS Random Backoff

5 Priority Assignment Methods Strict Priority Queuing Queue Queue 0 Queue 1 Queue 2 Flow 0 Flow 1 Flow 2 If packets in queue else FIFO

6 Queue 0 Queue 1 Queue 2 Flow 0 Flow 1 Flow 2 Probability 0.1 Probability 0.2 Probability 0.7 Priority Assignment Methods Weighted Fair Queuing

7 Our Queuing Strategy Enqueue Service packets with combination of strict priority and weighted fair queuing Multiple queues Categorize packets according to type and source Controllable weights Queue 0 Queue 1 Queue 2 Routing Packets Own Packets Others’ Packets

8 Queue 0 Queue 1 Queue 2 If packets exist MAC layer If packets exist else Probability p Probability 1- p Our Queuing Strategy Dequeue Routing packets always serviced first Modify p to change weights Threshold = probability of choosing others’ packet over own packet

9 ns-2 The Network Simulator ns-2 Event driven Open source Network Animator NAM http://www.isi.edu/nsnam/ns/

10 Simulations Types of traffic Constant Bit Rate traffic over UDP UDP is unreliable, one way traffic. FTP traffic over TCP TCP is reliable, two way traffic with flow control. Metrics Calculate end-to-end throughput for TCP Calculate end-to-end success rate for UDP Simulation time of 1000s Random starting time between 1~2s Assumed error-free transmission Five trials each

11 Triple Chain I T 0 1 3 2 Nodes in range connected by dashed lines

12 Triple Chain UDP 200KBps CBR traffic One hop Two hop Dashed – Original Solid - Priority

13 Triple Chain TCP One hop Two hop Dashed – Original Solid - Priority

14 Quad Chain I T1 T2 0 1 2 Each 200Kbps CBR traffic

15 Quad Chain UDP Results Flow 2 Original Flow 0 Original Flow 1 Original Flow 2 New Flow 0 New Flow 1 New

16 Quad Chain UDP Results Flow 1 New Flow 0 New Flow 2 New

17 Quad Chain TCP TCP throughput for 3-hop flow was terrible Lack of MAC access prevents packets from being sent With few packets, queuing method has no effect 802.11 not efficient for multi-hop networks as documented in literature

18 Small Mesh 100Kbps CBR traffic I 2 2 4 5 0 1 3

19 Small Mesh UDP Results Two hop One hop Three hop Flow 4/5 Original Flow 2 Original

20 Conclusion Results show throughput is unbalanced using FIFO Priority queuing allocates bandwidth among flows In our simulations, thresholds of 0.5 to 0.7 distributed throughput most equally

21 Future Work Implement different priority assignment strategies Identify potential objectives to guide priority assignment Ensure throughput regardless of route length by categorizing packets according to number of hops taken Ensure throughput of certain users by categorizing packets according to source Ensure throughput of certain applications by categorizing according to packet type Static vs. dynamic priority assignment Devise a performance criteria to evaluate fairness

22 Acknowledgement Professor K.C. Wang Professor D. Noneaker Professor X.B. Xu Clemson University NSF

23 References Acharya, Misra, and Bansal. Design and Analysis of a Cooperative Medium Access Scheme for Wireless Mesh Networks Akyildiz, Wang, and Wang. Wireless Mesh Networks: A Survey Corson, Macker and Batsell. Architectural Considerations for Mobile Mesh Networking Jun and Sichitiu. The Nominal Capacity of Wireless Mesh Networks Kanodia, Li, Sabharwal, Sadeghi, and Knightly. Distributed Multi-Hop Scheduling and Medium Access with Delay and Throughput Constraints Karrer, Sabharwal, and Knightly. Enabling Large-scale Wireless Broadband: The Case for TAPs Kurose and Ross. Computer Networking: A Top-down Approach Featuring the Internet Raniwala and Chiueh. Architecture and Algorithms for an IEEE 802.11-Based Multi- Channel Wireless Mesh Network Peterson and Davie. Computer Networks Schwartz. Mobile Wireless Communications Tsai and Chen. IEEE 802.11 MAC Protocol over Wireless Mesh Networks: Problems and Perspectives Wang and Ramanathan. End-to-end Throughput and Delay Assurances in Multihop Wireless Hotspots Yin, Zeng, and Agrawal. A Novel Priority based Scheduling Scheme for Ad Hoc Networks


Download ppt "Priority Queuing Achieving Flow ‘Fairness’ in Wireless Networks Thomas Shen Prof. K.C. Wang SURE 2005."

Similar presentations


Ads by Google