• 인터넷정보학회논문지
• /
• 제11권1호
• /
• pp.49-57
• /
• 2010

오늘날 수많은 인터넷 서비스 제공자를 통한 웹 사이트들의 등장과 ICT(Information and Communication Technology) 활용교육 등 선진화된 교육방법의 도입에 따라 인터넷 트래픽이 급격히 증가하고 있다. 이러한 현실 속에서 학교 현장에서는 사용중인 인터넷 대역폭 증가를 요구하고 있으나 정부의 예산 부족 및 기술적인 문제로 인하여 빠른 시일에 해결하기에는 어려운 상황이다. 이러한 상황 속에서 본 연구에서는 현재의 대역폭을 가지고 인터넷 운영의 효율화를 높일 수 있는 방안을 제안하였다. 이를 위해 현재 학교에서 사용 중인 인터넷 이용 현황을 분석하였으며, 분석된 결과를 가지고 기존의 일반적인 방법론과의 다른 관점인 유형별 인터넷 대역폭 분배 모형을 개발하였다. 향후 학교에서 요구되는 대역폭 증가를 예측하는데 활용할 수 있으며, 교육청의 학교 적정 대역폭 할당 및 학교 통신비 예산 절감 효과를 제공할 수 있을 것이다. 또한 미래 지향적인 통신망 정책 수립 시 참조 모델로 활용할 수 있을 것이다.

• 한국정보통신학회논문지
• /
• 제13권8호
• /
• pp.1549-1560
• /
• 2009

TDMA PON 시스템에서 서로 다른 ONU들이 상향으로 데이터를 효율적으로 전송하기 위해서 동적 대역할당방식은 필수적이라 할 수 있다. 본 논문에서는 하향과 상향이 각각 2.5/1.25 Gbps 속도를 갖는 G-PON OLT를 위한 DBA처리기를 구현한다. 이 처리기는 매 사이클 타임마다 각 ONU로부터 전송되는 상향 프레임의 대역요청 메시지를 종합하고 트래픽의 우선순위와 공정성을 고려하여 Alloc-ID 단위로 대역할당을 수행한다. 제안된 알고리즘에서는 링크의 효율을 올리기 위하여 한 사이클 타임을 여러 개의 G-PON프레임 ($m{\times}125{\mu}s$)으로 구성한다. 특히, 어떤 ONU에게 할당하고자 하는 대역이 프레임과 프레임 사이의 경계에 걸쳐 있을 때에도 추가적인 오버헤더가 없도록 하는 방법을 사용하기 때문에 링크의 효율이 높다. 이로 인하여 어떤 ONU에게 0에서 상향 대역의 전체에 이르기까지 대역을 융통성 있게 할당할 수 있게 된다. 제안된 DBA 처리기는 FPGA로 구현하며, 계측기를 통하여 ONU들에 대한 대역할당 과정을 보여준다.

• Journal of Communications and Networks
• /
• 제8권4호
• /
• pp.422-431
• /
• 2006

This paper proposes an adaptive routing protocol called ARCA for converged ad-hoc and cellular network (CACN). Due to the limitation of both bandwidth and transmission range in a cell, a mobile host (MH) may not be able to make a call during busy time. CACN offers a flexible traffic diversion mechanism that allows a MH to use the bandwidth in another cell to ease the congestion problem and increase the throughput in a cellular network. Based on the presentation of CACN's physical characteristics, the paper details the design issues and operation of the adaptive routing protocol for CACN (ARCA). Detailed numerical analysis is presented in terms of both route request rejection rate and routing overhead, which, along with the simulation results, have indicated the effectiveness and efficiency of the ARCA protocol.

• 정보화연구
• /
• 제10권2호
• /
• pp.159-167
• /
• 2013

Web Services offer many benefits over other types of middleware in distributed computing. However, usage of Web Services results in large network bandwidth since Web Services use XML-based protocol which is heavier than binary protocols. Even though there have been many researches to minimize the network traffic and bandwidth usages of Web Services messages, none of them are solving problem clearly yet. In this paper, we propose a transparent proxy with cache to avoid transfer of repeated SOAP data, sent by Web Service to an application. To maintain the cache consistency, we introduce publish/subscribe paradigm using WS-Eventing between the proxy and Web Service. The implemented system based on our proposed architecture will not compromise the standards of Web Service. The evaluation of our system shows that caching SOAP messages not only reduces the network traffic but also decreases the request delays.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.699-700
• /
• 2014

