• 전자공학회논문지A
• /
• 제33A권5호
• /
• pp.55-64
• /
• 1996

This paper presents performance evaluation of a new high speed inter-processor communication(HIPC) network for large capacity and high performance digitral switching system. The HIPC structure implements the fast reservation and concurrent arbitration technique (modified round-robin arbitration). The performance evaluation of HIPC was performed by not only computer simulation but also numerical approximation method which was derived for a single server multi-queue system with nonexhaustive cyclic service. The approximation results are almost same with that of computer simulation. The TDX-10 basic callscenario was applied to the HIPC netowrk and analyzed. these results were compared with TDX-10 IPC and shows that the difference of th emean waiting time in the TX buffer of NTP node increases sharply according to the increase of the message arrival rate.

• 한국IT서비스학회:학술대회논문집
• /
• 한국IT서비스학회 2006년도 춘계학술대회
• /
• pp.233-240
• /
• 2006

This paper measures and compares the traffic of a series of Massively Multiplayer On-line Role Playing Games(MMORPG). The target games are 'Lineage' and 'Lineage II' developed by NCsoft, which are ones of the world's largest MMORPGs in terms of the number of concurrent users. We collected about 1 tera bytes of packets of 'Lineage II' for four days including a weekend. These packets are analyzed and compared with those of 'Lineage.' Packet size, packet inter-arrival time, and bandwidth usage are compared. The traffic of the two games shows much difference because original 'Lineage' is a kind of 2-D based MMORPG, while 'Lineage II' is 3-D based. By comparing the characteristics of the traffic of these games, we can anticipate future needs of network and game structure.

• 반도체디스플레이기술학회지
• /
• 제20권2호
• /
• pp.67-72
• /
• 2021

MANET(Mobile Ad Hoc Network) is the structure in which a source node communicates with a destination node by establishing a route with neighbor nodes without using the existing wired or wireless network. Therefore, the routing protocol for MANET must correspond well to changes in the channel state of moving nodes, and should have simple operation, high reliability, and no routing loop. In this paper, the simulation was perform by using a traffic model with on/off two states provided by the NS-3 network simulator. Also, the duration of the ON state and the duration of the OFF state used the traffic where inter arrival time of data is irregular by generating random values with constant, exponential distribution, and Pareto distribution. The performance of the DSDV, OLSR, and AODV protocols was compare and analyzed using the generated traffic model.

• 한국전자통신학회논문지
• /
• 제10권2호
• /
• pp.289-296
• /
• 2015

대용량 멀티미디어 데이터를 센싱 및 전송하기 위한 무선 멀티미디어 센서 네트워크는 지연에 민감한 특징을 가진다. 본 논문은 멀티미디어 데이터를 전송하기위한 효율적인 네트워크 환경을 위해 트래픽에 따른 우선순위 라우팅 방법을 통한 지연을 최소화 시키는 메커니즘을 제안한다. 또한 노드에 도착하는 패킷들의 도착, 처리 되는 시간차와 버퍼 점유율을 고려하여 혼잡 제어 메커니즘을 제안한다. 시뮬레이션을 통해 성능 분석을 수행하여 제안한 라우팅 방법으로 인해 패킷 지연이 감소되는 것을 확인 하였고, 네트워크에 많은 양의 데이터가 유입되었을 때 혼잡을 감지하고 제어하여 안정적인 네트워크 상태를 유지하는 것을 검증하였다.

• 한국통신학회논문지
• /
• 제33권4A호
• /
• pp.352-360
• /
• 2008

최근 IEEE (Institute of Electrical and Electronics Engineers) 802.15.4a TG (Task Group)에서는 저소비, 저전력 뿐만 아니라 다수개의 피코넷이 공존하는 즉, SOPs (simultaneously operating piconets) 환경하에서 거리 인지가 가능하도록 규정하고 있으며 거리인지 (ranging)의 서비스에 따라 Ternary 코드를 이용한 coherent/non-coherent 방안이 표준으로 채택되었다. 그러나 표준안에서 제시된 최소의 펄스 간 간격(Pulse Repetition Interval; PRI)은 채널의 최대 초과 지연 aximum Excess Delay; MED) 보다 좁아 펄스 간 간섭 (Inter-Pulse Interference; IPI) 문제가 발생되어 DS(Direct Sequence) 기반의 추정기법으로는 부정확한 최초 도착 시간(Time Of Arrival; TOA)을 얻게 된다. 따라서 본 논문에서는 IPI을 줄이면서 고정밀 TOA를 추정하기 위한 비주기적 펄스 전송 (non-periodic transmission; NPT) 패턴 기법을 제안한다. 수신단은 저속 무선 개인 영역 네트워크의 모티브를 고려하여 에너지 검출을 이용한 non-coherent 기반의 수신 구조로 구성하였다. TOA 정보는 슬라이딩 상관처리 후 역 탐색 구간 (Search Back Window; SBW)을 두어 오차를 감소시키고 사전 정해진 임계치를 이용하여 얻기 된다. 제안된 펄스 패턴 기법에 대한 성능을 검증하기 위해서 BEE 802.15.4a TG에서 제시한 두 가지 채널 모델을 적용하였고 시뮬레이션 결과로부터 제안된 기법이 다수개의 피코넷이 공존하는 다중 경로 환경에서 일반적인 기법보다 성능이 개선됨을 확인하였다.

