• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.405-408
• /
• 2006

Design of appropriate control schemes that can satisfy the cell loss, delay requirements with various traffic specification for B-ISDN is an extremely important challenging problem. In this paper, we proposes a priority control scheme with a window counter and a cell counter per each type of class. The priority control for satisfying required service quality is performed with delay/loss factor obtained by comparing window counter with cell counter. The performance of proposed control scheme is estimated by computer simulation.

• ETRI Journal
• /
• v.24 no.5
• /
• pp.360-372
• /
• 2002

In this paper, we propose the modified dynamic weighted round robin (MDWRR) cell scheduling algorithm, which guarantees the delay property of real-time traffic and also efficiently transmits non-real-time traffic. The proposed scheduling algorithm is a variation of the dynamic weighted round robin (DWRR) algorithm and guarantees the delay property of real-time traffic by adding a cell transmission procedure based on delay priority. It also uses a threshold to prevent the cell loss of non-real-time traffic that is due to the cell transmission procedure based on delay priority. Though the MDWRR scheduling algorithm may be more complex than the conventional DWRR scheme, considering delay priority minimizes cell delay and decreases the required size of the temporary buffer. The results of our performance study show that the proposed scheduling algorithm has better performance than the conventional DWRR scheme because of the delay guarantee of real-time traffic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.381-389
• /
• 1994

In the communication network, multimedia service such as high quality voice, high speed data, image etc. will be added to the existing service. This service generates new requirements for the communication networks. The priority control mechanism can be used to control multimedia traffics generated by many communication systems. The priority mechanism which assigns prioirities to generated cells according to service quality is one of the traffic control. The priority assignment can be divided by priority criterion for each traffic characteristics such as loss sensitivity and delay sensitivity. In this paper, we alnalyzed the partial buffur sharing (PBS) mechani느 as a traffic control reducing the cell loss, and proposed analysis method. We analyzed the PBS mechanism using classical approach as a Markov chain. In order to validata proposed analysis method, simulation is performed using simulation package SIMSCRIPT 11.5. From this results, we confirmed that proposed analysis method can be verified. Also, we presented cell loss probability of ATM network when this results are to be applied to ATM networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.842-854
• /
• 1997

In this paper, the improved Dual Leaky-Bucket(DLB) algorithm is proposed to reduce the synchronous cell loss rate. The conventional DLB algorithm does not support synchronous cells, but the proposed algorithm gives higher priority to synchronous cells. To reduce synchronous cell loss rate, the synchronous cell detector is used in the proposed algorithm. Synchronous cell detector detects synchronous cells, and passes them cells to the 2nd Leaky-Bucket. So it is similar to give higher priority to synchronous cells. In this paper, the proposed algorithm used audio/videl traffic modeled by On/Off and Two-state MMPP, and simulated by SLAM II package. As simulation results, the proposed algorithm gets lower synchronous cell loss rate than the conventional DLB algorithms. The improved DLB algorithm for multimedia synchronization can be extended to any other cells which require higher priority.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.9
• /
• pp.10-17
• /
• 1994

In this paper, a priority schedling and a flow control algorithm with hysteresis effect are proposed for high-speed networks. A mathematical model for the flow control is proposed and a cell transition probability from this model is found. And the performance of the proposed algorithm is analyzed by a computer simulation. According to the simulation results, it can be shown that the priority scheduling and the flow control with hysteresis effect get the cell loss probability 0.061 better and the average delay 100ms better and the average delay 100ms beter than those of single threshold.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.2
• /
• pp.305-314
• /
• 1996

In the paper, we divide the ATM cells generated by multimedia systems that want to transmit multimedia informations over B-ISDN into two categories:i)a media cell with a media information and ii) a synchronization cell with a synchronization information. We induce a media cell loss equation and a synchroni- zation cell loss equation based on probability distribution functions with on-off source as an input traffic model. In order to meet the requirements of real-time and integrity of multimedia informations, multimedia synchronization cells should provide the delay-sensitive and the loss-sensitive requirements. A traffic control mechanism needs to satisfy above requirements. According to the performance evaluation by a traffic control model simulation, we describe both spatial priority for minimizing the synchronization cell loss and temporal priority for reducing the synchronization cell delay must be applied simultaneously.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1770-1780
• /
• 1997

