• ETRI Journal
• /
• 제43권1호
• /
• pp.64-73
• /
• 2021

Two-dimensional torus network nodes are typically interconnected using XY routing algorithm for transmitting a packet from a source node to a destination node. In XY routing, if all the paths are used efficiently, the throughput and latency can be improved. In this paper, to utilize all the paths efficiently, we propose a novel binary optical routing algorithm (BORA) to improve the throughput and latency. The throughput is calculated according to the injection rate and number of packets received at the destination. The XY routing algorithm and proposed BORA are implemented using objective modular network testbed in C++ simulation software and the results are analyzed and compared. In this paper, the simulation results show that the network latency reduces to 50% while using the proposed algorithm; moreover, the throughput is also improved.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2006년도 하계학술대회
• /
• pp.43-46
• /
• 2006

IEEE 802.16 WirelessMAN aiming to broadband wireless access (BWA) is evolving to 4G mobile communication system through the standardization of IEEE 802.16e supporting mobility on existing fixed WirelessMAN system. It is necessary for hand-over to provide seamless data service while MS (Mobile Station) moves to another BS (Base Station). Because the performance of handover affects packet loss or delay of any communications, it must consider low latency handover mechanism in packet based network. In this paper, we describes handover scheme of IEEE 802.16e with the cell edge interference problem and shows the way to solve the problem in frequency reuse one deployment. Our scheme reduces the handover latency and packet loss probability.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2007년도 추계종합학술대회
• /
• pp.63-66
• /
• 2007

MIPv6에서는 노드가 이동하여 그 연결이 바뀔 때마다 일어나는 핸드오버 과정에서는 많은 지연을 가져 온다. 단말의 이동성 관리를 네트워크가 지원하는 NetLMM(Network based Localized Mobility Management)에서는 핸드오버 지연을 MIH(Media Independent Handover)서비스를 이용하여 개선하였다. 본 논문에서는 NetLMM 프로토콜에 추가적인 메시지를 이용하여 핸드오버 지연을 분석 한다.

• Journal of information and communication convergence engineering
• /
• 제6권3호
• /
• pp.245-248
• /
• 2008

Everytime a node moves out of its area, the connection to the node encounters a handover which may cause much latency. NetLMM(Network based Localized Mobility Management) supports the mobility management for such nodes and improves handover latency using MIH(Media Independent Handover) function. In this paper, we add some messages to NetLMM procedure to improve handover latency and analyze its effects through a scenario based approach

• 대한임베디드공학회논문지
• /
• 제15권6호
• /
• pp.299-305
• /
• 2020

We have developed a scheduler that additionally consider network performance by extending the Kubernetes developed to manage lots of containers in cloud computing nodes. The network delay adapt characteristics of the compute nodes were learned during server operation and the learned results were utilized to develop placement algorithm by considering the existing measurement units, CPU, memory, and volume together, and it was confirmed that the low delay network service was provided through placement algorithm.

• 한국인터넷방송통신학회논문지
• /
• 제23권3호
• /
• pp.59-64
• /
• 2023

화재 재난방송 시스템에서는 아날로그, 디지털, 네트워크 디지털 전관 방송 시스템으로 나뉘며, 네트워크 디지털 전광 방송 시스템에서 중요한 사양은 낮은 대기 시간(Low-latency), 높은 샘플링 레이트, 다채널 입출력이다. 기존에 데이터링크 층의 MAC 주소 기반으로 구별하는 AoE(Audio over Ethernet) 방법을 널리 사용하고 있다. 그러나 이 방법은 복잡성과 비용이 증가하는 문제가 있다. 이에 본 제안은 AoIP(Audio over Internet Protocol)/UDP 방식으로 별도의 중복적인 네트워크가 필요 없이 IP(Internet Protocol) 주소로 손쉽게 구별하는 통신을 할 수 있어 네트워크를 자유롭게 사용 구성하고 복잡도를 낮추어 비용을 낮출 수 있도록 제안한다. AoIP/UDP 방식으로 구현 후 실험결과 2.66ms 대기 시간 성능으로 동등한 성능으로 비용의 개선함을 보였다.

