We present iterative round-robin matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is altered in the suggested algorithm to enhance the switch performance. Simulation results under Bernoulli traffic show the suggested algorithm is more appropriate than iSLIP for cell scheduling of input and output buffered switches.

This letter proposes a new scheduling method to improve scheduling efficiency of EPON. The proposed method uses a credit pool for each optical network unit (ONU) and for each service class. For high scheduling efficiency, the credit pool of an ONU can be negative amount to utilize the unused ONU credits. Also the proposed method dynamically excludes the lowest service class from scheduling to decrease a transmission cycle length. Using simulations, we show that the proposed method is better than the existing methods in mean delay.

A fast class-of-service oriented packet scheduling (FCOPS) has a service fairness problem since a credit pool for a service class is initialized at the beginning of a transmission cycle whose starting moment is fixed at a specific ONU. To remedy the service unfairness of FCOPS, we suggest an enhanced class-of-service oriented packet scheduling (ECOPS) that uses a new initialization cycle whose starting moment is fairly distributed to each ONU. Also, ECOPS generates a colorless grant to utilize the resource wastage, when traffic is light and the total sum of grants of an ONU is less than a minimum size. Using simulation, we validate ECOPS as superior to FCOPS in the mean delay and the service fairness.

We propose a new output arbitration method for an input buffered switch with a buffered crossbar. In the proposed method, each output selects the first nonempty buffer from the starting point. The starting points of output are determined to minimize the synchronization phenomenon that more than one input module sends cells destined for a same output. Using an approximate analysis of the synchronization phenomenon, we show the uniqueness of the starting points improves the switch performance. Finally, using computer simulations, we verify the proposed method outperforms the previous methods under the uniform and burst traffic.

We propose a new input arbitration method for an input buffered switch with a buffered crossbar. In the proposed method, each input module selects the first eligible queue from the starting point. The starting points of input modules are different from each other in any case. We show that the uniqueness of the starting points improves the switch performance. Finally, using computer simulations, we confirm the proposed method is better than the conventional method under the uniform and on-off traffic.

We present pipelined simple matching, called PSM, for an input buffered switch to relax the scheduling timing constraint by modifying pipelined maximal-sized matching (PMM). Like the pipelined manner of PMM, to produce the matching results in every time slot, PSM employs multiple subschedulers which take more than one time slot to complete matching. Using only head-of-line information of input buffers, PSM successively sends each request to all subschedulers to provide a better matching opportunity. To obtain better performance, PSM uses unique starting points of scheduling pointers in which the difference between the starting points is equal for any two adjacent subschedulers for a same output. Using computer simulations under a uniform traffic, we show PSM is more appropriate than PMM for pipelined scheduling of an input buffered switch.

We suggest a dual thresholds method for the dynamic bandwidth allocation in EPON. In the suggested method, a buffer in ONU has two thresholds and ONU generates a normal request and a greedy request based on the two thresholds. Also, OLT estimates the overall traffic load and grants the greedy request when estimated traffic is light. We study upstream channel resource wastage and show the suggested method decreases the upstream channel resource wastage. Using simulation, we validate the dual thresholds method is superior to the existing methods in the mean delay.

We present a simple cell scheduling algorithm for an input buffered switch. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is simplified in the suggested algorithm. By virtue of the new update scheme, the performance of the suggested algorithm is better than that of iSLIP with one iteration. Using computer simulations under a uniform traffic, we show the suggested algorithm is more appropriate than iSLIP for scheduling of an input buffered switch with multiple service classes.

We suggest a new minimum credit method for the dynamic bandwidth allocation in EPON. In the suggested method, to eliminate the unused transmission time-slot, each ONU requests no more than a predetermined maximum. We analyze the upstream channel resource wastage when traffic is light. Based on the analysis, we derive a minimum credit that eliminate the upstream channel resource wastage. The OLT estimates a traffic load and grants a minimum credit when the request is smaller than the minimum credit and traffic is light. Using simulation, we show the minimum credit discipline is superior than the existing methods in the mean delay and the frame loss rate.