Adaptive CSFQ: determining the packet dropping probability adaptively for achieving fair bandwidth allocations in SCORE networks

Nabeshima, Masayoshi

doi:10.1016/s0140-3664(02)00188-3

Cited by 4 publications

(2 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…But this dropping probability is more destructive for TCP flows. This is because the TCP flows offer congestion control and minimizes the sending rate proportional to the congestion state of the network (Nabeshima, 2003).…”

Section: Issues In Packet Dropping Algorithmsmentioning

confidence: 99%

Stateless Aggregate Fair Marking Scheduler for Differentiated Service Networks

Sivasubramaniam¹

2013

Journal of Computer Science

View full text Add to dashboard Cite

In diffserv networks, as the traffic flows vary constantly, it is very difficult to maintain the per-flow state. The computation of rate information of the traffic flow also becomes complex. In this study, we propose a Stateless Aggregate Fair Marking (SAMQ) with Multiple Queue Priority Scheduler for Differentiated Service (DiffServ) networks. Initially, priority scheduler is applied to the flows entering the ingress edge router. If it is real time flow like Voice over IP (VoIP) or Video, then the packets are given higher priority else lower priority. In core router, for higher priority flows the Multiple Queue Fair Queuing (MQFQ) is applied that allows a flow to utilize multiple queues to transmit the packets. In case of lower priority, Stateless Aggregate Fair Marking technique is utilized. This technique applies Core Stateless Fair Queuing (CSFQ) technique for maintaining the rate information of packet flow and distributes the token to each incoming packet without maintaining the per-flow state. By simulation results, we show that this technique improves the throughput of non-real time flows.

show abstract

Section: Issues In Packet Dropping Algorithmsmentioning

confidence: 99%

Stateless Aggregate Fair Marking Scheduler for Differentiated Service Networks

Sivasubramaniam¹

2013

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…Nabeshima proposed ACSFQ [12] that determines adaptively packet dropping probability based on the flow arrival rate, the fair share rate, and the current queue length. ACSFQ defined different region of dropping probability to deal with TCP and UDP flows.…”

Section: Core Stateless Schemesmentioning

confidence: 99%

Core‐stateless fair rate estimation fair queuing

Lin

Yang

2005

Int J Communication

View full text Add to dashboard Cite

SUMMARYCore-stateless mechanisms, such as core-stateless fair queuing (CSFQ), reduce the complexity of fair queuing, which usually need to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require executing label rewriting and dropping decision on a per-packet basis, thus preventing them from being widely deployed. In this paper, we propose a novel architecture based on CSFQ without per-packet labelling. Similarly, we distinguish between edge routers and core routers. Edge routers maintain the per-flow state by employing a fair queuing mechanism to allocate each flow a fair bandwidth share locally and a token bucket mechanism to regulate those flows with feedback packets sent from egress edge routers. Core routers do not maintain per-flow state; they use FIFO packet scheduling extended by a fare rate alarm mechanism by estimating the arrival rate and the number of flows using a matching-mismatching algorithm. The novel scheme is called core-stateless fair rate estimation fair queuing (CSFREFQ). CSFREFQ is proven to be capable of achieving max-min fairness. Furthermore, we present and discuss simulations and experiments on the performance under different traffic scenarios.

show abstract