• Title/Summary/Keyword: forwarding time

Search Result 174, Processing Time 0.021 seconds

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.

Implementation of A Multigigabit Lookup Scheme for Optical IP Packet Forwarding (초고속 기가비트급 광 IP 패킷의 포워딩을 위한 새로운 Lookup 장치의 구현)

  • 이정준;홍준혁;강승민;송재원
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.271-274
    • /
    • 2000
  • This paper reports a very fast lookup scheme for Optical IP racket forwarding. A LD by derived Pattern Generartor generate a optical IP Packet encapsulated by any header of level1 and level2. A high speed Lookup scheme for a forwarding has been implemented by EEPLD with tiny SRAMs for optical internetworking. With SRAM of a 10㎱ access time and ~400kB , the Lookup scheme has achieved very high speed lookup time about 100㎱ for 2 memory accesses

  • PDF

Efficient Content Sharing using the Selection of Minimum Forwarding Peers in an Ad Hoc Network (최소의 Forwarding Peer 선택을 통한 애드 혹 네트워크에서의 효율적 콘텐츠 분배 방법)

  • Kang, Seung-Seok
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.4
    • /
    • pp.165-173
    • /
    • 2009
  • Recent portable devices are so versatile that they have multiple communication channels and play several multimedia formats. Especially, many services are under development for users who connect Internet or nearby devices via WWAN (Wireless Wide Area Network) and/or WLAN (Wireless LAN). In case of paying the telecommunication cost proportional to the amount of data downloaded, it is necessary to reduce the cost by constructing a special ad hoc network in which each participating peer downloads a specific portion of the want-to-be-shared content over the payable WWAN channel and exchanges the remaining portion with other peers using the cost-free WLAN channel. If all peers participate in forwarding packets, some transmissions are redundant which results in the unnecessary consumption of bandwidth as well as the delayed content distribution time. In order to reduce the redundant transmission, this paper proposes both the excluding method which discourages some peers not to forward redundant packets, and the minimum cover set method in which only the minimum number of peers are in charge of forwarding packets. These two methods obviate redundant packet forwarding, and result in reduction of content distribution time by up to around 29%.

A Forwarding Scheme for (m,k)-firm Streams Based on Local Decision in Wireless Sensor Networks

  • Li, Bijun;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.6
    • /
    • pp.775-779
    • /
    • 2011
  • As the technology of multimedia sensor networks is desired in large numbers of applications nowadays, real-time service becomes one of the most important research challenges. Even though lots of related works have been conducted to meet this requirement in several ways, the specific traffic model for real-time has not been taken yet. Thus, it causes lack of adaptability of those approaches in real deployment. To solve this problem, in this paper, we model the application via (m,k)-firm streams which have weakly hard real-time property. And then, a novel forwarding scheme based on modified DBP (Distance-Based Priority) is proposed by considering local-DBP and stream DBP together. Local-DBP can contribute to identify the detailed causes of unsatisfied quality, that is, network congestion or wireless link failure. Simulation results reveal that (m,k)-firm is a good traffic model for multimedia sensor networks and the proposed scheme can contribute to guarantee real-time requirement well.

Routing in Vehicular Ad Hoc Networks: Issues and Protocols

  • Shrestha, Raj K.;Moh, Sang-Man;Chung, Il-Yong
    • Korea Multimedia Society
    • /
    • v.12 no.4
    • /
    • pp.28-40
    • /
    • 2008
  • Vehicular ad hoc networks (VANETs) are a practical application class of wireless ad hoc networks, which consist of moving vehicles equipped with radio communication capabilities that collaborate to form a temporary network. This paper addresses issues and protocols of multihop routing in such emerging networks in the context of safety and infotainment applications. Due to the highly dynamic mobility of vehicles, frequent link breakage and short connection time are inevitable and, thus, the routing is a challenging task and interest for many researchers and industrial community. The frequent and dynamic change of topology makes the topology-based routing unreliable but the position-based routing more effective. The position-based routing consists of the location service which maps a node id to a geo-graphical position and the forwarding scheme which selects the next hop based on geo-graphical information of the node, its neighbors and the destination. The routing techniques are further categorized into geographical forwarding, trajectory forwarding and opportunistic forwarding based on the forwarding scheme. In this paper, we first present the distinguished properties of VANETs and the challenges and intractable issues posed in designing the routing protocols, followed by the comprehensive survey of existing routing protocols. Then, the different routing protocols designed for VANETs are compared in terms of characteristics, performance and application domains.

  • PDF

