• Title/Summary/Keyword: 지연셀

Search Result 372, Processing Time 0.024 seconds

Cell Priority Control with 2-Level Thresholds in ATM Switch Network (ATM 스위치 네트워크에서의 2-레벨 임계치를 갖는 셀우선순위 제어방식)

  • 박원기;한치문;최형진
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.3
    • /
    • pp.479-491
    • /
    • 1994
  • In this paper, we proposed cell priority control with 2-level thresholds, which was considered cell loss and cell delay requirement, in ATM switch with output buffer. Priority control mechanism presented in this paper improved cell loss rate for cell loss censitive cell and cell delay for delay censitive cell. In this mechanism cell loss rate and mean cell delay of cell priority control mechanism were obtained theoretically. The results show that cell loss rate and mean cell delay improvement become better by adjusting two thresholds according to QOS characteristics.

  • PDF

Performance Evaluation of Multiplexing Algorithms with Both Delay and Loss Priorities in ATM Networks (ATM 통신망에서의 지연 및 손실 우선순위를 갖는 다중화 알고리즘의 성능 평가)

  • 전용희
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.5
    • /
    • pp.842-856
    • /
    • 1994
  • The various services that a broadband integrated services digital network (B-ISDN) carries, have a wide range of delay, delay jitter and cell loss probability requirements. Design of appropriate control schemes for B-ISDN is an extremely important and challenging problem. In this paper, we proposed multiplexing algorithm with both delay and loss priorities in order to satisfy the diverse requirements. For the implementation of cell lose priority, we assumed that voice cells are generated as non-discardable(i.e., high priority) and discardable (i.e., low priotity)cells. The low priority voice cell may be discarded inside the network if congestion occurs. The cell dropping scheme is shown to reduce cell losses as well as delays for both voice and data. Such a load shedding scheme is expected to improve significantly utilization of B-ISDN.

  • PDF

Analysis of Cell Stream Scheme and Service Transmission using Time-Stamp Method in the Wireless ATM (무선 ATM에서 타임스탬프 방식을 이용한 셀 스트림 구조와 서비스전송 해석)

  • Kim, Jeong-Ho
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2179-2187
    • /
    • 1999
  • To privide multimedia mobile communication services for the users in scattered locations, the application ATM cells efficiently in wireless communications, it is effective to the use TDMA method. However, it is necessary to have methods to compensate the CDV(cell delay variation) caused by the difference between TDMA-ATM and cell stream multiplexing of the users. This paper optimizes the cell control time(Tc) when VBR traffic inputs have MMPP by applying CDV characteristics of time stamp method, which has the most advantages among compensation methods of CDV. This paper suggests a cell stream multiplex method employing time stamp techniques to reduce CDV for wireless suggest method shows that CDV distribution and cell stream multiples rangd can be controlled to 1.2${\times}$Tc which reduced over the VBR service in the TDMA-WATM transmission. This paper also presents evaluation of the suggested architecture obtained simulation.

  • PDF

A scheme to minimize transmission delay during handoff for rt-VBR service in the wireless ATM Networks (무선 ATM에서 핸드오프 동안 실시간 VBR 서비스를 위한 전송 지연의 최소화 방안)

  • Kim, Jun-Bae;Jang, Dong-Hyeok;Lee, Seon-Suk;Lee, Jae-Hong;Kim, Seung-Hwan;Gwon, O-Seok;Park, Jin-Su
    • The KIPS Transactions:PartC
    • /
    • v.9C no.2
    • /
    • pp.277-282
    • /
    • 2002
  • In general, requirements for QoS are different according to the type of services in wire-line and wireless ATM networks, and real-time video service is more sensitive to cell transmission delay than to cell loss. Existing handoff schemes emphasizing prevention of cell loss had limitations in cell transmission delay to satisfy QoS. In this paper, a novel scheme to transmit ATM cells with low CLP(when CLP = 0) prior to others and discarding cells with high CLP(when CLF = 1) in ATM cell header among cells to be forwarded to new base station during handoffs in real-time VBR service is proposed. The proposed scheme is proven to be suitable for the satisfaction of QoS of real-time VBR service and appropriate for fast handoffs by giving high CLP value to less meaningful MPEG frames through simulations.

A CMOS Cell Driver Model to Capture the Effects of Coupling Capacitances (결합 커패시턴스의 영향을 고려한 CMOS 셀 구동 모델)

  • Cho, Kyeong-Soon
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.11
    • /
    • pp.41-48
    • /
    • 2005
  • The crosstalk effects that can be observed in the very dee submicron semiconductor chips are due to the coupling capacitances between interconnect lines. The accuracy of the full-chip timing analysis is determined by the accuracy of the estimated propagation delays of cells and interconnects within the chip. This paper presents a CMOS cell driver model and delay calculation algerian capturing the crosstalk effects due to the coupling capacitances. The proposed model and algorithm were implemented in a delay calculation program and used to estimate the propagation delays of the benchmark circuits extracted from a chip layout. We observed that the average discrepancy from HSPICE simulation results is within $1\%$ for the circuits with a victim affected by $0\~10$ aggressors.

