Differentiated services with multiple random early detection algorithm using ns2 simulator

Qadeer, Mohammed A.; Sharma, Vikas; Agarwal, Ankit; Husain, Sattar

doi:10.1109/iccsit.2009.5234732

Cited by 10 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Its idea is based on a dropping function yielding probability that a packet is rejected. There are many researches concerning improvement of the RED efficiency [4][5][6][7][8][9][10]. The existing varieties of the RED algorithm mostly differ in the way of defining the packet dropping probability functions [11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

The choice of optimal 3-rd order polynomial packet dropping function for NLRED in the presence of self-similar traffic

Domańska¹,

Domański²

2012

Bulletin of the Polish Academy of Sciences: Technical Sciences

View full text Add to dashboard Cite

Algorithms of queue management in IP routers determine which packet should be deleted when necessary. The article investigates the influence of the self-similarity on the optimal packet rejection probability function in a special case of NLRED queues. This paper describes another approach to the non-linear packet dropping function. We propose to use the solutions based on the polynomials with degree equals to 3. The process of obtaining the optimal dropping packets function has been presented. Our researches were carried out using the Discrete Event Simulator OMNET++. The AQM model was early verified using the discrete-time Markov chain. The obtained results show that the traffic characteristic has the great impact on the network node behavior, but self-similarity of network traffic has no influence on the choosing of the optimal dropping packet function.

show abstract

Section: Introductionmentioning

confidence: 99%

The choice of optimal 3-rd order polynomial packet dropping function for NLRED in the presence of self-similar traffic

Domańska¹,

Domański²

2012

Bulletin of the Polish Academy of Sciences: Technical Sciences

View full text Add to dashboard Cite

show abstract

“…One is Random Early Detection algorithm [4] which is based on some fixed minimum and maximum values of threshold and the other is Virtual Output Queue algorithm. This method has calculated the number of drop packets with different number of sources, different number of flows and with different queue sizes at the edge router.…”

Section: Discussionmentioning

confidence: 99%

“…Random Early Detection (RED [4] is an active queue mechanism technique [6] [8]. It is also known as random early drop or random early discard.…”

Section: Random Early Detectionmentioning

confidence: 99%

Comparative analysis of random early detection (RED) and virtual output queue (VOQ) algorithms in differentiated services network

Rajput¹,

Kumar

Paul³

2014

2014 International Conference on Signal Processing and Integrated Networks (SPIN)

View full text Add to dashboard Cite

with growing internet using demands, the need of services at various scales of Quality of Service (QoS) has made appropriate classification of these types of services mandatory. Therefore, the Differentiated Services Architecture has been proposed for service differentiation at various scales of services. DiffServ network is based on traffic classification mechanism. To measure the measurement of network performance of queue mechanism at router is a very crucial and important task. A number of queue algorithms have been proposed to reduce the routing problems in DiffServ network where priority of packets is a major concern for evaluating the network performance. This paper focuses on queue mechanism at edge router which has to select the higher priority packets enter first into the network. The aim of this work is to minimize the number of drop packets at the edge router. The paper considers performance (in terms of no. of packet drop, average end to end delay) comparison of Random Early Detection algorithm (RED) and Virtual Output Queue (VOQ) algorithm in different network conditions using Network Simulator-2.

show abstract

“…In the carried out simulation PRI is used as the scheduling policy and token bucket is used for classifying the packets and policing the traffic. A modified version of RED [6,7] is used in DiffServ architecture. Traffic is aggregated into different flows i.e.…”

Section: Diffserv Implementation With Pri Schedulingmentioning

confidence: 99%

Implementing and Testing Priority Scheduler and Token Bucket Policer in differentiated Service

Kulhari¹,

Pandey²,

Shukla³

2014

IJCA

View full text Add to dashboard Cite

Internet applications are growing rapidly. The requirement of QoS by these applications varies from very lenient to strict. Maintaining QoS is one of the most typical and challenging task in such scenario. Differentiated services architecture is very popular in such scenario. Differentiated Services is a practical method to implement traffic based service differentiation works on traffic aggregation, per hop behaviour forwarding. Differentiated services uses classifiers to categorize traffic in to flows, policies are defined to allocate the resources to flows and policers are used to shape the bursty traffic whereas schedulers are used to forward the traffic from various traffic queues.

show abstract

Differentiated services with multiple random early detection algorithm using ns2 simulator

Cited by 10 publications

References 9 publications

The choice of optimal 3-rd order polynomial packet dropping function for NLRED in the presence of self-similar traffic

The choice of optimal 3-rd order polynomial packet dropping function for NLRED in the presence of self-similar traffic

Comparative analysis of random early detection (RED) and virtual output queue (VOQ) algorithms in differentiated services network

Implementing and Testing Priority Scheduler and Token Bucket Policer in differentiated Service

Contact Info

Product

Resources

About