skip to main content
10.1145/1644993.1645023acmotherconferencesArticle/Chapter ViewAbstractPublication PagesichitConference Proceedingsconference-collections
research-article

An implementation of the CQS supporting multimedia traffic

Published:27 August 2009Publication History

ABSTRACT

In this paper, we propose a CQS (Calendar Queue Scheduler) architecture which was designed for processing multimedia and timing traffic in home network. With various characteristics of the increased traffic flowed in home such as VoIP, VOD, IPTV, and Best-efforts traffic, the needs of managing QoS (Quality of Service) are being discussed. Making a group regarding application or service is effective to guarantee successful QoS under the restricted circumstances. The proposed design is aimed for home gateway corresponding to the end points of receiver on end-to-end QoS and eligible for supporting multimedia traffic within restricted network sources and optimizing queue sizes. We present a CQS (Calendar Queue Scheduler) architecture implemented in synthesizable Verilog form. We simulated the area for both each module and each memory. The area for each module is referenced by NAND(2x1) Gate(11.09) when synthesizing with Magnachip 0.18 CMOS libraries through the Synopsys Design Compiler. We verified the portion of memory is 85.38% of the entire CQS. And each memory size is extracted through CACTI 5.3(a unit in mm2). As the day size increases, the increment of the total area increases. According to the increase of the memory's entry, the increment of memory area gradually increases, and defining the day size for 1 year definitely affects the total CQS area. Even though the CQS is eligible for rate control and delay control and it is in pursuit of home gateway corresponding to the end points of receiver on end-to-end QoS, its biggest problem is the increased memory size. In this paper, we discussed design methodology and operation for each module when designing CQS by hardware. Also, its biggest problem on designing CQS is the memory size. We surely know that it is important to define the number of priorities and the day size for 1 year.

References

  1. R. M. Hinden, "IP Next Generation Overview," Commun. ACM, vol. 39, no. 6, 1996, pp. 61--71. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Randy Brown, "Calendar Queues: Daniel Sleator Editor A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem", Communications of the ACM, October 1988 Volume. 31 Number 10 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. SeungHyun Oh and JongSuk Ahn, "Dynamic Calendar Queue"Google ScholarGoogle Scholar
  4. Management Committee Multimedia Communications Forum, Inc., "Final Multimedia Communication Forum (MMCF) Document", 1995.Google ScholarGoogle Scholar
  5. Aggelos Ioannou_ Member, IEEE, and Manolis Katevenis_, member, IEEE, "Pipelined Heap (Priority Queue) Management for Advanced Scheduling in High-Speed NetworksGoogle ScholarGoogle Scholar

Index Terms

  1. An implementation of the CQS supporting multimedia traffic

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Other conferences
              ICHIT '09: Proceedings of the 2009 International Conference on Hybrid Information Technology
              August 2009
              687 pages
              ISBN:9781605586625
              DOI:10.1145/1644993

              Copyright © 2009 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 27 August 2009

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • research-article
            • Article Metrics

              • Downloads (Last 12 months)0
              • Downloads (Last 6 weeks)0

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader