• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.157-166
• /
• 2001

A simulation package has been developed as an event-driven system that can handle the hardware configuration of STC104 and algorithm proposed in the sister paper of ‘Study on High Speed Routers(II).’After various STC104 topology of meshes, torus, and hypercubes are constructed using up to 512 switches, the performance of each topology has been analyzed under different message generation rate in terms of throughputs, latency, and packet blocking time. Modified multicast algorithms for STC104 have been proposed for STC104 after U-mesh and U-torus in order to overcome the multicasting difficulty because of the point-to-point communication method found in STC104. The performance of the multicast algorithms have been analyzed over meshes and torus configuration. Throughput gets higher in the order of mesh, torus, and hypercube. Throughput difference among topology were distinctive in the zone of high message generation rate. Latency and blocking time increased in the order of hypercube, torus, and mesh. U-mesh and U-torus of software multicast showed similar throughput, however, U-mesh peformed slightly better result. These algorithms showed eight to ten times better results compared to individual message pass for 90 destination nodes. Multi-link environment also showed better performance than single-link environment because multi-link network used the extra links for communication.

• 정보처리학회논문지A
• /
• 제8A권2호
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• 한국전자통신학회논문지
• /
• 제4권1호
• /
• pp.20-24
• /
• 2009

센서 노드는 제한된 에너지를 가지고 동작한다. 대부분의 경우에, 에너지가 고간된 배터리를 교체하거나 재충전하는 것은 바람직하지 않거나 불가능하다. 따라서 MAC프로토콜 디자인에서 에너지 소모를 줄이는 것은 매우 중요한 문제 중 하나이다. 하지만, 센서 응용이 지연에 민감할 경우, 지연이 매우 중요한 요소이고, 이 지연은 에너지 소비와 트레이드오프하게 된다. 따라서 본 논문에서는 에너지 소모를 줄이고, 낮은 지연을 얻을 수 있는 MAC프로토콜을 제안한다. 이 프로토콜은 DSMAC을 기반으로, 동적으로 경로 사이의 상대적인 buffer의 패킷의 양에 따라서 duty cycle를 변경하게 된다.

• ETRI Journal
• /
• 제31권2호
• /
• pp.111-120
• /
• 2009

Network-on-chip (NoC) architecture provides a highper-formance communication infrastructure for system-on-chip designs. Circuit-switched networks guarantee transmission latency and throughput; hence, they are suitable for NoC architecture with real-time traffic. In this paper, we propose an efficient integrated scheme which automatically maps application tasks onto NoC tiles, establishes communication circuits, and allocates a proper bandwidth for each circuit. Simulation results show that the average waiting times of packets in a switch in $6{\times}6$6, $8{\times}8$, and $10{\times}10$ mesh NoC networks are 0.59, 0.62, and 0.61, respectively. The latency of circuits is significantly decreased. Furthermore, the buffer of a switch in NoC only needs to accommodate the data of one time slot. The cost of the switch in the circuit-switched network can be reduced using our scheme. Our design provides an effective solution for a critical step in NoC design.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권2호
• /
• pp.27-35
• /
• 2021

NAND flash memory-based SSD needs an internal software, Flash Translation Layer(FTL) to provide traditional block device interface to the host because of its physical constraints, such as erase-before-write and large erase block. However, because useful host-side information cannot be delivered to FTL through the narrow block device interface, SSDs suffer from a variety of problems such as increasing garbage collection overhead, large tail-latency, and unpredictable I/O latency. Otherwise, the new type of SSD, open-channel SSD exposes the internal structure of SSD to the host so that underlying NAND flash memory can be managed directly by the host-level FTL. Especially, I/O data classification by using host-side information can achieve the reduction of garbage collection overhead. In this paper, we propose a new scheme to reduce garbage collection overhead of open-channel SSD by separating the journal from other file data for the journaling filesystem. Because journal has different lifespan with other file data, the Write Amplification Factor (WAF) caused by garbage collection can be reduced. The proposed scheme is implemented by modifying the host-level FTL of Linux and evaluated with both Fio and Filebench. According to the experiment results, the proposed scheme improves I/O performance by 46%~50% while reducing the WAF of open-channel SSDs by more than 33% compared to the previous one.

• 한국인터넷방송통신학회논문지
• /
• 제11권5호
• /
• pp.211-216
• /
• 2011

