DocumentCode :
33953
Title :
N Rate {\\rm N}+1 Color Marking: Per-Flow Fairness in Ring Aggregation Networks
Author :
Nakayama, Y. ; Oota, N.
Author_Institution :
NTT Access Network Service Syst. Labs., NTT Corp., Yokosuka, Japan
Volume :
62
Issue :
12
fYear :
2014
fDate :
Dec. 2014
Firstpage :
4401
Lastpage :
4412
Abstract :
Our study is motivated by the need for per-flow fairness in a ring aggregation network. This paper proposes a multicolor marking and queuing delay suppression scheme called N rate N + 1 color marking (NRN + 1 CM) that is designed to achieve per-flow fairness. The key idea is to assign a color to a frame according to the flow input rate with high burst tolerance using a simple marker. The color indicates the dropping priority. When congestion occurs, frames are selectively discarded based on their color and the dropping threshold. The accumulation of queuing delay is suppressed with a dropping threshold notification process. The effect of NRN+1 CM was confirmed by a theoretical analysis and computer simulations.
Keywords :
graph colouring; local area networks; queueing theory; synchronisation; telecommunication network topology; N rate N + 1 color marking; NRN + 1 CM; burst tolerance; dropping priority; dropping threshold notification process; multicolor marking; per-flow fairness; queuing delay suppression scheme; ring aggregation networks; Analytical models; Bandwidth; Delays; Network topology; Threshold analysis; Throughput; Communication system traffic control; Metropolitan area networks; Packet switching; Quality of service; metropolitan area networks; packet switching; quality of service;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOMM.2014.2369038
Filename :
6951362
Link To Document :
بازگشت