A Study on Dynamic Gateway System for MOST GATEWAY Scheduling Algorithm in MOST25 and MOST150 Networks

  • Seong-Jin Jang
  • Jong-Wook Jang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6935)


In recent years, the driver needs the convenience of their vehicles and that there is an increasing requirement. Many researches have been mainly focused on MOST Networks to provide quality of multimedia service. The MOST network has different protocols, such as MOST25, MOST50, and MOST150, requiring gateways to send and receive information. In the case of isochronous and Ethernet channel data that can be supported only with MOST150, when data is transmitted from MOST150 to MOST25, it cannot be treated by MOST25, leading to data loss and transmission delays. Thus, this study proposes a MOST gateway system to connect the MOST25 and MOST150 networks to form a single network. It aims to use the simulation tool NS-2, to analyze the FIFO, FQ, WRR, CBQ scheduling algorithm performance between the MOST25 and MOST150 networks, and to consequently propose scheduling algorithm improvement measures suitable to cars.


MOST MOST 150 MOT Gateway Gateway Scheduling Algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Park, S.-H.: The latest trends in technology of MOST. EIC, KERI (2008)Google Scholar
  2. 2.
    Bishop, R.: Intelligent vehicle applications worldwide. IEEE Intelligent Systems and Their Applications 15(1), 78–81 (2000)CrossRefGoogle Scholar
  3. 3.
    Grzemba, A.: MOST Book 2 (2011)Google Scholar
  4. 4.
    MOST cooperation, MOST specification Rev 3.0 (2008)Google Scholar
  5. 5.
    Bosch, CAN specification version 2.0. Published by Robert Bosch GmbH (September 1991) Google Scholar
  6. 6.
    Han, J.-S.: A Study On a dynamic Gateway system for CAN(Controller Area Network). Yonsei University (2007)Google Scholar
  7. 7.
    Semeria, C.: Supporting Differentiated Service Clsses: Queuing Scheduling Disciplines, Juniper Networks, White paper (2000)Google Scholar
  8. 8.
    Ito, Y., Tasaka, S., Ishibashi, Y.: Variably weighted round robin queuing for core IP routers. In: 21st IEEE International Performance, Computing, and Communications Conference, April 3-5 (2002)Google Scholar
  9. 9.
    Jang, D.-H.: Scheduling Algorithm For Supporting Differentiated Service Classes. Graduate School of Chung-Ang University (2003)Google Scholar
  10. 10.
    Floyd, S.: Notes on Class Based Queuing: Setting Parameters, Informal notes (September 1995)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Seong-Jin Jang
    • 1
  • Jong-Wook Jang
    • 1
  1. 1.Department of Computer EngineeringDong-Eui UniversityBusanRepublic of Korea

Personalised recommendations