C.S. Chang, W.J. Chen, and H.Y. Huang, "On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann," in Proc. of IEEE IWQoS, London, UK, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....are defined. For two of the algorithms we are able to perform a derandomization so as to obtain deterministic schedules. We show through numerical computation that in many situations the resulting delay bounds are smaller than the previously best known delay bounds of Chang, Chen, and Huang [1]. Index terms: Input queued switches. Decomposition based schedules. Delay bounds. 1 Introduction In recent years there has been a great deal of work on scheduling algorithms for input queued switches. The key feature of an input queued switch is that at each time step, each input can be ....

....For the case in which we do know the arrival rates we can decompose the rate matrix into a convex combination of permutation matrices. If the scheduler configures the switch according to this decomposition then we have stability. We refer to these schedulers as decomposition based schedulers (e.g. [1, 2, 3]) Specific algorithms for performing the decomposition can be derived from results of Birkhoff [4] and von Neumann [5] Note that the schedule can be computed in advance of the arriving traffic and hence it is acceptable for the calculation to have significant complexity. For the case of ....

[Article contains additional citation context not shown here]

C.S. Chang, W.J. Chen, and H.Y. Huang, "On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann," in Proc. of IEEE IWQoS, London, UK, 1999.

.... of the 100 and also to avoid starvation of cells ( 14] However, such algorithms have several drawbacks, that can be so classified: Complexity: an optimal scheduling can be found solving a matching problem on bipartite graphs ( 15] or finding a decomposition of stochastic matrices (see [16] for the switching case) The weak point of these approaches is their complexity; the best known matching algorithm runs in O(N 2 log2 (N) time in the worst case ( 17] while the second method has been proved useful to implement, at most, 4 x 4 switches ( 18] Throughput: with approximate ....

C.S. Chang, W.J. Chen, and H.Y. Huang. On service guarantees for input buffered crossbar switches: a capacity decomposition approach by birkoff and yon neumann. In IEEE IWQoS'99, pages 79-86, 1999.

....as many services as the GRT would guarantee. Finally, the switch fabric transfers the inputqueued cells according to the matchings of the schedule table. In order to compute the schedule table, most of the algorithms in the literature are based on the Birkhoff Von Neumann (BV) decomposition [8] [9], 10] 11] As explained in section 2, this BV algorithm minimizes the bandwidth requirement for the schedule and provides bandwidth guarantees. It can be noted that this frame based scheduling approach applies to several systems other than input queued routers. First, it is used in SONET ....

....ATM, DiffServ, MPLS, and most (virtual) circuit and frame based schemes, which are predominant in the Internet core with which any Internet core router needs to interact. Third, it is one of the only inputqueued policies that provably guarantee 100 throughput for both a router in isolation [9], 10] 11] and a network of routers [16] and therefore guarantees to the operators that the lines they expensively laid will be fully utilized. Fourth, the method for computing the frame weights is often flexible. Therefore, this flexibility can be used to provide specific bandwidth guarantees ....

[Article contains additional citation context not shown here]

C.S. Chang, J.W. Chen, and H.Y. Huang, "On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and Von Neumann," IEEE IWQoS, London, 1999.

....are defined. For two of the algorithms we are able to perform a derandomization so as to obtain deterministic schedules. We show through numerical computation that in many situations the resulting delay bounds are smaller than the previously best known delay bounds of Chang, Chen, and Huang [1]. Index terms: Input queued switches. Decomposition based schedules. Delay bounds. 1 Introduction In recent years there has been a great deal of work on scheduling algorithms for input queued switches. The key feature of an input queued switch is that at each time step, each input can be ....

....For the case in which we do know the arrival rates we can decompose the rate matrix into a convex combination of permutation matrices. If the scheduler configures the switch according to this decomposition then we have stability. We refer to these schedulers as decomposition based schedulers (e.g. [1, 2, 3]) Specific algorithms for performing the decomposition can be derived from results of Birkhoff [4] and von Neumann [5] Note that the schedule can be computed in advance of the arriving traffic and hence it is acceptable for the calculation to have significant complexity. For the case of ....

[Article contains additional citation context not shown here]

