Guaranteed smooth switch scheduling with low complexity

Mohanty, S.R.; Bhuyan, Laxmi N.

doi:10.1109/glocom.2005.1577699

Cited by 16 publications

(16 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…After decomposition, one weighted round robin (WRR) scheme was adopted to schedule these decomposed matrices [20]. Another related work was conducted by Mohanty and Bhuya [21]. They proposed the Binary Matrix Decomposition (BMD) algorithm and applied SRR [12] to schedule these decomposed matrices.…”

Section: Introductionmentioning

confidence: 99%

Dichotomy Slot Allocation: A QoS Guaranteed Scheduling Algorithm for Input-Queued Switches

Zhang¹,

Ansari²,

Jin

et al. 2010

IEEE Systems Journal

View full text Add to dashboard Cite

Abstract-With the rapid increase of real-time applications, jitter, delay, and throughput have become the three important QoS criteria in the scheduling of input-queued (IQ) switches with virtual output queues (VOQ). In this paper, we propose a novel frame-based scheduling algorithm, referred to as dichotomy slot allocation (DSA), to achieve high throughput, bounded delay, and bounded jitter. DSA possesses three major characteristics. First, DSA schedules the switch on a per-VOQ basis, and strives to provision QoS guarantees for each traffic stream corresponding to each VOQ. Second, DSA allocates the exact amount of slots to schedule the actual traffic of each VOQ, and decides the time slot for each packet. Third, DSA equally allocates the slots in a frame to each port pair, and then adjusts the scheduling to meet the actual traffic demand. The adjustment process employs a specially designed order named Dichotomy Order to guarantee QoS. Both analysis and simulation results demonstrate that DSA achieves good performance in jitter and throughput.

show abstract

Section: Introductionmentioning

confidence: 99%

Dichotomy Slot Allocation: A QoS Guaranteed Scheduling Algorithm for Input-Queued Switches

Zhang¹,

Ansari²,

Jin

et al. 2010

IEEE Systems Journal

View full text Add to dashboard Cite

show abstract

“…The algorithm attempts to decompose an admissible integer traffic rate matrix into the sum of integer matrices, where the maximum row or column sums of the matrices represent a decreasing geometric sequence. The authors establish a jitter bound which grows as the switch size N increases, and identify an open problem "to determine the minimum speedup required to provide hard guarantees, and whether such guarantees are possible at all" [21].…”

Section: Prior Guaranteed-rate Scheduling Algorithmsmentioning

confidence: 99%

“…Hard analytic bounds on the jitter were not available. A heuristic scheduling algorithm for scheduling packets in an IQ switch was developed at the UCR [21]. The algorithm attempts to decompose an admissible integer traffic rate matrix into the sum of integer matrices, where the maximum row or column sums of the matrices represent a decreasing geometric sequence.…”

Section: Prior Guaranteed-rate Scheduling Algorithmsmentioning

confidence: 99%

“…The set of cells to transmit per time slot can be represented as a permutation. Scheduling for IQ switches is known to be a difficult problem [13][14][15][16][17][18][19][20][21][22][23][24][25][26][27]. The difficulty is compounded when Quality-of-Service (QoS) constraints are added to the scheduling problem.…”

Section: Luxembourg the Netherlands Finland Andorra Sweden And Smentioning

confidence: 99%

“…Consider two classic underlying theories from the field of graph theory and combinatorial mathematics, summarized in [10,[16][17][18][19][20][21]. Theorem 1 states that any integer matrix with a maximum row or column sum of F can be expressed as the sum of F permutation matrices.…”

Section: The Recursive Fair Stochastic Matrix Decomposition Algorithmmentioning

confidence: 99%

See 2 more Smart Citations

Design of an IPTV Multicast System for Internet Backbone Networks

Szymański

Gilbert

2010

International Journal of Digital Multimedia Broadcasting

View full text Add to dashboard Cite

The design of an IPTV multicast system for the Internet backbone network is presented and explored through extensive simulations. In the proposed system, a resource reservation algorithm such as RSVP, IntServ, or DiffServ is used to reserve resources (i.e., bandwidth and buffer space) in each router in an IP multicast tree. Each router uses an Input-Queued, Output-Queued, or Crosspoint-Queued switch architecture with unity speedup. A recently proposed Recursive Fair Stochastic Matrix Decomposition algorithm used to compute near-perfect transmission schedules for each IP router. The IPTV traffic is shaped at the sources using Application-Specific Token Bucker Traffic Shapers, to limit the burstiness of incoming network traffic. The IPTV traffic is shaped at the destinations using Application-Specific Playback Queues, to remove residual network jitter and reconstruct the original bursty IPTV video streams at each destination. All IPTV traffic flows are regenerated at the destinations with essentially zero delay jitter and essentially-perfect QoS. The destination nodes deliver the IPTV streams to the ultimate end users using the same IPTV multicast system over a regional Metropolitan Area Network. It is shown that all IPTV traffic is delivered with essentiallyperfect end-to-end QoS, with deterministic bounds on the maximum delay and jitter on each video frame. Detailed simulations of an IPTV distribution system, multicasting several hundred high-definition IPTV video streams over several essentially saturated IP backbone networks are presented.

show abstract

A Conflict-Free Low-Jitter Guaranteed-Rate MAC Protocol for Base-Station Communications in Wireless Mesh Networks

Szymański

2009

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Guaranteed smooth switch scheduling with low complexity

Cited by 16 publications

References 8 publications

Dichotomy Slot Allocation: A QoS Guaranteed Scheduling Algorithm for Input-Queued Switches

Dichotomy Slot Allocation: A QoS Guaranteed Scheduling Algorithm for Input-Queued Switches

Design of an IPTV Multicast System for Internet Backbone Networks

A Conflict-Free Low-Jitter Guaranteed-Rate MAC Protocol for Base-Station Communications in Wireless Mesh Networks

Contact Info

Product

Resources

About