• 디지털콘텐츠학회 논문지
• /
• 제5권1호
• /
• pp.7-11
• /
• 2004

차세대 고속 통신망을 구축하기 위해서는 해결해야 할 많은 문제들이 있는데, 이 중에서 기본적으로 고려해야 할 사항은 바로 망에 흐르는 트래픽의 특성 분석이다. 현재 제공되는 많은 인터넷 서비스들의 동작 특성은 자기 유사성(Self-similar)이라는 기존에 고려되던 트래픽 특성과는 완전히 다른 장기간 의존성의 성질들을 가진다는 것이 증명되었다 이러한 장기간 의존성 성질을 표현하기 위한 모델로는 자기유사 모델이 있는데, 이것은 단기간 의존성을 표현하는 기존의 모델인 포아송 모델과는 상반되는 개념이다. 따라서 차세대 통신망의 설계 및 디멘져닝을 위해서는 무엇보다도 데이터 트래픽의 주요 특성인 버스트성(Burstiness)과 자기유사성이 반영된 트래픽 모델이 요구된다. 여기서 자기유사성은 허스트 파라미터(Hurst Parameter)로 특성화 될 수 있다. 본 논문에서는 데이터 트래픽의 자기유사성 및 큐잉지연을 고려한 유효대역폭 산출식을 유도하여 시뮬레이션 결과와 비교 분석하였다.

• 전자공학회논문지A
• /
• 제32A권8호
• /
• pp.31-38
• /
• 1995

In this paper, we consider the leaky bucket parameter dimensioning problem in the presence of the cell delay variation(CDV) which arises at the customer premises network dud to the multiplexing with other traffic streams. We consider an ATM multiplexer in which a single CBR stream and several heterogeneous VBR traffic streams are multiplexed. Choosing an MMPP model for the bursty traffic streams, we derive an (MMPP+DD)/D/1/K queueing model for the evaluation of the CDV experienced by the CBR stream. We first evaluate the equilibrium queue length distribution embedded at tagged-cell arrival-time instants, based on whcih we calcuate the inter-cell time distribution and the distribution kof the number of tagged-cell departures in an arbitrary interval. Then we apply the analysis to the dimensionging problem of the leaky bucket parameters, examining how the employed traffic model affects the determination of the bucket size. Through numerical examples, we confirm that the Poisson traffic model can underestimate the bucket size, thus causing a considerable blocking probability for compliant use cells while the MMPP model can optimally design the bucket size which keeps the blocking probability under the target value.

• 한국통신학회논문지
• /
• 제28권9B호
• /
• pp.751-759
• /
• 2003

진행형 지연선로 또는 지연선 루프를 저장 유닛으로 사용하는 시간 분할 다중합(TDM) 광 출력 버퍼의 셀 손실 확률, 셀 지연 시간 등의 성능을 분석하여 보았다. 저장 유닛으로 사용되는 진행형 지연선로는 지연선 루프보다 그 구조가 단순하고, 저장 신호의 질적인 면에서 더 우수하여, 기존 TDM 광 출력 버퍼에 사용되었다. 반면에, 지연선 루프는 루프 내에서의 셀 회전 수 조절을 통해 저장 시간을 조절할 수 있다는 점에서 진행형 지연선로보다 그 유연성이 우수하다. 따라서 지연선 루프를 저장 유닛으로 사용하는 새로운 TDM 광 출력 버퍼를 제안하였다. 제안한 TDM 광 출력 버퍼는 $10^{-9}$ 이하의 셀 손실 확률을 얻기 위해 필요한 저장 유닛의 수를 줄일 수 있음을 보였다. 그리고 저장 유닛의 수가 충분히 클 때, 두 가지 TDM 광 출력 버퍼는 동일한 셀 지연 시간 특성을 보였다.

• 한국통신학회논문지
• /
• 제19권5호
• /
• pp.842-856
• /
• 1994

광대역 종합정보 통신망 (B-ISDN)이 수용할 여러 서비스들은 다양한 지연, 지연 변화 및 셀 손실 확률 요구 사항을 가지고 있다. B-ISDN을 위한 적절한 제어 방법의 설계는 매우 중요하고 어려운 문제이다. 본 논문에서는, 그러한 다양한 요구사항을 만족하기 위하여, 지연 및 손실 우선 순위 모두를 가진 다종화 알고리즘을 제안한다. 손실 우선 순위의 구현을 위하여, 음성 셀은 폐기 불가한 셀(즉, 높은 우선 순위의 셀) 및 폐기 가능한 셀(즉, 낮은 우선 순위의 셀)로 생성됨을 가정하였다. 낮은 순위의 음성셀은 통신망내에서 혼잡이 발생하면 폐기될 수 있다. 본 셀 탈락 방법은 음성 및 데이터의 지연뿐만 아니라 셀 손실도 감소 시키는 것을 보여주고 있다. 이러한 부하 감소 방법은 광대역 종합정보 통신망의 이용율을 크게 개선 시킬 수 있을 것으로 기대된다.

• 한국시뮬레이션학회논문지
• /
• 제8권4호
• /
• pp.1-8
• /
• 1999

