Skip to main content

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

  • Conference paper
Convergence and Hybrid Information Technology (ICHIT 2011)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6935))

Included in the following conference series:

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Park, S.-H.: The latest trends in technology of MOST. EIC, KERI (2008)

    Google Scholar 

  2. Bishop, R.: Intelligent vehicle applications worldwide. IEEE Intelligent Systems and Their Applications 15(1), 78–81 (2000)

    Article  Google Scholar 

  3. Grzemba, A.: MOST Book 2 (2011)

    Google Scholar 

  4. MOST cooperation, MOST specification Rev 3.0 (2008)

    Google Scholar 

  5. Bosch, CAN specification version 2.0. Published by Robert Bosch GmbH (September 1991)

    Google Scholar 

  6. Han, J.-S.: A Study On a dynamic Gateway system for CAN(Controller Area Network). Yonsei University (2007)

    Google Scholar 

  7. Semeria, C.: Supporting Differentiated Service Clsses: Queuing Scheduling Disciplines, Juniper Networks, White paper (2000)

    Google Scholar 

  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. Jang, D.-H.: Scheduling Algorithm For Supporting Differentiated Service Classes. Graduate School of Chung-Ang University (2003)

    Google Scholar 

  10. Floyd, S.: Notes on Class Based Queuing: Setting Parameters, Informal notes (September 1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jang, SJ., Jang, JW. (2011). A Study on Dynamic Gateway System for MOST GATEWAY Scheduling Algorithm in MOST25 and MOST150 Networks. In: Lee, G., Howard, D., Ślęzak, D. (eds) Convergence and Hybrid Information Technology. ICHIT 2011. Lecture Notes in Computer Science, vol 6935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24082-9_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24082-9_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24081-2

  • Online ISBN: 978-3-642-24082-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics