Embed Size (px)
Citation preview
Congestion Control in Wireless Flow-Aware Networks
Jerzy Dom˙zał, Member, IEEENirwan Ansari, Fellow, IEEE
Andrzej Jajszczyk, Fellow, IEEEDept. of Telecommun., AGH Univ. of Sci. & Technol., Krakow, Poland
2011 IEEE International Conference on Communications (ICC)
Outline
I. Introduction
I. Introduction(cont.)
Existing solutions RAMAF
For wired network For wired-wireless network
Homogeneity Heterogeneity
In the congestion-less state :Real-time
In the congestion-less state : Real-time
In the congestion state : Not Real-time
In the congestion state : Real-time
II. Flow-aware networks
II. Flow-aware networks(cont.)Goal: To achieve efficient packet transmission with the minimal knowledge of the network.
Traffic
Streaming usually used by real-time applications
Elastic carries best effort traffic
II. Flow-aware networks(cont.)
II. Flow-aware networks(cont.)
the cross-protect routers (also denoted as XP’s) composed of two blocks, the admission control (AC)and the scheduler.
II. Flow-aware networks(cont.)
makes decisions of accepting or rejecting packets
II. Flow-aware networks(cont.)
II. Flow-aware networks(cont.)
In the congestion-less state
ID1
ID1
II. Flow-aware networks(cont.)
In the congestion-less state
ID2
ID1
ID2
ID1
II. Flow-aware networks(cont.)
In the congestion-less state
ID3
ID1
ID2
ID3
ID1
ID2
II. Flow-aware networks(cont.)
In the congestion-less state
ID1
ID2
ID3
ID4
…
IDn
ID1
ID2
ID4
IDn
Pfl_flow_timeout time
II. Flow-aware networks(cont.)
In the congestion-less state
ID1
ID2
ID4
…
IDn
II. Flow-aware networks(cont.)
fair_rate || priority_load > certain threshold
ID1
ID2
ID4
…
IDn
II. Flow-aware networks(cont.)
In the congestion state
ID1
ID2
ID4
…
IDn
II. Flow-aware networks(cont.)
ID1
ID1
ID2
ID4
…
IDn
In the congestion state
II. Flow-aware networks(cont.)
ID2
ID1
ID2
ID4
…
IDn
In the congestion state
II. Flow-aware networks(cont.)
ID3
ID1
ID2
ID4
…
IDn
In the congestion state
II. Flow-aware networks(cont.)• scheduling algorithms were proposed for FAN
– PFQ (Priority Fair Queuing)– PDRR (Priority Deficit Round Robin)
III. Wireless transmission in FAN
III. Wireless transmission in FAN(cont.)• Wireline transmission in FAN has been reported in
the literature. QoS aspects as well as reliability of transmission in FAN are analyzed.
• However, FAN with respect to wireless transmission has not been reported.
III. Wireless transmission in FAN(cont.)
IV. Congestion control in FAN
IV. Congestion control in FAN(cont.)
EFM(Enhanced Flushing Mechanism)
The ids of all elastic flows are periodically removed from PFL if the outgoing link is congested.
RAEF(Remove Active Elastic Flows)
Removes the ids of flows which are active for time equal or greater than the value given by the active time parameter.
RBAEF (Remove and Block Active Elastic Flows)
The ids removed from PFL are added to the blocked flow list for a short time.
RPAEF (Remove and Prioritize in access Active Elastic Flows)
The ids removed from PFL are added to the priority in access flow list for a short time.
IV. Congestion control in FAN(cont.)
IV. Congestion control in FAN(cont.)
IV. Congestion control in FAN(cont.)
V. Simulation analysis
V. Simulation analysis(cont.)
V. Simulation analysis(cont.)
1 Gbit/s capacity
FAN routers
100 Mbit/s capacity
1 Gbit/s capacity
5 Mbit/s capacity
V. Simulation analysis(cont.)
V. Simulation analysis(cont.)
VI. Conclusion
VI. Conclusion(cont.)• The paper presents the feasibility of realizing the
wireless transmission in FAN, and proposes a new congestion control mechanism to improve the transmission of streaming flows.
• Goal– To analyze wireless transmission in FAN– To present the new congestion control mechanism for FAN,
called RAMAF.
縮寫 英文說法 拉丁原文i.e. that is id est
e.g. for example exempli gratia
etc. and so forth/and the next et cetera
p. page
pp. pages
Weekly sentence
Four congestion control mechanisms have been proposed for FAN [9], i.e., EFM (Enhanced Flushing Mechanism), RAEF (Remove Active Elastic Flows), RBAEF (Remove and Block Active Elastic Flows), and RPAEF (Remove and Prioritize in access Active Elastic Flows).