네트워크 가상 환경 (NVEs : Networked Virtual Environments)은 지리적으로 분산된 사용자들이 가상 세계에서 네트워크 메시지 교환을 통하여 서로 상호작용이 가능한 분산 시스템이다. 대규모 다중 접속 온라인 게임 (MMOGs : Massively Multiplayer Online Game)은 수백명 이상의 사용자들이 가상 세상을 경험할 수 있는 다양한 응용 중의 하나이다. MMOG에서 관심영역 (AOI : Area Of Interest)이라는 제한된 영역은 사용자 간의 메시지 교환이 유발하는 부하를 감소시킨다. VON (Voronoi-based Overlay Network) 기법은 P2P 환경에서 대역폭 소모량을 감소시키기 위해 제안되었으며, Vorocast 기법도 역시 VON 상에서 메시지 전달을 이용하는 기법이었다. 우리는 포워딩 기법으로 메시지 발생자로부터 인접 노드들에게 보내지는 위치 갱신을 넘겨줌으로써 일관성과 지연성과 같은 문제들을 해결할 수 있는 동적 AOI 관리기법을 제안한다. 제안 기법은 직접 연결 기법과 Vorocast를 결합함으로써 기존 기법들에 비하여 더 나은 일관성과 낮은 지연성을 제공한다. 하나의 사용자와 AOI 내부에 포함된 다른 사용자들 사이에는 직접적으로 연결하여 통신하고, AOI의 외부에 존재하는 사용자들과는 Vorocast 기법을 이용하여 통신한다. 또한 시뮬레이션을 통하여 제안 기법의 성능을 평가하였다.

• 한국정보통신학회논문지
• /
• 제22권3호
• /
• pp.391-398
• /
• 2018

일반적인 이기종 디지털 장치들간의 데이터 공유는 다양한 인터페이스로 인해 많은 문제를 야기시킨다. 이런 문제를 해결하기 위해서 본 논문은 서로 다른 장치들간의 통신을 지원하는 D2D 통신을 사용하여 클라우드 서비스와 모바일을 결합한 이기종간의 데이터 공유를 제안한다. 제안된 기법은 데이터 동기화를 수행하기 위해 서버에 집중되는 부하를 줄이는 프로세스로 수행되며, 장치들간의 데이터 복제로 인한 지연을 최소화하기 위해 청크 리스트에 수정된 부분만을 복사하여 데이터 쓰기 속도에 기여하기 위한 기술을 채택하고, 데이터 공유를 위한 동기화로 소모되는 네트워크 대역폭을 최소화하기 위해서 모바일 환경과 결합한 클라우드 서비스 모델을 구현한다. 따라서 서로 다른 공간의 데이터를 효율적으로 공유하고 데이터의 무결성과 지연을 최소화할 수 있다.

• ETRI Journal
• /
• 제44권6호
• /
• pp.936-944
• /
• 2022

The mobile network allows redundant transmission via disjoint paths to support high-reliability communication (e.g., ultrareliable and low-latency communications [URLLC]). Although redundant transmission can improve communication reliability, it also increases network costs (e.g., traffic and control overhead). In this study, we propose a reliability-guaranteed multipath allocation algorithm (RG-MAA) that allocates appropriate paths by considering the path setup time and dynamicity of the reliability paths. We develop an optimization problem using a constrained Markov decision process (CMDP) to minimize network costs while ensuring the required communication reliability. The evaluation results show that RG-MAA can reduce network costs by up to 30% compared with the scheme that uses all possible paths while ensuring the required communication reliability.

• International journal of advanced smart convergence
• /
• 제12권1호
• /
• pp.9-17
• /
• 2023

Recently, IoT technology has been widely used in many industries. Also research on integrating IoT technology with IoT sensors is actively underway. One of the important challenges in IoT is to support low-latency communication. With the development of communication networks and protocols, a variety of protocols are being used, and their performance is improving. In this paper, we compare the performance and analyze the characteristics of some of the major communication protocols in IoT application, namely MQTT, HTTP, and HTTPS. IoT sensors acquired data by connecting an Arduino equipped with ESP8266 and a temperature and humidity sensor (DHT11). The server measured the performance by building servers for each protocol using AWS EC2. We analyzed the packets transmitted between the Arduino and the server during the data transmission. We measured the amount of data and transfer time. The measurement results showed that MQTT had the lowest data transmission time and data amount among the three protocols.

• 한국멀티미디어학회논문지
• /
• 제7권12호
• /
• pp.1754-1764
• /
• 2004

Lately mobile handheld devices such as Personal Digital Assistant (PDA) and cellular phones are getting more popular for personal web surfing. However, today most mobile handheld devices have relatively poor web browsing capability due to their low performance so their users have to suffer longer communication latency than those of desktop Personal Computers (PCs). In this paper, we propose an effective pre-refresh mechanism for embedded web browser of mobile handheld devices to reduce this problem. The proposed mechanism uses the idle time to pre-refresh the expired web objects in an embedded web browser's cache memory. It increases the utilization of Central Processing Unit (CPU) power and network bandwidth during the idle time and consequently reduces the client's latency and web browsing cost. An experiment was done using a simulator designed by us to evaluate the efficacy of the proposed mechanism. The experiment result demonstrates that it has a good performance to make web surfing faster.