Our problem is improvement of image quality because it is inevitable cell loss of image data when traffic congestion occurs. If cells are discarded indiscriminately in transmission of MPEG video data, it occurs severe degradation in quality of service(QOS). In this paper, to solve this problem, we propose two method. The first, we analyze the traffic characteristics of an MPEG encoder and generate high priority and low priority data stream. During network congestion, only the least low priority cells are dropped, and this ensures that the high priority cells are successfully transmitted, which, in turn, guarantees satisfactory QoS. In this case, the prioritization scheme for the encoder assigns components of the data stream to each priority level based on the value of a parameter ${\beta}$. The second, Number of high priority cells are increased when value of ${\beta}$ is large. It occurs the loss of high priority cell in the congestion. To prevent it, this paper is regulated to data stream rate as buffer occupancy with UPC controller. Therefore, encoder's bandwidth can be calculated renegotiation of the encoder and networks. In this paper, the encoder's bandwidth requirements are characterized by a usage parameter control (UPC) set consisting of peak rate, burstness, and sustained rate. An adaptive encoder rate control algorithm at the Networks Interface Card(NIC) computes the necessary UPC parameter to maintain the user specified quality of service. Simulation results are given for a rate-controlled VBR video encoder operating through an ATM network interface which supports dynamic UPC. These results show that dynamic bandwidth renegotiation of prioritized data stream could provided bandwidth saving and significant quality gains which guarantee high priority data stream.

• ETRI Journal
• /
• v.20 no.3
• /
• pp.251-271
• /
• 1998

It is well known that if usage parameter control/network parameter control (UPC/NPC) functions are used together with a cell loss priority control scheme in ATM networks, the measurement phasing problem can occur. This makes it difficult for a network provider to define and commit the cell loss ratio as a QoS parameter. To solve the problem, we propose a new UPC/NPC algorithm. By using the proposed UPC/NPC algorithm, we can define the cell loss ratios for CLP = 0 and CLP = 0+1 cell streams without the measurement phasing problem under any conditions. We analyzed the performance of the proposed UPC/NPC algorithm. Using a discrete time model for the UPC/NPC architecture with a discrete-time semi-Markov process (DSMP) input model, we obtained the cell discarding probabilities of CLP = 0 and CLP = 0+1 cells streams and showed that more CLP = 0 cells are accepted compared to what was proposed in ITU-T.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.6
• /
• pp.9-17
• /
• 1994

ATM (Asynchronous Transfer Mode) has a fixed-length packet transport scheme. It is one of the promising proposals in B-ISDN.Since the packet length is fixed, it can be potentially to perform the various service to users. In this paper, a queueing model for an ATM multip`exer loaded by CBR and ON/OFF input sources is considered, and the two-queue system which each type of input sources has a queue with a finite capacity is analyzed. The cell loss probabilities for a performance measures of ATM multiplexer are derived, and are also evaluated through numerical examples. As a result, the cell loss probability of ON/OFF sources for the queue size is rapidly decreased when the multiplexed number and burstiness are increased. Since cells of the CBR source have lower priority than cells of the ON/OFF source, cell loss probabilities of CBR sources are accordingly high independently of CBR cell arrival rate when the number of CBR sources is large.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.4
• /
• pp.490-501
• /
• 1994

In this study the problems of cell marking method used in the field of ATM network traffic control are presented. Also an extended cell marking method considering the user level priority is proposed. The conventional traffic monitoring schemes set the CLP bit of a cell to 1 only under the circumstance of the violation of traffic contract. It causes that the number of low level cells increases and the levels of cells are lowered regardless of the user level priority. The three level priority control method combining FCI bit with CLP bit has also been proposed. It divides CLP=0 cells into two levels. Consequently, the proposed method preserves more cells in high level than the conventional one and the real loss of high level cells can be reduced. The performance of the proposed scheme has also been analyzed by the PBS(partial buffer sharing) with two thresholds for the proposed three levels. The result shows that the PBS with two thresholds can give more efficient control than the scheme with no priority, or the PBS with one threshold.