C.S. Chang, W.J. Chen, and H.Y. Huang, "On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann," in Proc. of IEEE IWQoS, London, UK, 1999.

....are defined. For two of the algorithms we are able to perform a derandomization so as to obtain deterministic schedules. We show through numerical computation that in many situations the resulting delay bounds are smaller than the previously best known delay bounds of Chang, Chen, and Huang [1]. Keywords Input queued switches. Decomposition based schedules. Delay bounds. I. INTRODUCTION N recent years there has been a great deal of work on scheduling algorithms for input queued switches. The key feature of an input queued switch is that at each time step, each input can be connected ....

....For the case in which we do know the arrival rates we can decompose the rate matrix into a convex combination of permutation matrices. If the scheduler configures the switch according to this decomposition then we have stability. We refer to these schedulers as decomposition based schedulers (e.g. [1], 2] 3] Specific algorithms for performing the decomposition can be derived from results of Birkhoff [4] and von Neumann [5] Note that the schedule can be computed in advance of the arriving traffic and hence it is acceptable for the calculation to have significant complexity. Author ....

[Article contains additional citation context not shown here]

C.S. Chang, W.J. Chen, and H.Y. Huang, "On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann," in Proc. of IEEE IWQoS, London, UK, 1999.

....are defined. For two of the algorithms we are able to perform a derandomization so as to obtain deterministic schedules. We show through numerical computation that in many situations the resulting delay bounds are smaller than the previously best known delay bounds of Chang, Chen, and Huang [1]. Keywords Input queued switches. Decomposition based schedules. Delay bounds. I. INTRODUCTION N recent years there has been a great deal of work on scheduling algorithms for input queued switches. The key feature of an input queued switch is that at each time step, each input can be connected ....

....For the case in which we do know the arrival rates we can decompose the rate matrix into a convex combination of permutation matrices. If the scheduler configures the switch according to this decomposition then we have stability. We refer to these schedulers as decomposition based schedulers (e.g. [1], 2] 3] Specific algorithms for performing the decomposition can be derived from results of Birkhoff [4] and von Neumann [5] Note that the schedule can be computed in advance of the arriving traffic and hence it is acceptable for the calculation to have significant complexity. For the case ....

[Article contains additional citation context not shown here]

C.S. Chang, W.J. Chen, and H.Y. Huang, "On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann," in Proc. of IEEE IWQoS, London, UK, 1999.

....are defined. For two of the algorithms we are able to perform a derandomization so as to obtain deterministic schedules. We show through numerical computation that in many situations the resulting delay bounds are smaller than the previously best known delay bounds of Chang, Chen, and Huang [1]. Keywords Input queued switches. Decomposition based schedules. Delay bounds. I. INTRODUCTION N recent years there has been a great deal of work on scheduling algorithms for input queued switches. The key feature of an input queued switch is that at each time step, each input can be ....

....For the case in which we do know the arrival rates we can decompose the rate matrix into a convex combination of permutation matrices. If the scheduler configures the switch according to this decomposition then we have stability. We refer to these schedulers as decomposition based schedulers (e.g. [1], 2] 3] Specific algorithms for performing the decomposition can be derived from results of Birkhoff [4] and von Neumann [5] Note that the schedule can be computed in advance of the arriving traffic and hence it is acceptable for the calculation to have significant complexity. For the case ....

[Article contains additional citation context not shown here]

C.S. Chang, W.J. Chen, and H.Y. Huang, "On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann," in Proc. of IEEE IWQoS, London, UK, 1999.

....called VOQs, which eliminates HoL blocking. There exist a number of techniques which allow IQ switches with VOQs to obtain 100 throughput. It is desirable to achieve 100 throughput since it allows a network operator to efficiently utilize the expensive link bandwidth. For example, Chang et al. [3] and Altman et al. 4] showed (using the results of Birkhoff [5] and von Neumann [6] that the crossbar can be scheduled by a fixed sequence of matchings (called frames) such that the IQ switch can achieve 100 throughput for any admissible arrival pattern. These are similar to time division ....

C.-S. Chang, W.-J. Chen, and H.-Y. Huang, "On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann," In IEEE Infocom, Tel Aviv, Israel, 2000.

....in software 3 (d) Classification in hardware 1 [30, 9, 11, 10, 8] e) Classification in hardware 2 3. Scheduling (a) Switch fabric architectures [35] b) Algorithms for scheduling [7] c) iSLIP 1 [24, 25, 22, 23] d) iSLIP 2 (e) Switching with guaranteed rates 1 [2, 3, 4, 13] (f) Switching with guaranteed rates 3 (g) Emulating output queuing 1 [6, 31] h) Emulating output queuing 2 (i) The fork join router 1 [14, 15] j) The fork join router 2 (k) Combined input output queued switches 1 [34] l) Combined input output queued switches 2 (m) ....

