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

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.17-19
• /
• 2007

This paper describe an interactive video object segmentation tool which can be used to generate MPEG-4 video object planes for multimedia broadcasting and enables content based functionalities. In order to apply these functionalities, each frame of video sequence should be represented in terms of video objects. Semiautomatic segmentation can be thought of as a user-assisted segmentation technique. A user can initially mark objects of interest around the real object boundaries. Then the user-guided and selected objects are continuously separated from the unselected areas though time evolution in the image sequences. We proposed method shows very promising result and this encourages the development of object based video editing system.

• 한국국방경영분석학회지
• /
• 제9권2호
• /
• pp.23-30
• /
• 1983

A simulation study was conducted to determine optimum capacity of Navy drydock facility using GASP-IV, an advanced FORTRAN-based simulation language, under demands of regular overhauls and emergency repairs by ships of an hypothetical fleet composition. Three year dock usage data was analyzed to produce probability distributions underlying drydock repair demands. The present facility size of two drydocks was simulated and was found to be somewhat short of adequate service capability, showing excessive average waiting time and average queue length. The simulation model was then modified to include an additional drydock of similar size as the other two and a year's simulation was again conducted. All repair needs were quite satisfactorily met and all docks showed very high utilization factor (0.98). This contributed to an increase in the fleet's ship availability from 0.95 to 0.99. This study illustrates the usefulness of simulation technique as a tool for analyzing policy alternatives in military long-term investment areas.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.1045-1046
• /
• 2006

The IEEE 802.11e medium access control (MAC) is an emerging standard to support Quality of Service (QoS). A HCCA (HCF controlled channel access) scheduler of the standard IEEE 802.11e is only efficient for flows with strict constant bit rate (CBR) characteristics. In this paper, we propose a new HCCA scheduling scheme that aims to be efficient for both CBR and VBR flows. The proposed scheme uses fuzzy queue length predictions to tune its time allocation to stations. We present a set of simulations and provide performance comparisons with the reference HCCA scheduler.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 하계종합학술대회 논문집(1)
• /
• pp.81-84
• /
• 2002

The WRR scheduling algorithm is widely used in ATM networks due to its simplicity and the low cost of hardware implementation. It guarantees minimum cell rate according to the weight of each queue. The fairness is a important factor for ABR service. That is, Scheduling algorithm allocates network resources fairly to each VC. In this paper, we propose a scheduling algorithm for satisfying the two fairness criteria, MCR plus equal share and Maximum of MCR or Max-Min share, among the six criteria defined by ATM Forum TM 4.1 specification. The WRR, Nabeshima et al, and the proposed scheduling algorithms are compared with respect to fairness and convergence time throughout experimental simulation.

• 대한산업공학회지
• /
• 제40권1호
• /
• pp.135-139
• /
• 2014

In a connection-oriented packet switching network, the data communication starts after a virtual circuit is established between source and destination. The virtual circuit establishment time includes the queue waiting times in the direction from source to destination and the other way around. We use this two-way queueing delay to evaluate scheduling policies of a packet switching processor through simulation studies. In this letter, we also suggest user testing functions for the packet switching processor to manage virtual circuits. By detecting error causes, the user testing helps the packet switching processor provide reliable connection-oriented services.

• 대한전자공학회논문지TC
• /
• 제41권7호
• /
• pp.31-40
• /
• 2004

