• 전자공학회논문지B
• /
• 제28B권7호
• /
• pp.535-539
• /
• 1991

In this paper, message time delay is considered in the SCCP(Signalling Connection Control Part) of the CCITT common channel signalling system No.7. In this simulation, the protocol of the SCCP is programmed using C language and this program is considered on condiion of only connectionless mode and class 0. This simulation reveals bottleneck point depending on message processing capability in the SCCP, so this simulation shows the low limit of the SCCP's processing capability. We show that bottleneck point is at 2000[ messages/sec ] on model A and at 3500[ message/sec ] in model C.

• 산업기술연구
• /
• 제24권B호
• /
• pp.177-186
• /
• 2004

The main bottleneck for a VOD system is bandwidth of storage or network I/O due to the high bandwidth requirements and long-lived nature of digital video. Patching is one of the most efficient techniques to overcome the bottleneck of the VOD system through the use of multicast scheme. In this paper, we propose a new patching scheme, P2P proxy patching, for improving the typical patching technique by jointly using the proxy prefix caching scheme and the P2P proxy. In our proposed scheme, each client play a role in a proxy for multicasting a regular stream to other clients that request the same stream. Due the use of the P2P proxy and the prefix caching, the server bandwidth is required significantly less than that of the typical patching technique. In the performance study, we show that our patching scheme can reduce the server bandwidth requirements compared with the existing patching techniques.

• 정보기술과데이타베이스저널
• /
• 제8권2호
• /
• pp.41-60
• /
• 2001

Despite the growth in Internet users, demand for multi-medial, large data files and resulting explosive growth in data traffic, there has been lack of investment in Middle-Mile, interconnection of various networks, resulting in bottleneck effect, which is acerbating. One strategy to overcome such network bottleneck is Content Delivery Network (CDN). CDN does not achieve efficient delivery of large file data through physical improvement/increase in network capacity, but by delivering large file contents, the cause of bottlenecks, from distributed servers. Since it is impracticable to physically improve networks capacity to accommodate the growth in internet traffic, CON, by strong CPs contents at cache servers deployed at major ISPs networks, is able to deliver requested contents to the requesting Web clients without the loss of data and long latency.

• 제어로봇시스템학회논문지
• /
• 제3권5호
• /
• pp.503-510
• /
• 1997

기존에 있는 그룹테크놀로지의 방법들은 기계와 부품간의 공정유사성이나 그밖의 다른 정의의 유사성을 갖고 한 가지 정도의 알고리즘이나 수학적인 모델로써 해를 구했으나 그 해들은 실질적으로 현대 산업의 생산시스템이나 자동화에서 풀어나가야 하는 기계들의 병목현상을 풀어나가는 직접적인 접근방법을 제시하지 못했다. 따라서 본 연구에서는 새로운 기계간 유사성의 개발과 그래프이론을 응용한 알고리즘 그리고 수학적인 모델을 동시에 응용해서 병목현상을 초래하는 예외적인 원소의 재배치를 효과적이고 쉬운방법으로 제시하였다.

• ETRI Journal
• /
• 제34권4호
• /
• pp.553-563
• /
• 2012

Serial peripheral interface (SPI) has been identified as a bottleneck in many wireless sensing systems today. SPI is used almost universally as the physical connection between the microcontroller unit (MCU) and radios, storage devices, and many types of sensors. Virtually all wireless sensor nodes today perform up to twice as many bus transactions as necessary to transfer a given piece of data, as an MCU must serve as the bus master in all transactions. To eliminate this bottleneck, we propose the master-handoff protocol. After the MCU initiates reading from the source slave device and writing to the sink slave device, the MCU as a master becomes a slave, and either the source or the sink slave becomes the temporary master. Experiment results show that this master-handoff technique not only cuts the data transfer time in half, but, more importantly, also enables a superlinear energy reduction.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.306-309
• /
• 1996

The job shop scheduling problem has been a major target for many researchers. And, most of the past studies did not consider setup time. In many cases of real manufacturing environment, however, there exists a setup time for each operations. The setup can be divide into two parts, one can be done after job arrival. The setup time based on the latter can be summed together with processing time, but that based on the former can not be. We propose an approximation method based on shifting bottleneck procedure for solving the job shop scheduling problem with sequence independent setup time. It schedules the machines one by one, taking a bottleneck machine among the machines not yet scheduled. Every time after a new machine is scheduled, all schedules previously established are updated. Both the bottlenck search and the schedule updating procedure are based on solving a single machine scheduling problem with ready time, setup time and delivery time iteratively.

• 응용통계연구
• /
• 제17권2호
• /
• pp.311-326
• /
• 2004

대다수의 TCP사용자들이 접근하여 병목현상을 보이는 두 개의 ECN/RED게이트 웨이에 대한 마코프 모형을 제시하고 분석하였다. 사용자의 수가 증가함에 따라, 각 게이트웨이의 버 피를 점유하는 사용자당 패킷수는 일정 한 상수들로 수렴 한다는 것을 보이고, 이 상수값을 구하는 알고리즘을 제시하였다.

• 대한산업공학회지
• /
• 제32권2호
• /
• pp.104-110
• /
• 2006

When a new facility such as automobile assembly line is designed, computer simulation is often used to estimate its actual throughput level. If it falls short of the target throughput level, then the design must be modified to increase the throughput capacity. For complex facilities having parallel processes and network of material flows, the modification procedure is not trivial. Even if the capacity of a particular bottleneck process is increased, the target throughput may not be achieved because the bottleneck may move to another process. Furthermore, each process has a different set of options with different cost to increase the capacity. In this study, we present a systematic procedure of determining the cost-effective set of options which achieves the target throughput.

• 한국멀티미디어학회논문지
• /
• 제23권2호
• /
• pp.216-226
• /
• 2020

In this paper, a stacked convolutional autoencoder model is proposed in order to classify Alzheimer's disease with high accuracy in PET/CT images. The proposed model makes use of the latent space representation - which is also called the bottleneck, of the encoder-decoder architecture: The input image is sent through the pipeline and the encoder part, using stacked convolutional filters, extracts the most useful information. This information is in the bottleneck, which then uses Softmax classification operation to classify between Alzheimer's disease, Mild Cognitive Impairment, and Normal Control. Using the data from Dong-A University, the model performs classification in detecting Alzheimer's disease up to 98.54% accuracy.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2006년도 한국컴퓨터종합학술대회 논문집 Vol.33 No.1 (C)
• /
• pp.211-213
• /
• 2006

현재 개발되어 사용되고 있는 원격의료시스템은 3계층기반의 구조를 이루고 있는데 환자들이 집중적으로 몰리는 지역에서 심각한 bottleneck현상이 발생할 수 있다. 본 논문에서는 3계층기반 원격의료시스템의 성능을 분석하고 bottleneck 현상을 해결하기 위한 방안으로 hyper-torus 구조의 4계층 아키텍처를 제안하고 Architecture Description Language인 Acme를 이용하여 성능을 비교분석 한다.