....algorithms 2. Implementing IP forwarding decisions using binary search on hashes 3. Design and simulation of guaranteed rate switching fabric 4. Design and synthesis of a multicast scheduler 5. Simulating a network of routers using NS Bibliography: We will draw upon the following [24, 25, 8, 22, 10, 16, 19, 1, 9, 11, 20, 36, 33, 23, 29, 5, 32, 12, 21, 6, 14, 15, 30, 18, 28, 27, 2, 3, 4, 13, 26, 17] ....

C.-S. Chang, W.-J. Chen, and H.-Y. Huang. On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann. In IEEE Infocom, 2000.

No context found.

C.S. Chang, J.W. Chen and H.Y. Huang, "On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and Von Neumann," IEEE IWQoS, London, 1999.

No context found.

C.-S. Chang, W.-J. Chen and H.-Y. Huang, "On service guarantees for input buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann," IEEE IWQoS'99, pp. 79-86, London, U.K., 1999.

....frame based schemes and might have the granularity problem for bandwidth guarantees. Fig. 1. The architecture of the Birkhoff von Neumann switch To cope with the granularity problem due to framing, the Birkhoff von Neumann input buffered switch is proposed in [5] and [6] for guaranteed rate service between each inputoutput pair (see Figure 1) As in most input buffered switch, the Birkhoff von Neumann switch uses the VOQ technique to solve the HOL blocking problem. The main idea of scheduling the connection patterns in the Birkhoff von Neumann switch is ....

....switch uses the VOQ technique to solve the HOL blocking problem. The main idea of scheduling the connection patterns in the Birkhoff von Neumann switch is to use the capacity decomposition approach by Birkhoff [3] and von Neumann [30] for the details of the decomposition algorithm, we refer to [5] and [6] The computational complexity of the decomposition is O(N ) for an N N switch. The on line scheduling algorithm used there is a simpli ed version of the Packetized Generalized Processor (PGPS) algorithm in Parekh and Gallager [26] or the Weighted Fair Queueing (WFQ) in Demers, ....

[Article contains additional citation context not shown here]

C.S. Chang, W.J. Chen and H.Y. Huang, On service guarantees for input buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann, IEEE IWQoS'99, pp. 79-86, London, U.K., 1999.

....frame based schemes and might have the granularity problem for bandwidth guarantees. Fig. 1. The architecture of the Birkhoff von Neumann switch To cope with the granularity problem due to framing, the Birkhoff von Neumann input buffered switch is proposed in [5] and [6] for guaranteed rate service between each inputoutput pair (see Figure 1) As in most input buffered switch, the Birkhoff von Neumann switch uses the VOQ technique to solve the HOL blocking problem. The main idea of scheduling the connection patterns in the Birkhoff von Neumann switch is ....

....switch uses the VOQ technique to solve the HOL blocking problem. The main idea of scheduling the connection patterns in the Birkhoff von Neumann switch is to use the capacity decomposition approach by Birkhoff [3] and von Neumann [30] for the details of the decomposition algorithm, we refer to [5] and [6] The computational complexity of the decomposition is O(N ) for an NN switch. The on line scheduling algorithm used there is a simplified version of the Packetized Generalized Processor (PGPS) algorithm in Parekh and Gallager [26] or the Weighted Fair Queueing (WFQ) in Demers, ....

[Article contains additional citation context not shown here]

C.S. Chang, W.J. Chen and H.Y. Huang, "On service guarantees for input buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann," IEEE IWQoS'99, pp. 79-86, London, U.K., 1999.