본 논문에서는 Gigabit Ethernet-PON의 상향 트래픽 제어를 위해 기존에 제안되었던 Interleaved polling with Adaptive Cycle Time (IPACT) 방식의 gated service 스케줄링의 성능을 수학적으로 분석하였다. 성능분석 방법은 EPON MAC 프로토콜을 polling system으로 모델링하고, mean value analysis를 사용하였다. Arrival rate λ의 값을 세 구간으로 나누고, 구간마다 의 수학적 분석과정을 제시하였다. 첫 번째 구간은 λ의 값이 매우 작아서 ONU들의 데이터 전송이 거의 없는 구간이고, 두 번째 구간은 λ의 값이 충분히 커서 ONU들의 연속적인 데이터 전송이 일어나는 구간이고, 세 번째 구간은 λ의 값이 매우 커서 ONU들의 버퍼가 항상 포화상태에 있는 구간이다. 분석결과 gated service의 평균 패킷 지연시간과 평균 큐 사이즈, 평균 싸이클 시간 등을 구하고, 수학적 성능분석의 정확성을 검증하기 위해 시뮬레이션을 수행하여 수학적 분석결과와 시뮬레이션 결과를 비교하였다. 이를 통해 수학적 분석결과와 시뮬레이션 결과가 상당히 일치함을 확인하였다. 기존에 IPACT의 성능 평가는 시뮬레이션에만 의존하였는데, 이 방법은 시간과 노력이 많이 필요한 반면, 수학적 성능분석은 성능지표를 단시간 내에 다양하게 구할 수 있어서 시스템 설계에 널리 활용될 수 을 것이라 예상된다. 이때 EPON의 제어 파라미터를 조절함으로써 트래픽 특성에 맞는 시스템을 설계할 수 있다.

• 한국정보처리학회논문지
• /
• 제6권2호
• /
• pp.459-466
• /
• 1999

I broadband ISDN every packet will show different result if it would be processed according to its usage by the server. That is, normal data won't show big differences if they would be processed at normal speed. But it will improve the quality of service to process some kinds of data - for example real time video or voice type data or some data for a bid to by something through the internet - more fast than the normal type data. solution for this problem was suggested - priority packets. But the analyses of them are under way. Son in this paper a switching system for an output queuing model in a single server was assumed and some packets were given priorities and analysed. And correlation, simulating real life situation, was given too. These packets were analysed through three cases, first packets having no correlation, second packets having only correlation and finally packets having priority three cases, first packets having no correlation, second packets having only correlation and finally packets having priority and correlation. The result showed that correlation doesn't affect the mean delay time and the high priority packets have improved mean delay time regardless of the arrival rate. Those packets were assumed to be fixed-sized like ATM fixed-sized cell and the contention strategy was assumed to be short bus contention method for the output queue, and the mean delay length and the maximum 버퍼 length not to lose any packets were analysed.

• 한국컴퓨터정보학회논문지
• /
• 제15권1호
• /
• pp.129-137
• /
• 2010

본 논문은 B-MAC 기반 센서네트워크에서 전송 패킷의 우선순위에 따른 차별화된 채널 선점권을 지원하기 위해, 프리앰블과 전송대기 시간을 활용한 패킷 우선순위화 기법을 제안한다. 이 기법은 높은 우선순위의 패킷의 전송 대기 시간을 줄이고 무선 채널의 선점을 보장하여 패킷 전달시간을 비롯한 QoS를 지원하고 센서 네트워크 전체의 무선 채널 사용에 대한 효율성 제고를 목적으로 한다. 이를 위해 무선 센서 네트워크에서 널리 사용되어지고 있는 TinyOS 기반 MAC 계층(B-MAC)에 다중 전송 큐를 설계하고 프리앰블 형식을 수정 설계하였다. 이를 통해 패킷의 우선순위에 따라 차등적 백오프를 적용할 경우, 상위패킷의 전송시간을 82-88% 가량 단축시켜 긴급 어플리케이션의 실시간성을 확보할 수 있음을 뒷받침하였다.

• 융합보안논문지
• /
• 제7권2호
• /
• pp.39-47
• /
• 2007

본 논문에서는 광대역통합 네트워크(BcN：Broadband Convergence Network)을 이용하는 사용자에게 서비스품질을 제공하기 위한 스케쥴링 기법의 성능을 비교, 분석한다. 이를 위하여 트래픽의 등급별 분류, 입력큐에서의 처리, 등급별 가중치 부여 등과 같은 주요 서비스품질 관리 기법들을 분석하고 최근 멀티미디어 인터넷 통신을 위해 우선 고려되고 있는 주요 스케쥴링 기법(Round Robin, Priority, Weighted Round Robin)들의 동작원리를 분석한다. NS-2를 이용한 시뮬레이션을 통하여 각 스케쥴링 기법들의 성능을 분석한 결과, 단순히 하나의 서비스 등급에 대하여 Priority 스케쥴링 기법을 사용하는 것보다 등급별로 적절한 가중치를 두어 자원을 사용하는 것이 바람직함을 알 수 있다.