• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1387-1394
• /
• 2005

In this paper, we propose and the call admission control mechanism that can improve the capacity of the wireless system for the non-uniform traffic load distribution based intelligent information in multiple cellular CDMA environment. The number of mobile stations that can be served simultaneously in a base station is limited by the amount of total interference received in CDMA system. Further, the average number of mobile stations in each cell may not be uniformly distributed. In this paper, considering this factors, the call admission control mechanism using the effective bandwidth concept is adapted to improve the system capacity of non-uniform traffic load distribution based intelligent information. Thus, the bandwidth for a new call can be varied dynamically for reducing the blocking rate of new calls and the dropping rate of handoff calls. The suggested call admission control mechanism is experimented through simulation by dynamically assigning the bandwidth to new and handoff calls. The simulation results show that the proposed call admission control mechanism can accommodate more mobile stations than the other methods in multiple cellular CDMA environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.9A
• /
• pp.1395-1404
• /
• 2000

In this paper, we propose a heuristic wavelength routing algorithm for IP datagrams in WDM (Wavelength-Division Multiplexing) networks which operates in a distributed manner, while most previous works have focused centralized algorithms. We first present an efficient construction method for a loose virtual topology with a connectivity property, which reserves a few wavelength to cope with dynamic traffic demands properly. This connectivity property assures that data from any source node could reach any destination node by hopping one or multiple lightpaths. We then develop a high-speed distributed wavelength routing algorithm adaptive to dynamic traffic demands by using such a loose virtual topology and derive the general bounds on average utilization in the distributed wavelength routing algorithms. Finally, we show that the performance of the proposed algorithms is better than that of the FSP(Fixed Shortest-Path) wavelength routing algorithms through simulation using the NSFNET[1] and a dynamic hot-spot traffic model, and that the algorithms is a good candidate in distributed WDM networks in terms of the blocking performance, the control traffic overhead, and the computation complexity.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.667-676
• /
• 1995

In ATM traffic multiplexing, the cell clumping and the cell dispersion are occured due to the cell delay variance(CDV) which changes the traffic characteristics. These cell variances increase the burstiness of t.he cell streams and make the network congested. The function of the traffic shaping is necessary to transmit the input streams into the networks or into the traffic policing schemes with some intevals. Most of the existing studies regard the input traffics as the traffic with the identical characteristics. In this study, the traffic shaping is processed by considering the traffic characteristICS with t.he loss-sensitive traffic and the delay-sensitive traffic. The traffic shaping model and the traffic shaping algorithm which considers the" characteristics of input streams have been presented. The traffic effect On t.he CDV size is also studied. The proposed scheme is compared to Virtual Scheduling Algorithm(VSA) and the efficiency of the proposed scheme is evaluated. According to the simulation results, t.he mean delay is decreased about 12% in delay-sensitive traffic and the traffic burstiness is decreased about 11 % in loss-sensitive traffic.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10c
• /
• pp.553-555
• /
• 2003

Mobile Ad hoc network에서 이동 노드들의 안정적이고 신뢰성이 높은 데이터 전송을 하기 위해서 multipath routing을 통하여 소스 목적지 노드간에 다중 경로를 구하고 기존의 라우팅 방법과 비교해 본다. 또한 다중 경로를 활용하는 방법과 경로구간의 링크 다운 시에 보다 빠른 복원을 할 수 있는 방법을 제시하고자 한다. 모바일 노드들의 이동성과 낮은 대역폭으로 인한 데이터 손실을 줄이는 방법으로 데이터 트래픽을 다중경로에 분산시키는 Traffic Load Balancing 방법과 데이터 전송 중에 발생하는 링크 다운 시에 새로운 경로를 찾는 메커니즘이 아닌 중간 경로에서 기존에 유효한 경로를 이용하는 Local recovery 방법을 소개하고자 한다.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1992.06a
• /
• pp.321-325
• /
• 1992

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1996.10a
• /
• pp.389-394
• /
• 1996

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1993.10a
• /
• pp.253-257
• /
• 1993

• Proceedings of the Korea Information Processing Society Conference
• /
• 2021.11a
• /
• pp.95-98
• /
• 2021

최근 비정상적인 네트워크 활동 감지 및 네트워크 서비스 프로비저닝과 같은 다양한 분야에서 응용되는 네트워크 트래픽 예측 기술이 네트워크 통신 문제에 의한 트래픽의 결측 및 네트워크 유저의 불규칙한 활동에 의한 비선형 특성 때문에 발생하는 성능 저하를 극복하기 위해 딥러닝 신경망에 대한 연구가 활성화되고 있다. 이 딥러닝 신경망 중 시계열 딥러닝 신경망은 단기 네트워크 트래픽 볼륨을 예측할 때 낮은 오류율을 보인다. 하지만, 시계열 딥러닝 신경망은 기울기 소멸 및 폭발과 같은 비선형성, 다중 계절성 및 장기적 의존성 문제와 같은 한계를 보여준다. 이 논문에서는 계절성 임베딩을 고려한 주의 신경망 기반 트래픽 예측 기법을 제안한다. 제안하는 기법은 STL 분해 기법을 통해 분해된 트래픽 트랜드, 계절성, 잔차를 이용하여 일별 및 주별 계절성을 임베딩하고 이를 주의 신경망을 기반으로 향후 트래픽을 예측한다.

• Journal of the Institute of Convergence Signal Processing
• /
• v.5 no.1
• /
• pp.73-78
• /
• 2004

There are random, continuous, and periodic allocation methods in the time slot sequence integrity for the multi-slot call. In the T-S-T switch, there are 2 time switch and the 2*2 space switch. Three time-slot allocation methods are suggested for the simulation. In the simulation, the searching times for time-slots on a multi-slot call is chosen to 32, and the simulation time is chosen to 100,000 seconds. Three kinds of calls are supposed for a multi-slot call : one time-slot call, two time-slot call, and 6 time-slot call. In the simulation, the carried traffic and the blocking probability are calculated on the 3 different traffic cases of 8:1:1, 6:2:2, 4:3:3(one time-slot : two time-slot : 6 time-slot) multi slot calls. It is shown that the blocking probability for the periodic time slot allocation method is best. As a result, the periodic time-slot allocation method is the proper one for the multi-slot ATM switch.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8A
• /
• pp.569-580
• /
• 2003

One of the important advantages of multichannel switches is the incorporation of inherent fault tolerance into the switching fabric. For example, if a link which belongs to the multichannel group fails, the remaining links can assume responsibility for some of the traffic on the failed link. On the other hand, if faults occur in the switching elements, it can lead to erroneous routing and sequencing in the multichannel switch. We investigate several fault localization algorithms in multichannel crossbar ATM switches with a view to early fault recovery, The optimal algorithm gives the best performance in terms of time to localization but is computationally complex which makes it difficult to implement. We develop an on-line algorithm which is computationally mote efficient than the optimal algorithm. We evaluate its performance through simulation. The simulation results show that performance of the on line algorithm is only slightly sub-optimal for both random and bursty traffic. Finally a fault recovery algorithm is described which utilizes the information provided by the fault localization algorithm.