Rate-based path selection for shortest path bridging in access networks

Nakayama, Yu

doi:10.1109/icc.2014.6883495

Cited by 4 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [2], the author proposes an algorithm that performs ratebased path selection in access networks. However, instead of directly monitoring the bandwidth utilization, the average input rate of TCP flows is used instead.…”

Section: B Related Workmentioning

confidence: 99%

Effects of port congestion in the gate control list scheduling of time sensitive networks

Kentis

Berger

Soler

2017

2017 8th International Conference on the Network of the Future (NOF)

View full text Add to dashboard Cite

Abstract-Time Sensitive Networking (TSN) can provide deterministic traffic behavior over Ethernet networks, for time sensitive traffic, whilst also bound the delay/jitter. To do so, the IEEE TSN working group introduced a network-wide transmission port scheduling mechanism. The duration of this schedule is directly related with the delay; hence reducing it can be beneficial within the TSN paradigm. This paper investigates the effects of port congestion, in the duration of the network wide schedule. A congested port can make scheduling more complex, leading to longer network-wide schedules. To verify this, the same set of experiments was repeated, with and without considering port congestion during path allocation. The computed paths were given as input to an implementation of the shifting bottleneck heuristic algorithm. The shifting bottleneck heuristic, computed the network-wide gating schedule. The results show that with port congestion as a metric during path allocation the duration of the gating schedule in multipath networks can be reduced up to 26%.

show abstract

Section: B Related Workmentioning

confidence: 99%

Effects of port congestion in the gate control list scheduling of time sensitive networks

Kentis

Berger

Soler

2017

2017 8th International Conference on the Network of the Future (NOF)

View full text Add to dashboard Cite

show abstract

“…In this paper, we propose a rate-based path selection scheme based on a previously proposed load balancing scheme [5,6]. The concept of the proposed scheme is to assign flows to each path according to optimized proportions determined by the link metric optimization.…”

Section: Proposed Scheme 21 Conceptmentioning

confidence: 99%

Rate-based path selection based on link metric optimization in SPBM

Nakayama

Yasunaga

2014

IEICE ComEX

Self Cite

View full text Add to dashboard Cite

Link metric optimization is crucial for load balancing in a shortest path bridging MAC (SPBM) network. Link metrics and traffic assignment proportions can be optimized by solving a linear programming problem using traffic demand. However, how to assign actual flows so that they are consistent with the optimized proportions has yet to be discussed. This paper proposes a rate-based path selection scheme. The concept is to assign flows to each path so that the total rates of the assigned flows approach the planned rates. With computer simulations, we confirmed that with the proposed scheme flows were assigned to each path so that they were consistent with the optimized proportions.

show abstract