• Title/Summary/Keyword: Forwarding scheme

Search Result 214, Processing Time 0.025 seconds

Tunnel-Free Scheme Using a Routing Table in a PMIPv6-Based Nested NEMO Environment

  • Wie, Sunghong;Jang, Jaeshin
    • Journal of information and communication convergence engineering
    • /
    • v.11 no.2
    • /
    • pp.82-94
    • /
    • 2013
  • In this paper, we propose a novel tunnel-free scheme in a proxy mobile IPv6 (PMIPv6)-based nested network mobility environment; several mobile nodes (MNs) and mobile routers (MRs) compose a hierarchical wireless network topology. Because tunnels created by several MRs overlap and data packets travel along several local mobility anchors (LMAs), the utilization of the wireless section is reduced and the packet forwarding path of the wire-line section is not optimal. In our tunnel-free scheme, the mobile access gateway (MAG) plays an important role in both the wireless and wire-line sections. Using a local binding update, this tunnel-free scheme forwards data packets with a host-based routing table without any tunnel. Establishing a direct tunnel between the MAG and the last LMA, this scheme removes nested tunnels between intermediate LMAs and MRs, and optimizes the forwarding path to the MN in the wire-line section.

A Mobile Multicast Routing Mechanism based on the Comparison of Tree Reconstruction Cost and Tunneling Cost (트리 재구성 비용과 터널링 비용의 비교에 근거한 모바일 멀티캐스트 라우팅 기법)

  • Kim Jae-Soo;Baek Deuk-Hwa
    • Journal of Internet Computing and Services
    • /
    • v.5 no.5
    • /
    • pp.17-26
    • /
    • 2004
  • Mobile multicast schemes are classified into remote subscription and bi-directional tunneling. While the former scheme has much overhead in the maintenances of multicast tree, the latter suffers from inefficient routing. In this paper, we propose dynamic mobile multicast routing (DMMR) scheme, which is operated on the basis of cost functions related with forwarding cost and tree reconstruction cost, Basically DMMR intends to find lower cost between forwarding cost and tree reconstruction cost. Forwarding cost is the cost of tunneling multicast packets from home agent, and tree reconstruction cost is the joining cost of foreign agent to multicast group. In the case that a mobile host moves to the other area, its foreign agent calculates cost functions related with forwarding cost and tree reconstruction cost. If forwarding cost is higher than tree reconstruction cost, foreign agent joins to multicast group and reconstructs the multicast tree. Accordingly, foreign agent can dynamically adapt remote subscription or bi-directional tunneling, Our scheme provides more stable multicast service to the mobile hosts regardless of the movements of mobile host and the number of mobile group members.

  • PDF

DSCP Scheme of Effective Service Class in Multi DiffServ Networks (Multi DiffServ Network에서 효율적인 Service Class의 DSCP 적응 기법)

  • 김태욱;백승원;이동춘
    • Proceedings of the Korea Information Assurance Society Conference
    • /
    • 2004.05a
    • /
    • pp.43-50
    • /
    • 2004
  • Diffserv Network DSCP(Differentiated Service Code Point)는 8bit로 구성되어 있고, 그 중 6bit만 사용되고, 나머지 2bit는 비워져 있는 상태로 있다. 이 2bit를 사용하여, DF(Default Forwarding), EF(Expedited Forwarding), AF(Assured Forwarding)의 DSCP 에 각각의 Service Class Code Point를 부여해서 사용자의 패킷을 구분하여 서비스하는 DiffServ 같은 경우 상용화가 되었을 때, DiffServ를 서비스하는 망에서 동일한 DiffServ 정책을 설정해서 사용할 수 있는 기법을 제안한다.

  • PDF

IP lookup scheme for high speed packet forwarding (고속 패킷(packet) 처리를 위한 IP lookup scheme)

  • 박우종;정민섭;정진우;강성봉
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.213-216
    • /
    • 2000
  • In this paper, we propose a new scheme which improves the IP address lookup time. The new scheme is composed of two core technologies, named the prefix alignment and the prefix distance ordering. Now, as the Internet is being used commonly by improving the data transmission capacity, the need for enlarging the bandwidth of the Internet is on the rise. IP address lookup performance problem is an important obstacle in the router executing high speed packet forwarding. This results from the fact that the prefixes routing table is composed of and the traffic being processed in unit time are largely on the increase. The proposed lookup scheme is divided into two parts in technology, the one is the algorithm forming a routing database(routing table), the other is the lookup procedure in the actual packet processing.

  • PDF

Proxy-AAA Authentication Scheme with Forwarding Mode Supporting in PMIPv6 Networks

  • Han, JeongBae;Jeong, Jongpil;Jo, Jun
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.5 no.2
    • /
    • pp.18-22
    • /
    • 2013
  • Mobile IPv6 (MIPv6) is a host-based protocol supporting global mobility while Proxy Mobile IPv6 (PMIPv6) is a network-based protocol supporting localized mobility. This paper makes its focus on how to reduce the longer delay and extra cost arising from the combination of authentication, authorization and accounting (AAA) and PMIPv6 further. Firstly, a novel authentication scheme (Proxy-AAA) is proposed, which supports fast handover mode and forwarding mode between different local mobility anchors (LMAs). Secondly, a cost analysis model is established based on Proxy-AAA. From the theoretical analysis, it could be noted that the cost is affected by average arrival rate and residence time.

