Presentation	2014-03-07 Per-flow fairness in ring aggregation networks with signaling and flags Yu NAKAYAMA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	Fairness is an important issue as regards a ring aggregation network. We have proposed a bandwidth allocation algorithm and a multicolor marking algorithm. The equipment cost increases with the bandwidth allocation algorithm because per-flow queue for station flows is required in each node. The application range of the multicolor marking algorithm is limited because it writes a specific sequence on a frame header. This paper proposes a fairness algorithm with signaling between nodes and flags. With the proposed algorithm, per-flow fairness is realized with shared queue and without using a frame header.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	access network / ring network / fairness / congestion control
Paper #	CAS2013-119,SIP2013-165,CS2013-132
Date of Issue

Conference Information
Committee	CS
Conference Date	2014/2/27(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Communication Systems (CS)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Per-flow fairness in ring aggregation networks with signaling and flags
Sub Title (in English)
Keyword(1)	access network
Keyword(2)	ring network
Keyword(3)	fairness
Keyword(4)	congestion control
1st Author's Name	Yu NAKAYAMA
1st Author's Affiliation	NTT Access Network Service Systems Laboratories, NTT Corporation()
Date	2014-03-07
Paper #	CAS2013-119,SIP2013-165,CS2013-132
Volume (vol)	vol.113
Number (no)	465
Page	pp.pp.-
#Pages	6
Date of Issue