• ETRI Journal
• /
• 제39권4호
• /
• pp.525-534
• /
• 2017

A hardware-acceleration architecture that separates virtual network functions (VNFs) and network control (called HSN) is proposed to solve the mismatch between the simple flow steering requirements and strong packet processing abilities of software-defined networking (SDN) forwarding elements (FEs) in SDN/network function virtualization (NFV) architecture, while improving the efficiency of NFV infrastructure and the performance of network-intensive functions. HSN makes full use of FEs and accelerates VNFs through two mechanisms: (1) separation of traffic steering and packet processing in the FEs; (2) separation of SDN and NFV control in the FEs. Our HSN prototype, built on NetFPGA-10G, demonstrates that the processing performance can be greatly improved with only a small modification of the traditional SDN/NFV architecture.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2008년도 하계종합학술대회
• /
• pp.131-132
• /
• 2008

It is necessary to develop a high-speed wireless transmission system, which is able to send medical informations to the emergency medical center during emergency patient transportation. In this research, a system which transmits patient’s vital signs and a real-time audio/video contents of the event has been designed, developed, and the suitability of the system has been verified. Test results indicate that the system is capable of transmitting vital signal data, including 17 numeric data, 12 waveforms and 113 events, reading the affected part by forwarding a $320{\times}240$ pixel image at 2fps. Also, the full-duplex voice transmission of the system at 8bit/64kbps is enough to make stable communication between emergency medical technicians and hospital professionals possible. After numerous hours of driving, the packet loss of patient vital signs is 0.013%.

• 한국멀티미디어학회논문지
• /
• 제20권2호
• /
• pp.254-260
• /
• 2017

Data packets from sensor nodes scattered over measuring fields are generally forwarding to the sink node, which may be connected to the wired networks, in a wireless sensor network. So many data packets are gathered near the sink node, resulting in significant data packet collisions and severe transmission latency. In an event detection application such as object tracking and military, bursty data is generated when an event occurs. So many data packet should be transmitted in a limited time to the sink node. In this paper, we present a delay efficient and bursty traffic friendly MAC protocol called DEBF-MAC protocol for wireless sensor networks. The DEBF-MAC uses a slot-reserved mechanism and sleep period control method to send multiple data packets efficiently in an operational cycle time. Our simulation results show that DEBF-MAC outperforms DW-MAC and SR-MAC in terms of energy consumption and transmission delay.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4389-4410
• /
• 2014

Network coding is a promising technology that increases system throughput by reducing the number of packet transmissions from the source node to the destination node in a saturated traffic scenario. Nevertheless, some packets can suffer from end-to-end delay, because of a queuing delay in an intermediate node waiting for other packets to be encoded with exclusive or (XOR). In this paper, we analyze the delay according to packet arrival rate and propose two network coding schemes, iXOR (Intelligent XOR) and oXOR (Optimal XOR) with Markov Decision Process (MDP). They reduce the average delay, even under an unsaturated traffic load, through the Holding-${\chi}$ strategy. In particular, we are interested in the unsaturated network scenario. The unsaturated network is more practical because, in a real wireless network, nodes do not always have packets waiting to be sent. Through analysis and extensive simulations, we show that iXOR and oXOR are better than the Distributed Coordination Function (DCF) without XOR (the general forwarding scheme) and XOR with DCF with respect to average delay as well as delivery ratio.

• 한국통신학회논문지
• /
• 제35권9A호
• /
• pp.882-888
• /
• 2010

Vehicular Ad-Hoc Networks (VANETs) using inter-vehicle communication can potentially enhance traffic safety and facilitate many vehicular applications. Therefore, this paper proposes an inter-vehicle routing protocol called Junction-Assisted Routing (JAR) that uses fixed junction nodes to create the routing paths for VANETs in city environments. JAR is a proactive routing protocol that uses the Expected Transmission Count (ETC) for the road segment between two neighbor junctions as the routing paths between junction nodes. Simulation results showed that the proposed JAR protocol could outperform existing routing protocols in terms of the packet delivery ratio and average packet delay.

• 센서학회지
• /
• 제19권4호
• /
• pp.297-305
• /
• 2010

A home healthcare system based wireless sensor network, which can continuously monitor and manage the elderly's electrocardiogram(ECG) signal at any space at home without space limit is proposed. The communication coverage of wireless network is expended by multi-hop wireless sensor network. In order to send the elderly's ECG data wirelessly, a small size ECG sensor node was designed to forward the ECG data over multi-hop relay network. The packet acquired by mobile ECG node is transmitted through wireless intermediate nodes to base station for analyzing the packet reception rate. Modified minimum cost forwarding(MMCF) protocol and flooding protocol are designed and implemented to check the transmission efficiency of a packet in a wireless sensor network. The developed MMCF protocol shows an advantage of high reception rate by reduced network traffic.

• 대한산업공학회지
• /
• 제25권2호
• /
• pp.233-239
• /
• 1999

With the increase of Internet protocol (IP) packets the performance of routers became an important issue in internetworking. In this paper we examined the matching algorithm in gigabit router which has input queue with virtual output queueing. Port partitioning concept is employed to reduce the computational burden of the scheduler within a switch. The input and output ports are divided into two groups such that the matching algorithm is implemented within each input-output pair group in parallel. The matching is performed by exchanging input and output port groups at every time slot to handle all incoming traffics. Two algorithms, maximal weight matching by port partitioning (MPP) and modified maximal weight matching by port partitioning (MMPP) are presented. MMPP has the lowest delay for every packet arrival rate. The buffer size on a port is approximately 20-60 packets depending on the packet arrival rates. The throughput is illustrated to be linear to the packet arrival rate, which can be achieved under highly efficient matching algorithm.

• International Journal of Computer Science & Network Security
• /
• 제22권1호
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.

• 한국통신학회논문지
• /
• 제40권6호
• /
• pp.1058-1069
• /
• 2015

무선 센서 네트워크에서 위치 기반 라우팅은 위치 정보를 이용하여 데이터 메시지를 전달하기에 효과적인 방법으로 알려져 있다. 위치 기반 라우팅에서 대표적인 그리디 포워딩이 불가능할 경우, 페이스 라우팅이 복구 수단으로 쓰이고 있다. 페이스 라우팅은 교차된 연결들을 제거한 평면 그래프를 바탕으로 구성되며 이는 가장 가까운 이웃 노드들의 연결을 제외한 나머지 연결들은 모두 제거됨을 의미한다. 하지만 페이스 라우팅은 무선 반경을 고려하지 않아 한 홉 범위 안에서 멀리 갈 수 있는 링크들이 존재하더라도 평면 그래프의 규칙에 의해 짧은 링크들을 선택한다. 이것은 밀집된 지역에서 페이스 라우팅을 쓰일 경우 에너지 효율성을 저하시킨다. 본 논문에서는 평면 그래프에서 제거된 링크들을 찾고 이용할 수 있는 프로토콜을 제안한다. 본 프로토콜은 작은 크기의 컨트롤 메시지와 함께 무선 반경에서 제거된 링크를 찾는다. 시뮬레이션을 통해 제안 방안이 이전 페이스 라우팅 프로토콜보다 에너지 효율성이 높음을 보인다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제6권2호
• /
• pp.244-253
• /
• 2000

병렬 컴퓨터의 메시지 전달에서 응용에 관계없이 일반적으로 우수한 경로 지정 및 스위칭 정책은 존재하지 않으므로, 사용자가 응용에 따라서 정책을 변경할 수 있게 하는 것이 바람직하다. 본 논문에서는 마이크로프로세서 구조에 기초한 경로 지정 엔진과는 달리, 성능의 감소 없이 융통성 있는 경로 지정과 스위칭 기능을 수행할 수 있는 조견표(look-up table) 경로 지정 엔진의 구현에 대하여 기술한다. 제안된 경로 지정 엔진은 조견표의 내용을 바꿈으로써 웜홀(wormhole), 가상 컷스루우(virtual cut-through) 및 패킷 스위칭(packet switching) 등은 물론, 다양한 경로 지정 알고리즘의 혼성(hybride)스위칭을 구현할 수 있다. 경로 지정 엔진의 조견표는 파이프라인 구조로 되어 있어, 하나의 플릿(flit) 정도의 저 지연을 가지므로, 단일 경로 지정 및 스위칭 정책을 하드와이어(hardwired)로 구현한 경우 보다 큰 성능의 감소 없이 다중의 경로 지정 동작을 중첩할 수 있다. 제안된 4개의 파이프 라인단은 해저드(hazard)를 일으키지 않으므로, 고 비용의 포워딩(forwarding) 회로가 필요 없다. 경로 지정 엔진은 시간공유의 컷스루우 버스나 크로스바(crossbar) 스위치를 갖는 단일 경로로 되어 있는 4개의 물리적 경로를수용할 수 있다. 제안된 경로 지정 엔진은 Xilinx 4000XL 시리즈 FPGA를 사용하여 구현되었다.