Network delay analysis of a (σ, ρ) - Regular traffic stream over multiple paths in a network of fair-queuing servers

In this paper, we analyze the worst-case delay performance of a network of fair queuing servers in case of multiple-paths between source-destination pairs. In order to develop worst-case delay analysis for the multiple-path scenario, two challenging events should be addressed: merging different sub-streams of a session as well as distributing a traffic stream among different paths (traffic partitioning). Specifically, we propose to merge incoming sub-streams of a session to a node according to a limited rate Fair Queuing (FQ) scheme. Although the merged stream is treated as a unity, this approach results in a guaranteed level of service to each sub-stream. In addition, an algorithm is proposed for partitioning of a traffic stream into multiple sub-streams. Upon presented algorithms in this paper and their performance analysis, an equivalent worst-case service curve is concluded for the paths between a source-destination pair. According to the achieved service curve, an integrated upper bound on the end to end delay of a (σ, ρ)-regular traffic stream is derived in case of multi-path routing scenario.