QUEUEING SYSTEMS WITH N-LIMITED NONSTOP FORWARDING

  • LEE, YUTAE
    • East Asian mathematical journal
    • /
    • v.31 no.5
    • /
    • pp.707-716
    • /
    • 2015
  • We consider a queueing system with N-limited nonstop forwarding. In this queueing system, when the server breaks down, up to N customers can be serviced during the repair time. It can be used to model an assembly line consisting of several automatic stations and a manual backup station. Within the framework of $Geo^X/D/1$ queue, the matrix analytic approach is used to obtain the performance of the system. Some numerical examples are provided.

A Study on a Packet Forwarding Scheme based on Interworking Architecture (연동 구조 기반의 패킷 포워딩 기법에 대한 연구)

  • Kim, Seok-Hoon;Ryoo, In-Tae
    • Journal of Internet Computing and Services
    • /
    • v.6 no.3
    • /
    • pp.97-106
    • /
    • 2005
  • Generally, network QoS is determined by timeliness, bandwidth, and reliability, As IT technologies are growing day by day, the bandwidth and reliability factors are expected to be able to satisfy user's requirements. The timeliness factor, however, has not fully met user's requirements yet. In this paper, we propose a packet forwarding scheme named POSIA (Packet forwarding Scheme based on Interworking Architecture) that can provide quite a good QoS (quality of service) by minimizing processing time which is the major part of the timeliness factor. Based on path and resource reservation mechanism, the proposed POSIA makes routers on the packet forwarding path synchronize with each other and then forward packets, The POSIA has been verified to outperform the existing MPLS packet forwarding scheme through computer simulations using OPNET.

  • PDF

An Efficient Routing Scheme Based on Node Density for Underwater Acoustic Sensors Networks

  • Rooh Ullah;Beenish Ayesha Akram;Amna Zafar;Atif Saeed;Sultan H. Almotiri;Mohammed A. Al Ghamdi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.5
    • /
    • pp.1390-1411
    • /
    • 2024
  • Underwater Wireless Sensors Networks (UWSNs) are deployed in remotely monitored environment such as water level monitoring, ocean current identification, oil detection, habitat monitoring and numerous military applications. Providing scalable and efficient routing is very challenging in UWSNs due to the harsh underwater environment. The biggest difficulties are the nodes inherent movement due to water current, long delay in data transmission, low bandwidth of the acoustic signal, high error rate and energy scarcity in battery powered nodes. Many routing protocols have been proposed to solve the aforementioned problems. There are three broad categories of routing protocols namely depth based, energy based and vector-based routing. Vector Based Forwarding protocols perform routing through virtual pipeline by defining their radius which give proper direction to packets communication. We proposed a routing protocol termed as Path-Oriented Energy Scaled Expanded Vector Based Forwarding (PESEVBF). PESEVBF takes into account all parameters; holding time, the source nodes packets routing path and void holes creation on the second hop; PESEVBF not only considers the packet upward advancement but also focus on density of the forwarded nodes in terms of number of potential forwarding and suppressed nodes for path selection. Node selection in resultant holding time is based on minimum Path Factor (PF) value. Moreover, the suppressed node will be selected for packet forwarding to avoid the void holes occurrences on the second hop. Performance of PESEVBF is compared with other routing protocols using matrices such as energy consumption, packet delivery ratio, packets dropping ratio and duplicate packets creation indicating considerable performance improvement.

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.