....Neumann Input Buffered Crossbar Switches Cheng Shang Chang Wen Jyh Chen Hsiang Yi Huang Dept. of Electrical Engineering National Tsing Hua University Hsinchu 30043 Taiwan, R.O.C. Email: cschang ee.nthu.edu.tw fwjchen, huhuangg hardy.ee. nthu.edu.tw Abstract In our previous paper [5], we proposed a scheduling algorithm that is capable of providing rate guarantees for input buffered crossbar switches. The algorithm is based on a decomposition result by Birkhoff and von Neumann for a doubly substochastic matrix. An input buffered crossbar switch that uses such an algorithm is ....

....allocated to an input output pair) As a result, the WRR algorithm fails to provide uniform rate guarantees for all non uniform traffic due to its framing requirement. Based on a decomposition result by Birkhoff and von Neumann for a doubly substochastic matrix, we proposed in our previous paper [5] a scheduling algorithm that is capable of providing rate guarantees for input buffered crossbar switches. For this approach, the rate guarantees are uniformly good for all non uniform traffic, and it does not require framing or internal speedup. An input buffered crossbar switch that uses the ....

[Article contains additional citation context not shown here]

C.S. Chang, W.J. Chen and H.Y. Huang, "On service guarantees for input buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann," IEEE IWQoS'99, pp. 79-86, London, U.K., 1999.

No context found.

C.S. Chang, W.J. Chen, and H.Y. Huang, "On service guarantees for input buffered crossbar switches: A capacity decomposition approach by Birkhoff and von Neumann," in Proc. of IEEE IWQoS, London, UK, 1999.

No context found.

C.-S. Chang, W.-J. Chen, H.-Y. Huang, "On service guarantees for input buffered crossbar switches: a capacity decomposition approach by Birkhoff and von Neumann," IWQoS'99,, pp. 79-86, 1999.

No context found.

Cheng-Shang Chang and et al. On Service Guarantees for Input Buffered Crossbar Switches: A Capacity Decomposition Approach by Birkhoff and von Neumann. In Proceedings of IWQoS'99, London, England, pages 79-- 86, May 1999.

No context found.

Chen W. J. Chang C. S. and Huang H. Y., "`On Service Guarantees for Input Buffered Crossbar Switches: A Capacity Decomposition Approach by Birkhoff and von Neumann," in IEEE IWQoS, 1999.

No context found.

C.-S. Chang, W.-J. Chen, and H.-Y. Huang, "On Service Guarantees for Input Buffered Crossbar Switches," in IWQoS'99, 1999, pp. 79--86.

No context found.

C.-S. Chang, W.-J. Chen, and H.-Y. Hunag. On service guarantees for input buffered crossbar switches: A capacity decomposition approach by birkhoff and von neumann. In Proc of IWQOS 99, March 1999.

No context found.

C.S. Chang, J.W. Chen, and H.Y. Huang, "On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and Von Neumann," IEEE IWQoS, London, 1999.

No context found.

C.S. Chang, J.W. Chen, and H.Y. Huang, "On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and Von Neumann," IEEE IWQoS, London, 1999.

No context found.

C.-S. Chang, W.-J. Chen, and H.-Y. Huang, "On Service Guarantees for Input Buffered Crossbar Switches," in IWQoS'99, 1999, pp. 79--86.

No context found.

C.-S. Chang, W.-J. Chen, and H.-Y. Huang, "On Service Guarantees for Input Buffered Crossbar Switches," in IWQoS'99, 1999, pp. 79--86.

No context found.

C.-S. Chang, W.-J. Chen, and H.-Y. Hunag. On service guarantees for input buffered crossbar switches: A capacity decomposition approach by birkhoff and von neumann. In Proc of IWQOS 99, March 1999.

No context found.

C.S. Chang, J.W. Chen, and H.Y. Huang, "On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and Von Neumann," IEEE IWQoS, London, 1999.

No context found.

C.S. Chang, J.W. Chen, and H.Y. Huang, "On service guarantees for input-buffered crossbar switches: a capacity decomposition approach by Birkhoff and Von Neumann," IEEE IWQoS, London, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC