• Title/Summary/Keyword: Forwarding Scheme

Search Result 214, Processing Time 0.117 seconds

Efficient Resource Slicing Scheme for Optimizing Federated Learning Communications in Software-Defined IoT Networks

  • Tam, Prohim;Math, Sa;Kim, Seokhoon
    • Journal of Internet Computing and Services
    • /
    • v.22 no.5
    • /
    • pp.27-33
    • /
    • 2021
  • With the broad adoption of the Internet of Things (IoT) in a variety of scenarios and application services, management and orchestration entities require upgrading the traditional architecture and develop intelligent models with ultra-reliable methods. In a heterogeneous network environment, mission-critical IoT applications are significant to consider. With erroneous priorities and high failure rates, catastrophic losses in terms of human lives, great business assets, and privacy leakage will occur in emergent scenarios. In this paper, an efficient resource slicing scheme for optimizing federated learning in software-defined IoT (SDIoT) is proposed. The decentralized support vector regression (SVR) based controllers predict the IoT slices via packet inspection data during peak hour central congestion to achieve a time-sensitive condition. In off-peak hour intervals, a centralized deep neural networks (DNN) model is used within computation-intensive aspects on fine-grained slicing and remodified decentralized controller outputs. With known slice and prioritization, federated learning communications iteratively process through the adjusted resources by virtual network functions forwarding graph (VNFFG) descriptor set up in software-defined networking (SDN) and network functions virtualization (NFV) enabled architecture. To demonstrate the theoretical approach, Mininet emulator was conducted to evaluate between reference and proposed schemes by capturing the key Quality of Service (QoS) performance metrics.

An Efficient Network Mobility Handoff Scheme Based on Movement Pattern of a Train (이동예측이 가능한 철도차량의 이동성을 기반으로 한 네트워크 이동성 핸드오프 방안)

  • Lee, Il-Ho;Lee, Jun-Ho
    • Journal of the Korean Society for Railway
    • /
    • v.10 no.6
    • /
    • pp.758-765
    • /
    • 2007
  • In this paper, we propose an efficient seamless handoff scheme to minimize packet loss and unnecessary packets on the Internet using the peculiar mobility characteristics of public vehicles such as trains. MR (Mobile Router) in a train visits each AR (Access Router) in the fixed order. As the MR detects reachability to the NAR (Next Access Router) on the new link, the PAR (Previous Access Router) can directly deliver packets from MR's HA (Home Agent) to the NAR according to the HML (Handoff Mobile router List). Then. the NAR buffers them until the MR finishes L3 (Layer 3) handoff procedure with the NAR. Therefore, our scheme can support a seamless handoff without the packet loss and unnecessary packets on the Internet. The result of our performance evaluation has shown that the proposed scheme could provide excellent performance, compared with the NEMO basic support protocol and the Bi-casting protocol.

A PMIPv6-based Distributed Mobility Control Scheme Considering a User's Movement Locality (사용자 이동 지역성을 고려한 PMIPv6 기반의 분산형 이동성 제어 기법)

  • Kong, Ki-Sik
    • Journal of Digital Contents Society
    • /
    • v.14 no.3
    • /
    • pp.283-290
    • /
    • 2013
  • The current centralized mobility control protocols such as proxy mobile IPv6 (PMIPv6) are dependent on a central mobility anchor to process all control/data traffic. However, such centralized mobility control protocols have some drawbacks such as traffic concentration into the core network and serious service degradation in case of the failure of such a centralized mobility anchor, etc. In this paper, therefore, in order to alleviate these drawbacks, we propose a PMIPv6-based distributed mobility control scheme considering a user's movement locality. Performance evaluation results demonstrate that the proposed scheme has apparent potentials to alleviate serious drawbacks of S-PMIP, which is a closely-related distributed mobility control scheme, as well as PMIPv6, while reducing the total mobility control cost.

Performance Analysis of Relay applied to Energy Harvesting (에너지 하베스팅을 적용한 중계기의 성능 분석)

  • Kim, Tae-Wook;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.5
    • /
    • pp.67-72
    • /
    • 2014
  • In this paper, an energy harvesting scheme is applied in the cooperative communication. The proposed scheme uses an energy harvesting relay in which the relay harvests the energy from the source node and transfers to the power form in forwarding the received data to the destination node. The well-known maximal ratio combining (MRC) technique is applied to increase the diversity gain at the destination. Therefore, with applying the proposed energy harvesting scheme, the limited power at the relay is solved, and the operation efficiency of the network and the mobile devices is improved. Finally, performance of the proposed protocol is analyzed in terms of bit error rate, outage probability, power collection efficiency.

