Abstract: Provided are an apparatus and method for efficiently and dynamically allocating a bandwidth on a Time Division Multiple Access-based Passive Optical Network (TDMA PON).

Abstract: A dynamic bandwidth allocation (DBA) device and a method thereof are provided. In the DBA method, the band allocation periods according to class queues and allocable bands with respect to each class queue are calculated on the basis of the service level agreement information and stored according to the service types in separate tables. The bandwidth allocation amount is calculated with respect to class queues which have the allocation periods by concurrently checking all the tables at each frame. The upward bandwidth usage efficiency is improved by calculating the final bandwidth allocation information from the service with a high priority order on the basis of the total allocable bandwidth of the corresponding frame. The upward bandwidth allocation amount can be calculated at each frame by reducing the processing speed in calculating the bandwidth allocation amount of each class queue. Accordingly, it is possible to effectively use the network.

Abstract: Provided are an apparatus and method for efficiently and dynamically allocating a bandwidth on a Time Division Multiple Access-based Passive Optical Network (TDMA PON).

Abstract: The present device relates to a sealing device for an oven door. A groove or channel (2g) is formed on the door case (2) of the oven (1), and a sealing gasket (P) is attached to an interior surface of the groove or channel (2g). An extrusion (3t) is formed on the frame (3f) of the door (3), aligned for insertion into the groove (2g). Therefore, if the door (3) is closed, the extrusion, (3t) formed on the frame (3f) of the door (3) is inserted into the groove or channel (2g) coming in firm elastic contact with the gasket (P) and sealing the oven firmly. Sealing contact is maintained between the oven door (3) and door case (2), while protecting the gasket (P) from damage.

Abstract: An oven body includes a grilling chamber provided with several far infrared ray heaters and a smoking chamber that emits smoke from the charcoal heated by electric heaters, wherein the meat to be roasted is rotated in the grilling chamber by a rotating means, rotating alternately through a far infrared ray heating area where far infrared ray concentrates and through a smoking area where smoke concentrates, in which process the roasting operation by the far infrared ray and the smoking operation with particular scent of a charcoal are carried out simultaneously.

Abstract: A dynamic bandwidth allocation (DBA) device and a method thereof are provided. In the DBA method, the band allocation periods according to class queues and allocable bands with respect to each class queue are calculated on the basis of the service level agreement information and stored according to the service types in separate tables. The bandwidth allocation amount is calculated with respect to class queues which have the allocation periods by concurrently checking all the tables at each frame. The upward bandwidth usage efficiency is improved by calculating the final bandwidth allocation information from the service with a high priority order on the basis of the total allocable bandwidth of the corresponding frame. The upward bandwidth allocation amount can be calculated at each frame by reducing the processing speed in calculating the bandwidth allocation amount of each class queue. Accordingly, it is possible to effectively use the network.

Abstract: A method for adaptively partitioning a buffer in a shared buffer switch is provided. The buffer partitioning method for a shared buffer switch which has a plurality of input ports, a plurality of output ports, and a shared buffer, the method for determining whether or not to store a cell, which is newly received through one of the input ports, in the shared buffer comprises the steps of (a) determining a buffer area of the shared buffer in which the newly received cell is stored; (b) determining a cell discard threshold with respect to the total number of cells stored in the shared buffer and the changing rate, with respect to time, of the total number of the cells; and (c) determining whether or not to store the newly received cell in the shared buffer, by comparing the number of cells stored in the buffer area in which the newly received cell is to be stored, with the cell discard threshold.

Abstract: A method for scheduling an input and output buffered ATM or packet switch and, more particularly, to a method for cell-scheduling an input and output buffered switch that is adapted to a high-speed large switch is provided. The input and output buffered switch has multiple switching planes, and its structure is used to compensated for decreasing performance of the input buffered switch resulting from HOL (head-of-line) blocking of the input buffered switch. The input and output buffered switch consists of input buffer modules grouping several input ports and output ports and output buffer modules, and each input buffer module has several FIFO queues for the associated module output buffer modules. In the input and output buffered switch having multiple switching planes, cell scheduling is carried out using a simple iterative matching (SIM) method.