Improved UPC Algorithm Adopting a Dynamic Spacer for Traffic Control in ATM Networks (ATM망에서 트래픽 제어용 동적 지연기를 적용한 개선된 UPC 알고리즘)

  • Kim Wu Woan
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.2
    • /
    • pp.192-200
    • /
    • 2005
  • In this paper, an improved User Parameter Control (UPC) algorithm is proposed for controlling traffic in ATM networks. The present algorithm consists of Cell Buffer, Red Token Pool, Green Token Pool, and Spacer. A token is generated at a certain time period, and the tokens are consumed one each time a cell arrives. At this time, if the delay element, named Spacer, is empty, the cell comes into the network. On the other hand, if Spacer is not empty, the cell cannot come into the network. In addition, in the case that tokens do not exist in Token Pool, the corresponding cell is thrown away The arbitrary function of the token used in this paper is removed. Instead, the token is used only to control network traffic. This research proposes new UPC Algorithm to improve the current cell delay rate and cell loss rate by dynamically adopting the delay element, named Spacer, with respect to the traffic condition, which is different from controlling that the cell comes into the network after a certain delay time period.

  • PDF

Analysis of Cell Variation of ATM Transmission for the Poisson and MMPP Input Model in the TDMA Method (TDMA 방식에서 포아송 입력과 MMPP 입력 모델에 따른 ATM 전송의 셀 지연 변이 해석)

  • Kim, Jeong-Ho;Choe, Gyeong-Su
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.3
    • /
    • pp.512-522
    • /
    • 1996
  • To provide broadband ISDN service for the users in scattered locations, the application of satellite communications network is seriously considered. To trans mit ATM cells efficiently in satellite communications, it is effective to use TDM A method. However, it is necessary to have a method to compensate the cell delayvari-ation caused by the difference between TDMA and ATM. This paper optimized the cell control time(Tc) when traffic inputs have poisson or markov modulated poisson process by applying cell delay variation characteristics of time stamp method, which has the most advantages among compensation methods or cell delay variation. This paper also intorduces a method of reducing the cell clumping phenomena by adapting discrete time stamp method, including the analysis and evalutation of the range of required quality of CDV distribution by ATM transmission.The result of the experiment shows that CDV distribution-range can be controlled to 1.2$\times$Tc which reduces overall cell delay variation by discrrete time stamp method.

  • PDF

Performance Analysis of Time Division Multiplexed Optical Output Buffers (시간 분할 다중합 광 출력 버퍼의 성능 분석)

  • 정준영;고광철;정제명
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9B
    • /
    • pp.751-759
    • /
    • 2003
  • We analyze the performances, such as the cell loss probability(CLR) and the cell delay time, of time division multiplexed(TDM) optical output buffers using traveling delay lines or delay-line loops for buffering. Since traveling delay lines used for buffering are superior over delay-line loops in terms of simplicity and signal quality, they were used in a conventional TDM optical output buffer. However, the latter is more flexible than the former in that the cell storage time is adjustable by changing the recirculating times of a cell in the loops. So we propose a novel TDM optical output buffer using delay-line loops for buffering. We show that the proposed TDM optical output buffer can reduce the number of buffering unit required to achieve a CLR of less than 10$^{-9}$ . When the number of buffering unit is sufficiently large, we show that both TDM optical output buffers have same cell delay time characteristic.

A shaping algorithm considering cell delay and buffer size (지연 및 버퍼 크기를 고려한 셀 간격 조정 알고리즘)

  • Kwak, Dong-Yong;Han, Yong-Min;Kwon, Yool;Park, Hong-Shik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.21 no.11
    • /
    • pp.2828-2835
    • /
    • 1996
  • In this paper we propose a new shaping algorithm which can control the shaping delay and the output buffer size based on the leaky bucket counter with a threshold value. This paper assumes that input traffic of the proposed shaping algorithm is the worst case traffic tolerated by the continuous leaky bucket algorithm and claracterizes traffic patterns that can depart from our shaping algorithm. We also compare shaping delay and output buffer size of the proposed algorithm with the existing shaping algorithm without a threshold value. Our results show that the proposed shaping algorithm can easily manage the shaping delay and output buffer size than any other mechanism.

  • PDF

Improved Binary Scheduling Wheel Structure for WRR Implementation (WRR 구현을 위한 개선된 이진 스케쥴링 바퀴 구조)

  • Mun, Hong-Jin;Jo, Hae-Seong
    • The KIPS Transactions:PartC
    • /
    • v.8C no.2
    • /
    • pp.134-140
    • /
    • 2001
  • 스케쥴링 알고리즘들은 제안된 패킷 지연을 가진 각 연결에 대하여보장된 대역을 제공한다. 스케쥴링 알고리즘의 일종인 WRR은 매우 간편하며 각 큐에 다른 가중치를 할당하여 여러 큐를 직접 제어한다. BSW 알고리즘은 WRR 스케쥴러를 구현하는데 버퍼 관리를 효율적으로 수행하도록 제안되었다. 그러나 BSW 알고리즘은 VC에 실제 할당된 가중치 보다 더 많은 가중치를 할당하고 서비스 받을 VC의 큐가 비어있을 때 서비스를 수행하지 않기 때문에 셀 지연 및 최대 큐 길이에서 심각한 성능 저하를 유발한다. 본 논문에서는 WRR 스케쥴링 알고리즘을 효율적으로 수행할 수 있는 새로운 BSW 구조를 제안한다. 또한, 새로운 BSW 구조에 적합한 셀 스케쥴링 알고리즘을 개발한다. 제안된 BSW 구조와 알고리즘은 VC에 할당된 가중치를 정확히 유지 할 수 있고, 서비스 받을 VC큐가 비어 있을 경우 다른 VC 셀을 서비스하여 평균 셀 지연 및 최대 버퍼 크기를 감소시킨다. 그리고 셀 서비스율을 전체적으로 증가시킨다.

  • PDF