Bit-Map Based Hybrid Fast IP Lookup Technique (비트-맵 기반의 혼합형 고속 IP 검색 기법)

  • Oh Seung-Hyun
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.2
    • /
    • pp.244-254
    • /
    • 2006
  • This paper presents an efficient hybrid technique to compact the trie indexing the huge forward table small enough to be stored into cache for speeding up IP lookup. It combines two techniques, an encoding scheme called bit-map and a controlled-prefix expanding scheme to replace slow memory search with few fast-memory accesses and computations. For compaction, the bit-map represents each index and child pointer with one bit respectively. For example, when one node denotes n bits, the bit-map gives a high compression rate by consumes $2^{n-1}$ bits for $2^n$ index and child link pointers branched out of the node. The controlled-prefix expanding scheme determines the number of address bits represented by all root node of each trie's level. At this time, controlled-prefix scheme use a dynamic programming technique to get a smallest trie memory size with given number of trie's level. This paper proposes standard that can choose suitable trie structure depending on memory size of system and the required IP lookup speed presenting optimal memory size and the lookup speed according to trie level number.

  • PDF

An On-demand Station Location Management scheme using 6-address structure of IEEE 802.11s (IEEE 802.11s 6-Address 구조를 이용한 On-demand 방식 단말 위치 관리기법)

  • Jang, Jeong-Hun;Kong, Jong-Min;Kim, Jong-Deok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.4
    • /
    • pp.829-836
    • /
    • 2013
  • Wireless mesh networks(WMNs) are wireless backbone networks technology consisting of a multi-hop routers. Location management is essential to provide a service to the terminal in WMNs. IEEE 802.11s standards have two basic location management scheme for location management - the proxy registration procedure and the associated station discovery protocol. These basic schemes, however, suffer from serious drawbacks including redundancy control message, ineffective location information maintenance, additional delay time. This paper propose an on-demand station location management scheme using 6-address structure of IEEE 802.11s. Through analysis and experimental evaluation on simulation, we show that proposal scheme reduce control message and forwarding delay time.

Service Mobility Support Scheme in SDN-based Fog Computing Environment (SDN 기반 Fog Computing 환경에서 서비스 이동성 제공 방안)

  • Kyung, Yeun-Woong;Kim, Tae-Kook
    • Journal of Internet of Things and Convergence
    • /
    • v.6 no.3
    • /
    • pp.39-44
    • /
    • 2020
  • In this paper, we propose a SDN-based fog computing service mobility support scheme. Fog computing architecture has been attracted because it enables task offloading services to IoT(Internet of Things) devices which has limited computing and power resources. However, since static as well as mobile IoT devices are candidate service targets for the fog computing service, the efficient task offloading scheme considering the mobility should be required. Especially for the IoT services which need low-latency response, the new connection and task offloading delay with the new fog computing node after handover can occur QoS(Quality of Service) degradation. Therefore, this paper proposes an efficient service mobility support scheme which considers both task migration and flow rule pre-installations. Task migration allows for the service connectivity when the fog computing node needs to be changed. In addition, the flow rule pre-installations into the forwarding nodes along the path after handover enables to reduce the connection delay and service interruption time.

A Study on the Design of Call Forwarding and Rejection Based on SIP UA (SIP UA 기반 착신 전환 및 금지 설계에 대한 연구)

  • Kim, Sun-Joon;Song, Bok-Sub;Kim, Jeong-Ho
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2006.11a
    • /
    • pp.26-30
    • /
    • 2006
  • Internet phone service is a new service technology that provides voice call services through Internet not through the pre-existing PSTN. It enables a cheap voice call service regardless of distance. We may expect that the Internet phone service may substitute for the voice call service through the PSTN, but not in a short period. There are several problems to be solved for this transition, such as, voice call quality, numbering scheme, billing, standardization, and support of several functions. In this paper, we provided and designed a UA (User Agent) that can support functions regarding voice call, such as call forwarding, auto-connection, call rejection and restriction of individual call, using SIP (Session Initiation Protocol) which is proposed by SIP-Working Group as the standard Internet phone service management protocol.

  • PDF

A Study on Smart Network Utilizing the Data Localization for the Internet of Things (사물 인터넷을 위한 데이터 지역화를 제공하는 스마트 네트워크에 관한 연구)

  • Kang, Mi-Young;Nam, Ji-Seung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.6
    • /
    • pp.336-342
    • /
    • 2017
  • Traffic can be localized by reducing the traffic load on the physical network by causing traffic to be generated at the end of the packet network. By localizing traffic, the IoT-based sensitive data-related security issues can be supported effectively. In addition, it can be applied effectively to the next-generation smart network environment without changing the existing network infrastructure. In this paper, a content priority scheme was applied to smart network-based IoT data. The IoT contents were localized to efficiently pinpoint the flow of traffic on the network to enable smart forwarding. In addition, research was conducted to determine the effective network traffic routes through content localization. Through this study, the network load was reduced. In addition, it is a network structure that can guarantee user quality. In addition, it proved that the IoT service can be accommodated effectively in a smart network-based environment.

NetLogo Extension Module for the Active Participatory Simulations with GoGo Board (고고보드를 이용한 능동적 참여 모의실험을 위한 NetLogo 확장 모듈)

  • Xiong, Hong-Yu;So, Won-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11B
    • /
    • pp.1363-1372
    • /
    • 2011
  • Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.