본 논문에서는 하나의 OLT (optical line termination)와 다수의 ONU (optical network unit)로 구성된 TWDM PON (time and wavelength division multiplexed passive optical network)의 동적 파장 및 동적 대역할당 알고리즘을 제안한다. 제안한 알고리즘은 ONU의 전송요청량에 근거하여 전송에 사용할 상향 파장개수를 동적으로 제한하여 소비전력을 감소시킨다.

• ETRI Journal
• /
• 제44권2호
• /
• pp.274-285
• /
• 2022

Retransmission in optical burst switching networks is a solution to recover data loss by retransmitting the dropped burst. The ingress node temporarily stores a copy of the complete burst and sends it each time it receives a retransmission request from the core node. Some retransmission schemes have been suggested, but uncontrolled retransmission often increases the network load, consumes more bandwidth, and consequently, increases the probability of contention. Controlled retransmission is therefore essential. This paper proposes a new controlled retransmission scheme for loss recovery, where the available bandwidth of wavelength channels and the burst lifetime are referred to as network conditions to determine whether to transmit a dropped burst. A retrial queue-based analysis model is also constructed to validate the proposed retransmission scheme. The simulation and analysis results show that the controlled retransmission scheme is more efficient than the previously suggested schemes regarding byte loss probability, successful retransmission rate, and network throughput.

• 한국통신학회논문지
• /
• 제36권1A호
• /
• pp.49-57
• /
• 2011

Random access method for Wibro system is proposed using the Bayesian Technique, which can estimate the number of bandwidth request messages in a frame only based on the number of successful slots. The performance measures such as the maximum average throughput, the mean delay time and the collision ratio are investigated to evaluate the performance of the proposed method. The proposed method shows better performance than the binary exponential backoff algorithm used currently.

• Interaction and multiscale mechanics
• /
• 제6권2호
• /
• pp.197-210
• /
• 2013

A fundamental trend of processor architecture evolving towards exaflops is fast increasing floating point performance (so-called "free" flops) accompanied by much slowly increasing memory and network bandwidth. In order to fully enjoy the "free" flops, a numerical algorithm of PDEs should request more flops per byte or increase arithmetic intensity. A meshfree/GFEM approximation can be the class of the algorithm. It is shown in a GFEM without extra dof that the kind of approximation takes advantages of the high performance of manycore GPUs by a high accuracy of approximation; the "expensive" method is found to be reversely hardware-efficient on the emerging architecture of manycore.

• Journal of Information Processing Systems
• /
• 제2권2호
• /
• pp.101-106
• /
• 2006

Grid computing is an emerging technology that enables global resource sharing. In Korea, the $K^*$Grid provides an extremely powerful research environment to both industries and academia. As part of the $K^*$Grid project, we have constructed, together with the Korea Institute of Science and Technology Information and a number of domestic universities, a supercomputer Grid test bed which connects several types of supercomputers based on the globus toolkit. To achieve efficient networking in this Grid testbed, we propose a novel method of available bandwidth measurement, called Decoupled Capacity measurement with Initial Gap (DCIG), using packet trains. DCIG can improve the network efficiency by selecting the best path among several candidates. Simulation results show that DCIG outperforms previous work in terms of accuracy and the required measurement time. We also define a new XML schema for DCIG request/response based on the schema defined by the Global Grid Forum (GGF) Network Measurement Working Group (NM-WG).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권11호
• /
• pp.5335-5353
• /
• 2019

The definition of the bandwidth efficiency (BE) of cognitive cooperative network (CCN) is the ratio between a number of the licensed slot(s) or sub-channel(s) used by the unlicensed users to transmit a single data packet from the unlicensed transmitter to unlicensed destination, and from unlicensed relay(s) to unlicensed destination. This paper analyzes and improves the BE in the underlay CCN with a new reactive relay selection under interference and power constraints. In other words, this paper studies how unlicensed cooperative users use the licensed network slot(s) or sub-channel(s) efficiently. To this end, a reactive relay selection method named as Relay Automatic Repeat Request (RARQ) is proposed and utilized with a CCN under interference and power constraints. It is shown that the BE of CCN is higher than that of cooperative transmission (CT) due to the interference and power constraint. Furthermore, the BE of CCN is affected by the distance of the interference links which are between the unlicensed transmitter to the licensed destination and unlicensed relay to the licensed destination. In addition, the BE for multiple relays selection over a CCN under interference and power constraints is also analyzed and studied, and it is shown that the BE of CCN decreases as the number of relays increases.