Abstract: An input buffered switch having a competing chance for transferring a cell at every time slot. The input buffered switches using pipelined simple matching, includes: a plurality of input unit for sending a request in every time slot in case that each Virtual Output Queue (VOQ) has at least one cell and outputting the cell according to a grant signal to each VOQ; a scheduling unit for executing a contention process according to requests from each VOQ of a plurality of input unit, sending contention results to a plurality of input unit and sending switch operating information to a switching unit; and the switching unit for switching and outputting the cell received from a plurality of input unit according to the switch operating information from the scheduling unit.

Abstract: An apparatus of WRR (Weighted Round-Robin) cell scheduling for ATM comprises: a virtual connection queues for storing the cells of virtual connection having a weight given by a natural number N; scheduling weight queues having a weight given by a power of 2 for servicing the virtual connection by as much as its weight N; a scheduling weight queue controller for selecting the scheduling weight queues for the virtual connection queue and register the virtual connection queue in the selected scheduling weight queues; and a queue selector for selecting the scheduling weight queues.

Abstract: A two-dimensional round-robin scheduling method with multiple selection is provided. The two-dimensional round-robin scheduling method in accordance with an embodiment of the present invention includes following steps. First step is for checking whether a request is received from the input buffer module and building mxm request matrix r(i,j), i,j=1, . . . , m. Second step is for setting mxm search pattern matrix, d(i,j), i,j=1, . . . , m. The search pattern matrix describes search sequence, S=1, . . . , m. Third step is for initializing elements of mxm allocation matrix a(i,j), i,j=1, . . . , m. The allocation matrix contains information whether transmission request is accepted and which switching plane the accepted request uses in transmission. Fourth step is for examining a request matrix in accordance with the search sequence S and finding r(i,j) that sent a request.

Abstract: A method for adaptively partitioning a buffer in a shared buffer switch is provided. The buffer partitioning method for a shared buffer switch which has a plurality of input ports, a plurality of output ports, and a shared buffer, the method for determining whether or not to store a cell, which is newly received through one of the input ports, in the shared buffer comprises the steps of (a) determining a buffer area of the shared buffer in which the newly received cell is stored; (b) determining a cell discard threshold with respect to the total number of cells stored in the shared buffer and the changing rate, with respect to time, of the total number of the cells; and (c) determining whether or not to store the newly received cell in the shared buffer, by comparing the number of cells stored in the buffer area in which the newly received cell is to be stored, with the cell discard threshold.

Abstract: Disclosed herein is an apparatus and method for scheduling packets using a credit based round robin in a high-speed communication network in which packets are transmitted to and received from a plurality of connections having respective speeds of service. The scheduling apparatus includes a packet pool for storing input packets; a token queue for storing tokens each having a connection identifier (ID) of an input packet stored in said packet pool, the round number (RN) of the connection, and a credit value (CV) for service; and a connection management unit for transmitting the input packets to said packet pool, reading the packets stored in said packet pool, generating the tokens each having a connection identifier (ID) of an input packet stored in said packet pool, the round number (RN) of the connection, and a credit value (CV) for service and transmitting them to said token queue, and servicing the packets of said packet pool designated by the token stored in said token queue.

Abstract: A method for scheduling an input and output buffered ATM or packet switch and, more particularly, to a method for cell-scheduling an input and output buffered switch that is adapted to a high-speed large switch is provided. The input and output buffered switch has multiple switching planes, and its structure is used to compensated for decreasing performance of the input buffered switch resulting from HOL (head-of-line) blocking of the input buffered switch. The input and output buffered switch consists of input buffer modules grouping several input ports and output ports and output buffer modules, and each input buffer module has several FIFO queues for the associated module output buffer modules. In the input and output buffered switch having multiple switching planes, cell scheduling is carried out using a simple iterative matching (SIM) method.