• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2006년도 학술대회 1부
• /
• pp.406-412
• /
• 2006

정보통신 기술의 발달로 근래에는 인터넷 방송 서비스가 활성화되었으며 누구든 자유롭게 방송을 제작하거나 청취할 수 있다. 이러한 인터넷 방송을 이용하기 위해서는 PC 를 이용하는 방법이 일반적이지만 오디오 서비스만을 이용할 경우 불편하다. 본 논문에서는 낮은 사양의 시스템에서 인터넷 방송을 청취하기 위한 하드웨어와 소프트웨어 설계 기법 그리고 효율적인 버퍼링 방법을 제안하였다. 제안된 시스템은 8 비트 마이크로 컨트롤러, 32KB 의 메모리, Hardwired TCP/IP Stack 그리고 Hardwired MP3 디코더를 이용하여 설계하였으며 각 작업간의 스케쥴링을 위하여 타이머 인터럽트를 이용하였다. 16KB의 메모리로 몇 가지 버퍼링 기법을 제안했다. 폴링 방식은 가장 보편적인 방법으로 데이터를 전송받는 작업과 음악을 재생하는 작업이 순차적으로 이루어진다. 이 방법은 데이터 전송과 음악 재생을 동시에 할 수 없기 때문에 타이머 인터럽트를 이용한 버퍼링 모델이 사용된다. 두 번째로 메모리를 두개의 블록으로 나누어 한 블록에는 데이터를 저장하고 다른 한 블록에는 데이터를 내보내는 '더블 버퍼링'을 제안했다. 세 번째는 메모리 블록을 여러 단계로 나눈'n-Queue 버퍼링' 기법을 제안했다. 마지막으로 네트워크 상황에 따라서 블록의 개수를 유동적으로 조절하는 '가변 길이 n-Queue 버퍼링' 기법을 제안했다. 이 방법은 네트워크 상황에 따라 메모리의 크기를 유동적으로 할당하기 때문에 메모리 사용률이 높아지는 장점이 있다. 본 논문에서 제안하는 시스템은 운영체제를 사용하지 않았기 때문에 TV 나 오디오 등 다른 시스템에 이식이 용이하므로 다양한 기기에 적용이 가능하다.

• Journal of the Korean Statistical Society
• /
• 제33권3호
• /
• pp.283-298
• /
• 2004

We present a trial solution approach to GI/M/l queues with generalized vacations. Specific types of generalized vacations we consider are N -policy and a combination of N-policy and exponential multiple vacations. Discussions about how to find trial solutions are given.

• ETRI Journal
• /
• 제15권3_4호
• /
• pp.35-45
• /
• 1994

In this paper we develop an approximation formalism on the queue length distribution for general queueing models. Our formalism is based on two steps of approximation; the first step is to find a lower bound on the exact formula, and subsequently the Chernoff upper bound technique is applied to this lower bound. We demonstrate that for the M/M/1 model our formula is equivalent to the exact solution. For the D/M/1 queue, we find an extremely tight lower bound below the exact formula. On the other hand, our approach shows a tight upper bound on the exact distribution for both the ND/D/1 and M/D/1 queues. We also consider the $M+{\Sigma}N_jD/D/1$ queue and compare our formula with other formalisms for the $M+{\Sigma}N_jD/D/1$ and M+D/D/1 queues.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.469-481
• /
• 2004

In this paper, we investigate the mean queue length and the mean packet delay of a dynamic bandwidth allocation(DBA) scheme in an Ethernet passive optical network(EPON). We focus on the interleaved polling system with a gated service discipline. We assume that input packets arrive at an optical network unit(ONU) according to Poisson process. We use a continuous time queueing model in order to find the queue length distribution of the gated interleaved polling system with the first stage input queue and the second stage transmission queue. We give some numerical results to investigate the mean queue lengths and mean packet delays for the symmetric polling system with statistically identical stations.

• Journal of applied mathematics & informatics
• /
• 제9권1호
• /
• pp.349-357
• /
• 2002

In this paper, we analyze queueing behaviors and investigate the possibilities of reducing and controlling shortages and oversupplies in the bidirectional queueing system which forms a negative queue by demand and a positive queue by supply. Interarrival times of units in the bidirectional queueing system investigated are exponetially distributed. Instant pairing off implies that queue can be either positive or negative, but not both at the same time. The results include a proof that sum of queue lengths is minimized if rates of demand and supply in each system are equal and optimum solutions for rates of supply which minimize the sum of queue lengths when rates of demand and sum of rates of supply are given. In addition, the relationship between the ordinary queueing system and the bidirectional queueing system is investigated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제19권5호
• /
• pp.833-841
• /
• 1994

In this paper we develop an approximation formalism for the queue length distribution of general queueing models. Our formalism is based on two steps of analytic approximation employing both the lower and upper bound techniques. It is favorable to a fast numerical calcuation for the queue length distribution of a superposition of a superposition of arbitary type traffic sources. In the application. M+ N D /M/1 is considered. The calculated result for queue length distribution measured by arriving or leaving customers show a good agreement with the direct simulation of the system. Especially, we demonstrate that our formula for M/M/1 is equivalent to the exact solution, while that D/M/1 is simplified in an analytic form.

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.523-533
• /
• 2006

We analyze two finite buffers queueing system with priority scheduling dependent upon queue length. Customers are classified into two types ( type-l and type-2 ) according to their characteristics. Here, the customers can be considered as traffics such as voice and data in telecommunication networks. In order to support customers with characteristics of burstiness and time-correlation between interarrival, the arrival of the type-2 customer is assumed to be an Markov- modulated Poisson process(MMPP). The service order of customers in each buffer is determined by the queue length of two buffers. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, performance measures such as loss and mean delay are derived.

• Journal of Korea Society of Digital Industry and Information Management
• /
• 제8권2호
• /
• pp.81-94
• /
• 2012

This paper suggests PARED algorithm, a modified RED algorithm, that actively reacts to dynamic changes in network to apply packet drop probability flexibly. The main idea of PARED algorithm is that it compares the target queue length to the average queue length which is the criterion of changes in packet drop probability and feeds the gap into packet drop probability. That is, when the difference between the average queue length and the target queue length is great, it reflects as much as the difference in packet drop probability, and reflects little when the difference is little. By doing so, packet drop probability could be actively controled and effectively dealt with in the network traffic situation. To evaluate the performance of the suggested algorithm, we conducted simulations by changing network traffic into a dynamic stat. At the experiments, the suggested algorithm was compared to the existing RED one and then to ARED one that provided the basic idea for this algorithm. The results proved that the suggested PARED algorithm is superior to the existing algorithms.

• Journal of applied mathematics & informatics
• /
• 제7권2호
• /
• pp.617-627
• /
• 2000

ATM networks support diverse traffic types with different service requirement such as data, voice, video and image. This paper analyzes a dynamic priority queue to satisfy Quality of Service (QoS) requirements of traffic. to consider the burstiness of traffic, we assume the arrival to be a Markovian arrival process(MAP) . Performance measures such as loss and delay are derived, Finally, some numerical results show the performance of the system.

• Journal of applied mathematics & informatics
• /
• 제5권3호
• /
• pp.827-837
• /
• 1998

We consider the M/G/1 queue with instantaneous feed-back. The probabilities of feedback are determined by the state of the underlaying Markov chain. by using the supplementary variable method we derive the generating function of the number of customers in the system. In the analysis it is required to calculate the matrix equations. To solve the matrix equations we use the notion of Ex-tended Laplace Transform.