• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.80-90
• /
• 1996

The efficienty of ATM is based on the statical multiplexing of fixed-length packets, which are called cells. The most important technical point for realizing ATM switching network is an arrangement of the buffers and switches. Current most ATM switching networks are being achieved by using the switching modules based on the unit switch of $8{\times}8$ 150Mb/s or $16{\times}16$ 150Mb/s, the unit switch of $32{\times}32$150Mb/s for a large scale system is under study in many countries. In this paper, we proposed a new $32{\times}32$(4.9Gb/s throughput) ATM switch using Shared buffer memory switch which provides superior traffic characteristics in the cell loss, delay and throughput performance and easy LSI(Large Scale Integrated circuit). We analytically estimated and simulated by computer the buffer size into it. We also proposed the configuration of the large capacity ATM switching network($M{\times}M$.M>1,000) consisting of multistage to improve the link speed by non-blocking.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.10B
• /
• pp.854-861
• /
• 2003

In this paper, we proposed the fuzzy control algorithm for efficient buffer control about traffic that is connected in ATM networks. The proposed Fuzzy control algorithm has total traffic arrival ratio, buffer occupancy ratio and Fuzzy set to search for dynamic service rates in server. That is, is based on Fuzzy logic according to the arrival ratio of total traffic and buffer occupancy ratio that is happened and reasoning. Then, made reasoning result control service rates in server about traffic that is connected with defuzzification value. Performance analysis result: it was confirmed that with the proposed scheme, performance improves at cell loss rate, when compared with the existing PBS scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.492-504
• /
• 1994

In ATM network was two QOS bearer services for flexible bandwidth assignment, various priority assignment buffer access mechanisms have been sugested. In this paper, a performance model with 3 state discrete time Markov proess in explicit priority assignment is suggested and cell loss probability is analytically derived. Also flexible space priority control mechanism with partial buffer sharing is studied and verified by simulation with OPNET.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.12C
• /
• pp.261-267
• /
• 2001

This paper presents the architecture of multiple-queue manager for input-queued switch, which has arbitration latency, and the design of the chip. The proposed architecture of multiple-queue manager provides wire-speed routing with a pipelined buffer management, and the tolerance of requests and grants data transmission latency between the input queue manager and central arbiter using a new request control method, which is based on a high-speed shifter. The multiple-input-queue manager has been implemented in a field programmable gate array chip, which provides OC-48c port speed. It enhances the maximum throughput of the input queuing switch up to 98.6% with 128-cell shared input buffer in 16$\times$16 switch size.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.14 no.1
• /
• pp.69-76
• /
• 2014

In this paper, we propose a buffering scheme to improve the performance in P2P live streaming systems by adjusting the ratio of caching and prefetching portion of each peer. To this end, we assign all the peers into many groups depending on their playback periods. We then determine the ratio of caching and prefetching portion in each peer depending on its playback time position relative to those of other peers within the same group. In other words, as the playback position of a peer gets later, we increase the ratio of its caching portion. On the contrary, as the playback position of a peer gets eariler, we increase the ratio of its prefetching portion. This can significantly increase the degree of data duplication among peers that belong to each specific group. By simulation experiments, we show that our proposed an integrated prefetching/caching scheme can improve the performance considerably in terms of jitter ratio, initial playback delay and shared buffermap ratio when compared to the existing fixed portion buffering scheme.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.1
• /
• pp.29-42
• /
• 1999

은행이나 증권시장 혹은 통신 분야와 같은 온라인 트랜잭션처리 (OLTP) 응용 분야들이 계속 증가하고 있으며 그 규모와 복잡성은 매년 405에서 50% 이상 증가하고 있는 것으로 평가되고 있다. 이러한 복잡한 OLTP 응용분야들은 한 대의 개인용 컴퓨터나 워크스테이션으로는 처리가 불가능하며, 슈퍼 컴퓨터나 MPP와 같은 고성능의 컴퓨터를 이용하는 경우에는 방대한 예산이 소요될 것이다. 본 논문에서는 데이터를 공유하는 워크스테이션 클러스터에서 트랜잭션을 병렬로 처리할 수 있는 고성능 트랜잭션처리 시스템인 PHLOX를개발한다. PHLOX는 네트워크 파일 시스템을 이용하여 데이터를 공유함으로써 확장성이 뛰어나며 각 워크스테이션의 메모리 버퍼간에 직접 데이터 전송을 지원함으로써 디스크 액세스빈도수를 줄일 수 있다는 장점을 갖는다.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.416-423
• /
• 2003

This paper proposes a continuous-time queuing model of a shared-buffer packet switch and an approximate algorithm. N arrival processes have heterogeneous busty traffic characteristics. The arrival processes are modeled by Coxian distribution with order 2 that is equivalent to Interruped Poisson Process. The service time is modeled by Erlang distribution with r stages. First the approximate algorithm performs the aggregation of N arrival processes as a single state variable. Next the algorithm discompose the queuing system into N subsystems which are represented by aggregated state variables. And the balance equations based on these aggregated state variables are solved for by iterative method. Finally the algorithm is validated by comparing the results with those of simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.2
• /
• pp.381-389
• /
• 1994

In the communication network, multimedia service such as high quality voice, high speed data, image etc. will be added to the existing service. This service generates new requirements for the communication networks. The priority control mechanism can be used to control multimedia traffics generated by many communication systems. The priority mechanism which assigns prioirities to generated cells according to service quality is one of the traffic control. The priority assignment can be divided by priority criterion for each traffic characteristics such as loss sensitivity and delay sensitivity. In this paper, we alnalyzed the partial buffur sharing (PBS) mechani느 as a traffic control reducing the cell loss, and proposed analysis method. We analyzed the PBS mechanism using classical approach as a Markov chain. In order to validata proposed analysis method, simulation is performed using simulation package SIMSCRIPT 11.5. From this results, we confirmed that proposed analysis method can be verified. Also, we presented cell loss probability of ATM network when this results are to be applied to ATM networks.

• Annual Conference of KIPS
• /
• 2017.04a
• /
• pp.71-72
• /
• 2017

PLSI 통합 슈퍼컴퓨팅 서비스 환경에서는 다수의 사이트에서 클러스터 시스템 간 데이터 공유를 위해 글로벌 파일시스템을 사용하고 있으나, 수백 노드 이상의 클라이언트와 파일 서버 간 통신이 이루어지는 병렬 I/O에서 네트워크 병목 현상 이 발생할 수 있다. 따라서, 본 연구에서는 네트워크 병목 현상이 PLSI 글로벌 파일 시스템의 I/O 성능에 미치는 영향을 분석한다. PLSI 글로벌 파일시스템 테스트 베드에서 실험을 통해 네트워크 스위치의 버퍼 크기가 병목 현상을 유발하며, 네트워크 스위치의 버퍼 용량을 증가하여 I/O 성능을 개선할 수 있음을 보여준다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.11
• /
• pp.1580-1588
• /
• 2016

Recently, as the proliferation of mobile smart devices, multimedia content sharing technologies between mobile smart devices have provided. For efficient content sharing in wireless networks, the hierarchical streaming network has been proposed. However, member devices in a network group experience frequent delay while playing multimedia content files because of excessive network resource occupation between a relay and member devices. In this paper, we propose an efficient multimedia streaming relay method using media buffer control to reduce network congestion during streaming from the relay device to the member devices. We also measured the number of buffering and buffering time of the proposed relay engine and compared them with the performance of the existing relay engine.