Fairness with N Rate N+1 Color Marking on Cascade Aggregation for Access Network

Oota

2014

IEEE Trans. Commun.

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.Index Terms-Communication system traffic control, quality of service, metropolitan area networks, packet switching. 0090-6778

Section: B Marking Algorithmmentioning

confidence: 99%

“…In this paper, we propose N rate N + 1 color marking (NRN+1CM) to achieve per-flow fairness in ring aggregation networks. The basic concept was proposed in [4]. The key idea is to assign a color to a frame according to the input rate with one token bucket per flow.…”

Section: Introductionmentioning

confidence: 99%

N Rate <inline-formula> <tex-math notation="TeX">${\rm N}+1$</tex-math></inline-formula> Color Marking: Per-Flow Fairness in Ring Aggregation Networks

Oota

2014

IEEE Trans. Commun.

“…To deploy access networks efficiently in areas with a low subscriber density, wavelength division multiplexing-based optical access networks [5], [6], and a cascade aggregation [7] have been proposed. These network architectures can link multiple offices to each other and connect subscriber lines efficiently to the core network.…”

Section: Introductionmentioning

confidence: 99%

Dynamic Access Network Reorganization for the Depopulation Age

IEEE Trans. Syst. Man Cybern, Syst.

2015

The populations of industrialized countries will decline over the coming decades. To ensure that we have efficient access networks in the coming age of depopulation, it is important to consider the reorganization of central offices over time. The cost for operating and maintaining central offices can be reduced by efficiently closing central offices. However, dynamic facility location models that have been developed largely focused on the problem of optimally expanding a network over time to meet increasing demand. The practical relevance of the dynamic models is limited because the complexity and the required amount of data are much greater than with static models. This paper proposes a dynamic access network reorganization model for the depopulation age. Although the proposed model is a dynamic model, it is simple because it assumes that the only option will be to close central offices. The model first searches for a set of optimal solutions for each planning period as a capacitated facility location problem. Then, it selects the optimal combination of optimal solutions that can minimize the total number of open offices with the limitation of network reorganization. The validity of the proposed model was evaluated with computer simulations. It was confirmed that although the proposed model is a dynamic model it is simple and practical.

“…For example, it can be estimated with the marking threshold of N rate N+1 color marking (NRN+ 1CM [4] or the frame arrival time [8].…”

Section: Algorithmmentioning

confidence: 99%

“…The link cost was assumed to be the same for all links. We assumed that NRN+1CM [4] works in an SPBM network to realize fairness of user throughput during congestion.…”

Section: Assumptionsmentioning

confidence: 99%

Path selection algorithm for shortest path bridging in access networks

Oota

2013

IEICE ComEX

With shortest path bridging MAC (SPBM) in an access network, the paths of high rate flows can overlap on specific links and this results in congestion. It is important to avoid congestion by selecting the optimal path for each flow. This paper proposes a path selection algorithm for access networks with SPBM. The proposed algorithm avoids selecting a congested path. When a new flow arrives at an edge SW, the SW selects the path with the highest average input rate of assigned flows. We confirmed with computer simulations that the proposed algorithm could efficiently utilize links and improve throughput fairness.