• 자원환경지질
• /
• 제16권1호
• /
• pp.51-61
• /
• 1983

By using local earthquake data, the Korean crust model and travel-time tables were determined. The upper crustal earthquakes (Hongsung event and Ssanggyesa event) were considered as auxiliary information, and the lower crustal earthquakes (Uljin event and Pohang event) played an important role in determining model parameters. The possible existence of Low Velocity Layer (LVL) in the upper mantle was suggested by discrepancy in the arrival times of Sariwon earthquake which occurred below Moho discontinuity. Computer program for the determination of the model parameters was developed in order to screened out the optimum parameters by comparing the travel times of observed data with theoretical ones. We found that the discontinuities of Conrad, Moho, and upper and lower boundaries of LVL have their depth of 15, 32, 55 and 75 Km, respectively. The velocities of P-and S-wave in the layers between those discontinities were found to be (1) 5.98, 3.40 Km/sec (2) 6.38, 3.79 Km/sec (3) 7.95, 4.58 Km/sec (4) unknown (5) 8.73, 5.05 Km/sec, respectively from the top layer. Travel-time tables were also computed for the inter-local earthquakes which have their direct wave paths above the LVL.

• 전자공학회논문지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.

• Journal of Communications and Networks
• /
• 제8권2호
• /
• pp.234-240
• /
• 2006

We study the dynamic burst assembly based on traffic prediction and offset and delay differentiation in optical burst switching network. To improve existing burst assembly mechanism and build an adaptive flexible optical burst switching network, an approach called quality of service (QoS) based adaptive dynamic assembly (QADA) is proposed in this paper. QADA method takes into account current arrival traffic in prediction time adequately and performs adaptive dynamic assembly in limited burst assembly time (BAT) range. By the simulation of burst length error, the QADA method is proved better than the existing method and can achieve the small enough predictive error for real scenarios. Then the different dynamic ranges of BAT for four traffic classes are introduced to make delay differentiation. According to the limitation of BAT range, the burst assembly is classified into one-dimension limit and two-dimension limit. We draw a comparison between one-dimension and two-dimension limit with different prediction time under QoS based offset time and find that the one-dimensional approach offers better network performance, while the two-dimensional approach provides strict inter-class differentiation. Furthermore, the final simulation results in our network condition show that QADA can execute adaptive flexible burst assembly with dynamic BAT and achieve a latency reduction, delay fairness, and offset time QoS guarantee for different traffic classes.

• 한국항행학회논문지
• /
• 제11권4호
• /
• pp.415-422
• /
• 2007

본 논문에서는 크로스 시간 슬롯이 존재하는 TD-SCDMA 시스템에 적용할 수 있는 새로운 동적 채널 할당 알고리즘을 제안하였다. 크로스 시간 슬롯에서 간섭을 줄이기 위해 셀 내의 사용자들은 기지국과 사용자 사이의 거리를 기준으로 Near 그룹과 Far 그룹으로 구분된다. 크로스 시간 슬롯에서 역방향 링크에서는 Near 그룹, 순방향 링크에서는 Far 그룹에 존재하는 사용자가 채널을 할당 받는다. 셀룰러 시스템에서 하나의 셀은 복수개의 셀로 둘러싸여 있어 크로스 시간 슬롯과 노멀 시간 슬롯이 혼재해서 존재하게 되므로, 어떠한 셀을 기준으로 할 것인지가 매우 중요하다. 본 논문은 하나의 셀을 6개의 구역으로 구분하고 각 사용자의 입사각을 파악하여 가장 큰 영향을 주는 하나의 인접 셀을 결정하였다. 본 논문에서 제안하는 동적 채날 할당 방식과 셀을 구분하는 방식은 크로스 시간 슬롯에서 간섭을 크게 줄 수 있는 상황을 피함으로써 시스템의 용량 측면에서 FCA에 비해 약 2%~9%, RCA에 비해 약 0.5%~1.3%의 성능향상이 있었다.

• 한국정보처리학회논문지
• /
• 제3권7호
• /
• pp.1669-1679
• /
• 1996

In this paper, we address the problem of how to replace huffers in multimedia database systems with time-varying skewed data access. The access pattern in the multimedia database system to support audio-on-demand and video-on-demand services is generally skewed with a few popular objects. In addition the access pattem of the skewed objects has a time-varying property. In such situations, our analysis indicates that conventional LRU(least Recently Used) and LFU(Least Frequently Used) schemes for buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural suited. We propose a new buffer replacement algorithm(ABRN:Adaptive Buffer Replacement using Neural Networks)using a neural network for multimedia database systems with time-varying skewed data access. The major role of our neural network classifies multimedia objects into two classes:a hot set frequently accessed with great popularity and a cold set randomly accessed with low populsrity. For the classification, the inter-arrival time values of sample objects are employed to train the neural network.Our algorithm partitions buffers into two regions to combine the best roperties of LRU and LFU.One region, which contains the 핫셋 objects, is managed by LFU replacement and the other region , which contains the cold set objects , is managed by LRUreplacement.We performed simulation experiments in an actual environment with time-varying skewed data accsee to compare our algorithm to LRU, LFU, and LRU-k which is a variation of LRU. Simulation resuults indicate that our proposed algorthm provides better performance as compared to the other algorithms. Good performance of the neural network-based replacement scheme means that this new approach can be also suited as an alternative to the existing page replacement and prefetching algorithms in virtual memory systems.