Improving IPTV Forwarding Masechanism in IEEE 802.16j MMR Networks Based on Aggregation

  • Brahmia, Mohamed-El-Amine;Abouaissa, Abdelhafid;Lorenz, Pascal
    • ETRI Journal
    • /
    • v.35 no.2
    • /
    • pp.234-244
    • /
    • 2013
  • Internet protocol television (IPTV) service depends on the network quality of service (QoS) and bandwidth of the broadband service provider. IEEE 802.16j mobile multihop relay Worldwide Interoperability for Microwave Access networks have the opportunity to offer high bandwidth capacity by introducing relay stations. However, to actually satisfy QoS requirements for offering IPTV services (HDTV, SDTV, Web TV, and mobile TV) for heterogeneous users' requests, providers must use a video server for each IPTV service type, which increases the network load, especially bandwidth consumption and forwarding time. In this paper, we present a solution for forwarding IPTV video streaming to diverse subscribers via an 802.16j broadband wireless access network. In particular, we propose a new multicast tree construction and aggregation mechanism based on the unique property of prime numbers. Performance evaluation results show that the proposed scheme reduces both bandwidth consumption and forwarding time.

A Power-based Pipelined-forwarding MAC Protocol for Energy Harvesting Wireless Sensor Networks (에너지 하베스팅 무선 센서네트워크을 위한 전력기반 Pipelined-forwarding MAC프로토콜)

  • Shim, Kyuwook;Park, Hyung-Kun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.1
    • /
    • pp.98-101
    • /
    • 2019
  • In this paper, we propose the power-based pipelined-forwarding MAC protocol which can select relay nodes according to the residual power and energy harvesting rate in EH-WSN (energy-harvesting wireless sensor networks). The proposed MAC follows a pipelined-forwarding scheme in which nodes repeatedly sleep and wake up in an EH-WSN environment and data is continuously transmitted from a high-level node to a low-level node. The sleep interval is adaptively controlled so that nodes with low energy harvesting rate can be charged sufficiently, thereby minimizing the transmission delay and increasing the network lifetime. Simulation shows that the proposed MAC protocol improves the balance of residual power and network lifetime.

Parallel IP Address Lookup using Hashing with Multiple SRAMs (여러 개의 SRAM과 해슁을 이용한 병렬 IP 어드레스 검색에 대한 연구)

  • Seo, Ji-Hyun;Lim, Hye-Sook;Jung, Yeo-Jin;Lee, Seung-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.2B
    • /
    • pp.138-143
    • /
    • 2003
  • One of the important design issues for IP routers responsible for packet forwarding in computer networks is the route-lookup mechanism. For each incoming packet, IP routing requires that a router performs a longest-prefix-match address lookup in order to determine the next hop that the incoming packet should be forwarded to. In this paper, we present a new scheme which applies the hashing function for IP address lookup. In the proposed scheme, the forwarding table is composed of multiple SRAMs, and each SRAM represents an address lookup table in each prefix. Hashing function is applied in order to find out the matching entries from the address lookup tables in parallel, and the entry with the longest prefix match among them is selected. Simulation using the MAE-WEST router example shows that a large routing table with 37000 entries can be compacted to a forwarding table of 300 Kbytes in the proposed scheme. It is also shown that the proposed scheme achieves one route lookup every 1.93 memory accesses in average.

An Adaptive Incentive/Topology Control Scheme for Stimulating Real time Data Forwarding in VANET Environment (VANET 환경에서 실시간 데이터 포워딩 진작을 위한 적응형 인센티브/토폴로지 제어 기법)

  • Bae, Seo-Yun;Kim, Nak-Myeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.7
    • /
    • pp.1-8
    • /
    • 2011
  • Vehicular Ad-hoc Network (VANET) is a special form of Mobile Ad-hoc Network designed to provide communications among nearby vehicles without communications infrastructure. Some characteristics in VANET environment such as high mobility, dynamic topology and selfishness of nodes can cause degradation of network quality. In this paper, we propose an adaptive incentive/topology control scheme to improve network quality in VANET by stimulating real time data forwarding and reporting changes of network topology. In the proposed scheme, an incentive suggested by the source node is updated in real time simultaneously with data transmission to stimulate real time data forwarding. In addition, when the order of the nodes in the path is changed, nodes which report the changes of network topology will get an additional incentive. By computer simulation, it is shown that the proposed incentive/topology control scheme outperforms the conventional schemes with respect to data delivery time and data delivery ratio.

Research on The SWIPT System Throughput Based on Interference Signal Energy Collecting

  • Jianxiong Li;Hailong Jiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.8
    • /
    • pp.2170-2187
    • /
    • 2023
  • The general interference is the imperative trouble for simultaneous wireless information and power transfer (SWIPT) system. Although interference has bad influences on the performance of the system, it carries energy simultaneously. In this paper, the energy-constrained relay of the SWIPT system needs to spend much time on energy collecting (EC) in the information transmission (IT) period. Therefore, we propose the scheme of interference signal energy collecting (ISEC) when the interference is strong, and the SWIPT system does not carry out IT. The relay of the system continues to collect energy and stores it until the interference has minimal impact on IT. Then the system performs IT. We divide the collected interference energy equally into several parts, and each IT block receives one part. The proposed scheme is appealing because it can reduce the time of EC in IT period to make the relay spends more time forwarding the received signal in order to improve the performance of the system throughput. Furthermore, we propose a time-switching (TS) protocol based on EC at the relay. And it allows the relay forwarding signal at an appropriate power. Under the protocol, the time of EC can be flexible according to the forwarding power that we give so that the collected energy can be used more efficiently. We give the expressions of the system throughput according to the proposed scheme and protocol. Moreover, the influence of the interference power on the system throughput is also studied.