• Journal of Communications and Networks
• /
• 제17권3호
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

• ETRI Journal
• /
• 제40권1호
• /
• pp.72-88
• /
• 2018

In the fifth generation (5G) era, the radio internet protocol capacity is expected to reach 20 Gb/s per sector, and ultralarge content traffic will travel across a faster wireless/wireline access network and packet core network. Moreover, the massive and mission-critical Internet of Things is the main differentiator of 5G services. These types of real-time and large-bandwidth-consuming services require a radio latency of less than 1 ms and an end-to-end latency of less than a few milliseconds. By distributing 5G core nodes closer to cell sites, the backhaul traffic volume and latency can be significantly reduced by having mobile devices download content immediately from a closer content server. In this paper, we propose a novel solution based on software-defined network and network function virtualization technologies in order to achieve agile management of 5G core network functionalities with a proof-of-concept implementation targeted for the PyeongChang Winter Olympics and describe the results of interoperability testing experiences between two core networks.

• 한국통신학회논문지
• /
• 제34권8A호
• /
• pp.600-609
• /
• 2009

기존의 IEEE 802.11 DCF(Distributed Coordination Function)와 같은 전통적인 CSMA(carrier sense multiple access) 프로토콜은 네트워크 규모가 커짐에 따라서 성능의 급격한 감쇠와 전송 지연 증가를 초래한다. 이러한 문제를 효과적으로 해결하기 위하여 본 논문에서는 무선 센서 네트워크에 적합한 MAC(medium access control) 프로토콜을 제안한다. 기존의 DCF 프로토콜은 데이터 전송을 위한 슬롯(slot)을 선택할 때 패킷 충돌로 인한 재전송이 반복될 때 마다 크기가 커지는 경쟁 윈도우(contention window) 내에서 일반 확률 분포(uniform probability distribution)를 이용한 랜덤(random) 선택 기법을 사용하지만 제안한 프로토콜에서는 전송 지연을 최대한 감소시키기 위하여 경쟁 윈도우의 크기를 고정시키고, 전송 슬롯을 보다 효율적으로 선택하도록 비 균등(non-uniform)확률 분포를 사용하여 전송 슬롯을 랜덤하게 선정한다. 시뮬레이션을 통하여 제안한 프로토콜이 802.11 MAC 표준에 비하여 전송 지연이 감소함을 보여 전송 지연에 민감한 실시간 무선 센서 네트워크의 최적 지연 한계점(best latency bound)을 충족시키는 프로토콜임을 입증한다.

• 한국정보컨버전스학회:학술대회논문집
• /
• 한국정보컨버전스학회 2008년도 International conference on information convergence
• /
• pp.199-204
• /
• 2008

Sensor nodes have various energy and computational constraints because of their inexpensive nature and ad-hoc method of deployment. Considerable research has been focused at overcoming these deficiencies through faster media accessing, more energy efficient routing, localization algorithms and system design. Our research attempts to provide a method of improvement MAC performance in these issues. We show that traditional carrier-sense multiple access(CSMA) protocols like IEEE 802.11 do not handle the first constraint adequately, and do not take advantage of the second property, leading to degraded latency and throughput as the network scales in size, We present more efficient method of a medium access for real-time wireless sensor networks. Proposed MAC protocol is a randomized CSMA protocol, but unlike previous legacy protocols, does not use a time-varying contention window from which a node randomly picks a transmission slot. To reduce the latency for the delivery of event reports, it carefully decides a fixed-size contention window, non-uniform probability distribution of transmitting in each slot within the window. We show that it can offer up to several times latency reduction compared to legacy of IEEE 802.11 as the size of the sensor network scales up to 256 nodes using widely used simulator ns-2. We, finally show that proposed MAC scheme comes close to meeting bounds on the best latency achievable by a decentralized CSMA-based MAC protocol for real-time wireless sensor networks which is sensitive to latency.