This paper proposes an ATM switch architecture called Output Queued Batcher-Banyan switch (OQBBS). It consists of a Sorting Module, Expanding Module, and Output Queueing Modules. The principles of channel grouping and output queueing are used to increase the maximum throughput of an ATM switch. One distinctive feature of the OQBBS is that multiple cells can be simultaneously delivered to their desired output. The switch architecture is shown to be modular and easily expandable. The performance of the OQBBS in terms of throughput, cell delays, and cell loss rate under uniform random traffic condition is evaluated by computer simulation. The throughput and the average cell delay are close to the ideal performance behavior of a fully connected output queued crossbar switch. It is also shown that the OQBBS meets the cell loss probability requirement of $10^{-6}$.

• 전자공학회논문지S
• /
• 제35S권5호
• /
• pp.17-26
• /
• 1998

B-ISDN has many advantages to provide multimedia, image transfer, etc. Recently, ABR service has been proposed in order to satisfy user's various requirements in it. In this paper, we propose a new ABR flow control algorithm called CAPRO. This algorithm uses the buffer proportional to propagation delay and controls the traffic on a link-by-link basis in order to minimize the effect of propagation delay. In order to use buffer more efficienctly, we define the request cell and the control cell. Then, we analyze our algorithm using mathematical model, simulate it using SLAM system, and compare to the existing EPRCA. As a result, our algorithm has the benifit of the throughput, cell loss probability, and fairness.

• 한국통신학회논문지
• /
• 제23권9A호
• /
• pp.2249-2257
• /
• 1998

In this paper, we propose the enhanced priority control algorithm that adaptively controls the cell service ratio according to the relative cell occupancy ratio of buffer. The asynchronous transfer mode (ATM) provides the means to support various multimedia services in broadband networks. To support multimedia services, various data traffics of different priorities should be controlled effectively. And also it needs congestion control functions required in the netowrk to carry out the control operation. To accomplish this in a flexible and effective manner, priority classes for the different services ar ecommonly used. The proposed enhanced priority control mechanism have two service calsses of the delay sensitive class and the loss sensitive class. The simulation results show that te proposed control mechanism improves the QoS, the charateristics of cell loss probability and mean cell delay time, by selecting propeor relativ ecell occupancy ratio of buffer and the average arrival rate.

• 경영과학
• /
• 제23권3호
• /
• pp.13-25
• /
• 2006

To reduce the signaling tost of paging in mobile communication, sequential paging schemes are proposed by partitioning a location area into several paging areas such that each area is paged sequentially. Necessary conditions for the optimal partition of cells with delay bound are examined by considering the mobiles location probability at each cell. The Optimal Cell Partitioning (OCP) is proposed based on the necessary conditions and the fathoming rule which trims off the unnecessary solution space and expedite the search process. Two Heuristics, BSG and BNC are also presented to further increase the computational efficiency in real-world paging scheme for the next generation mobile systems. The effectiveness of the 1)reposed paging schemes is illustrated with computational results. The Heuristic BSG that performs the search in the most promising solution group outperforms the best existing procedure with the 6-69% gain in paging cost in problems with 100 cells.

• ETRI Journal
• /
• 제36권4호
• /
• pp.554-563
• /
• 2014

The burgeoning growth of real-time applications, such as interactive video and VoIP, places a heavy demand for a high data rate and guarantee of QoS from a network. This is being addressed by fourth generation networks such as Long-Term Evolution (LTE). But, the mobility of user equipment that needs to be handed over to a new evolved node base-station (eNB) while maintaining connectivity with high data rates poses a significant challenge that needs to be addressed. Handover (HO) normally takes place at cell borders, which normally suffers high interference. This inter-cell interference (ICI) can affect HO procedures, as well as reduce throughput. In this paper, soft frequency reuse (SFR) and multiple preparations (MP), so-called SFRAMP, are proposed to provide a seamless and fast handover with high throughput by keeping the ICI low. Simulation results using LTE-Sim show that the outage probability and delay are reduced by 24.4% and 11.9%, respectively, over the hard handover method - quite a significant result.

• 한국통신학회논문지
• /
• 제21권6호
• /
• pp.1480-1489
• /
• 1996

In ATM networks there are two methods in traffic control as schemes advancing the quality of service. One is reactive control after congestion and the other which is generally recommended, is preventive control before congestion, including connection admission control on call leel and usage parameter control, network parameter control, priority control and congestion control on cell level. In particular, usage parameter control is required for restricting the peak cell rate of bursy tracffic to the parameter negotiated at call set-up phase since the peak cell rate significantly influences the network quality of service. The scheme for progressing quality of service by usage parameter control is themethod using VSA(Virtual Scheduling Algorlithm) recommended ITU-T. The method using VSSA(Virtual Scheduling Suggested Algorlithm) in this paper is suggested by considering cell delay variation and token rate of leaky bucket, compared VSA and VSANT(Virtual Scheduling Algolithm with No Tolerance) with VSSA which polices violated cell probability of conformed peak cell rate and intentionally excessive peak cell rate. VSSA method using IPP(Interruped Poisson Process) model of input traffic source showed more quality of service than VSA and VSANT methods as usage parameter control because the suggested method reduced the violated cell probability of contformed peak cell rate and intentionally excessive peak cell rate.