Enhanced weighted round robin schedulers for accurate bandwidth distribution in packet networks

Francini, Andrea; Chiussi, F.M.; Clancy, R. T.; Drucker, Kevin D.; Idirene, Nasser E.

doi:10.1016/s1389-1286(01)00229-8

Cited by 11 publications

(18 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results for average packet delay reflect only the propagation delay and queuing delay components experienced by the packet when it traverses the network from source node to destination node. For easier comparison of results obtained in different traffic load scenarios we defined the relative delay deviation RDD, given in Equation (8). RDD gives the deviation of the actual packet delay ðD P Þ from the delay ðD P min Þ it would have experienced if it had traversed the shortest route in an empty network (i.e.…”

Section: Simulation Resultsmentioning

confidence: 99%

“…Deficit round robin (DRR) scheduling policy serves in turn the particular traffic class, as long as the sum of the packet lengths does not exceed the bandwidth allocated to that traffic class [8]. Since the packet, which would cause violation of the allocated bandwidth, is not actually transmitted, each traffic class is always in deficit (i.e.…”

Section: Route Execution Phasementioning

confidence: 99%

“…fewer packets are served than the allocated bandwidth). On the contrary, in the case of surplus round robin (SRR) scheduling policy, the packet is transmitted even if the running sum exceeds the allocated bandwidth due to the addition of its length [8]. Because the exceeding packet is served before the scheduler starts serving the next traffic class, each traffic class is always in debit (i.e.…”

Section: Route Execution Phasementioning

confidence: 99%

See 2 more Smart Citations

The impact of different scheduling policies on traffic class dependent routing in intersatellite link networks

Kandus

Švigelj

Mohorčič

2004

Satell Commun Network

View full text Add to dashboard Cite

SUMMARYThe provision of multimedia applications characterized by the integrated presentation of various data sources requires a network infrastructure providing broadband access, large available bandwidth in the core network, and traffic differentiation which supports efficient utilization of network resources and service level guarantees. In order to distinguish between different traffic classes and to optimize utilization of network resources to their respective requirements, an efficient routing procedure capable of differentiating traffic and adapting to highly dynamic conditions in a non-geostationary ISL network needs to be implemented in combination with advanced fair scheduling policies in the outgoing queues. In this paper we analyze the performance of different scheduling policies in conjunction with adaptive routing procedures in the intersatellite link network of a packet-switched non-geostationary satellite system. In particular, different unfair (first come first served and priority) and fair (weighted round robin, deficit round robin and surplus round robin) scheduling policies are considered, in combination with singleservice routing and traffic class dependent routing procedures. The performance of different scenarios is assessed, by means of simulation, in terms of average packet delay and average data throughput. The simulation results indicate that differentiated treatment of traffic using traffic class dependent routing and fair scheduling policies provides a significant improvement in overall performance for all traffic classes, regardless of the traffic scenario considered.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

Section: Route Execution Phasementioning

confidence: 99%

Section: Route Execution Phasementioning

confidence: 99%

See 1 more Smart Citation

The impact of different scheduling policies on traffic class dependent routing in intersatellite link networks

Kandus

Švigelj

Mohorčič

2004

Satell Commun Network

View full text Add to dashboard Cite

show abstract

“…Packets received from the routing module are placed in a first-in-first-out (FIFO) queue appropriate to the traffic class. Results reported in here were obtained using three FIFO queues, one for each traffic class, with a weighted round robin (WRR) scheduling policy [18]. The minimum allocated link bandwidths for the particular traffic classes in WRR scheduling policy have significant influence on the TCD routing performance, so more demanding traffic classes require larger allocation.…”

Section: Isl Network Simulatormentioning

confidence: 99%

Traffic class dependent routing in ISL networks

Mohorčič

Švigelj

Kandus

2004

IEEE Trans. Aerosp. Electron. Syst.

View full text Add to dashboard Cite

This work addresses traffic class dependent (TCD) routing, using different link-cost functions, in the intersatellite link (ISL) network of a nongeostationary packet-switched satellite communication system. Three different traffic classes are introduced, each with its particular optimisation criteria. Performance analysis of TCD routing, in terms of average packet delay and average data throughput of a particular traffic class, is evaluated for homogeneous and nonhomogeneous traffic scenarios using a specifically developed simulation model of the ISL network.Manuscript

show abstract

“…However, future WDM designs for the optical Internet aim at evolving to all-optical networks (AONs) called an opticalpacket-switching (OPS) network. In OPS [3][4][5], the traffic in an IP packet granularity can be supported, and each header is passed through an O/E conversion for processing and an E/O conversion for transmission with the data payload waiting in the optical buffer. However, the status quo of lacking practical optical buffer technology hinders the realization of OPS technology.…”

Section: Introductionmentioning

confidence: 99%

On the design of node architectures and MAC protocols for optical burst-switched ring networks

2010

View full text Add to dashboard Cite

Efficient multiple-token-based MAC protocols have been proposed for optical burst-switched (OBS) unidirectional ring networks using a TT-TR-based node architecture in our previous research. However, the unidirectional OBS ring network is difficult to scale to larger networks. As wavelengths accessibilities are dominated by tokens, network performance is restricted by the frequency of capturing a token. If the network is too large, it takes a long time for tokens to rotate. Thus, a destination queue may wait for a long time to be served, which results in large queuing delays and inefficiency of network resource utilization. In order to improve network efficiency and scalability for OBS ring networks using multiple tokens, this work is extended to a bidirectional ring system that uses the tunable transmitter and tunable receiver (TT-TR)-based node architecture with two pairs of transceivers, so that each queue can be served by tokens from both directions. Furthermore, two kinds of node architectures differing in sharing the two pairs of transceivers, either shared or not, are proposed. Then, two MAC protocols considering different queue scheduling algorithms are proposed for the ring network using the proposed node architectures, in order to use the network resources more efficiently. They are improved from general round-robin (GRR) and termed as half-ring round-robin (HfRR) and co-work round-robin (CoRR), respectively. The network performance of the two proposed node architectures and the two proposed MAC protocols for the networks using them as well as the network scalability are evaluated with the OPNET simulator.

show abstract

Enhanced weighted round robin schedulers for accurate bandwidth distribution in packet networks

Cited by 11 publications

References 14 publications

The impact of different scheduling policies on traffic class dependent routing in intersatellite link networks

The impact of different scheduling policies on traffic class dependent routing in intersatellite link networks

Traffic class dependent routing in ISL networks

On the design of node architectures and MAC protocols for optical burst-switched ring networks

Contact Info

Product

Resources

About