Smoothing and multiplexing protocol for computer networks

被引:0
|
作者
Bembaron, YA [1 ]
Hadar, O [1 ]
机构
[1] Ben Gurion Univ Negev, Dept Elect & Comp Engn, IL-84105 Beer Sheva, Israel
关键词
video-on-demand; FRED; join-the-shortest-queue; bandwidth utilization; quality-of-service; smoothing; multiplexing;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Video-on-Demand (VoD) Servers normally store MPEG compressed versions of prerecorded videos in order to reduce their network bandwidth demands. Compressed videos have variable-bit-rate (VBR) for a specific compression quality. Transmission of videos on the network at a peak rate results in poor bandwidth utilization, while transmission at a lower rate results in quality-of-service (QoS) degradation. Implementation of a traffic smoothing on the VBR strewn, using a buffer at the client receiver, is a widely known approach to overcome the rate variability problem. This paper presents a novel smoothing and multiplexing protocol for prerecorded videos that constructs a lossless and constant-bit-rate (CBR) transmission plan. This protocol, named FRarnes-Ensured-Delivery (FRED), achieves perfect QoS, and also provides ideal bandwidth utilization without any frame loss. According to the proposed protocol, the server rate can be changed to explore its affect on the startup latency and the client's buffer size requirements. Simulation results are provided. We compare FRED protocol to a published work called Join-the-Shortest-Queue (JSQ) and show that FRED protocol results, in better transmission plan than JSQ regarded to QoS and network utilization. An improved FRED protocol, called Lossy-FRED, is presented to reduce the startup latency of the protocol down to zero. This feature is required when dealing with real-time or interactive applications. Decreasing the startup latency of FRED causes frame losses.
引用
收藏
页码:115 / 120
页数:6
相关论文
共 50 条
  • [1] Communication protocol analysis of computer networks
    Li, Layuan
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering & Electronics, 1995, 17 (10):
  • [2] PROTOCOL TRAPS IN COMPUTER-NETWORKS - A CATALOG
    LAI, WS
    IEEE TRANSACTIONS ON COMMUNICATIONS, 1982, 30 (06) : 1434 - 1449
  • [3] New hardware protocol architecture for computer networks
    Edris, A
    Field, J
    Guizani, M
    KUWAIT JOURNAL OF SCIENCE & ENGINEERING, 1999, 26 (01): : 1 - 28
  • [4] Multiplexing of individually-smoothed video streams over computer networks
    Hadar, O
    Greenberg, S
    Segal, M
    Stone, R
    Kazir, A
    INTERNET MULTIMEDIA MANAGEMENT SYSTEMS II, 2001, 4519 : 148 - 158
  • [5] An adaptive transmission protocol for exploiting diversity and multiplexing gains in wireless relaying networks
    Mohammed Taha O El Astal
    Ammar M Abu-Hudrouss
    Brian P Salmon
    Jan Corné Olivier
    EURASIP Journal on Wireless Communications and Networking, 2015
  • [6] Application of APCMA protocol to power packet networks for multiplexing power packet transmissions
    Tanaka, Chiemi
    Peper, Ferdinand
    Hasegawa, Mikio
    IEICE NONLINEAR THEORY AND ITS APPLICATIONS, 2020, 11 (04): : 433 - 445
  • [7] An adaptive transmission protocol for exploiting diversity and multiplexing gains in wireless relaying networks
    El Astal, Mohammed Taha O.
    Abu-Hudrouss, Ammar M.
    Salmon, Brian P.
    Olivier, Jan Corne
    EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING, 2015, : 1 - 15
  • [8] SMOOTHING COMPUTER PATH
    FOSTER, D
    DATA PROCESSING, 1978, 20 (05): : 10 - &
  • [9] A New Secure Anonymous Protocol for Distributed Computer Networks
    Cui Hui
    Cao Tianjie
    THIRD INTERNATIONAL SYMPOSIUM ON ELECTRONIC COMMERCE AND SECURITY WORKSHOPS (ISECS 2010), 2010, : 197 - 201
  • [10] Dynamic routing protocol for computer networks with clustering topology
    Wuhan Transportation Univ, China
    J Syst Eng Electron, 1 (44-53):