TITLE

Multicast and quality of service provisioning in parallel shared memory switches

AUTHOR(S)
Matthews, B.; Arel, I.; Rose, D.; Bollinger, B.
PUB. DATE
September 2010
SOURCE
IET Communications;9/24/2010, Vol. 4 Issue 14, p1665
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Growing demand for differentiated services and the proliferation of Internet multimedia applications requires not only faster switches/routers, but also the inclusion of guaranteed qualities of service (QoSs) and support for multicast traffic. Here, the authors introduce a parallel shared memory (PSM) architecture that addresses these demands by offering both QoS guarantees and support for multicast traffic. It is well known that PSM architectures represent an effective approach for distributing the high-memory bandwidth requirement found in output-queued (OQ) switches, while maintaining their desirable performance attributes. At the core of the PSM architecture is a memory management algorithm that determines, for each arriving packet, the memory unit in which it will be placed. The PSM architecture discussed should be considered with the context of fabric on a chip in mind, where an implementation is conceivable on a single chip, providing a plug-in emulated OQ switching solution. A description and detailed analysis of an efficient memory management algorithm that supports QoS and multicast traffic is given with a discussion of hardware implementation considerations that highlight the PSM architecture's scalability and performance attributes.
ACCESSION #
53784331

 

Related Articles

  • BANDWIDTH ALLOCATION IN MULTICAST TREES WITH QoS CONSTRAINTS. Kodialam, M.; Venkateswaran, V. // International Journal of Information Technology & Decision Makin;Dec2003, Vol. 2 Issue 4, p619 

    Growth in continuous media applications and group communications highlight the need for efficient multicast support. In multicast tree construction and resource reservation a central problem is ensuring that the determined multicast tree can support specified QoS requirements economically. In...

  • A Comprehensive Review of Energy Efficient Content Addressable Memory Circuits for Network Applications. Ali, Syed Iftekhar; Islam, Md Shafiqul; Islam, Mohammad Rakibul // Journal of Circuits, Systems & Computers;Apr2016, Vol. 25 Issue 4, p1 

    Content addressable memory (CAM) can perform high-speed table look-up with bit level masking capability. This feature makes CAMs extremely attractive for high-speed packet forwarding and classification in network routers. High-speed look-up implies all the CAM word entries to be accessed and...

  • Photonic Switches Put the Internet on Steroids. Gaughan, Richard // R&D Magazine;Jan2006, Vol. 48 Issue 1, p30 

    This article focuses on the Optiputer project, a project of the National Science Foundation named for its use of optical networking, Internet protocol, computer storage, processing and visualization technologies, as of January 2006. The intent of the Optiputer project is to employ the latest...

  • ExR: A Scheme for Exact Regeneration of a Failed Node in a Distributed Storage System. Janakiram, Balaji; Kadhe, Swanand; Chandra, M. Girish // Annual International Conference on Advances in Distributed & Par;Nov2010, pR17 

    The flurry of activities in the area of regenerating codes in the past few years have led to different flavors of codes, targeting diverse applications. There are regenerating codes which minimize the repair bandwidth, i.e. the amount of data required to restore the system after a node failure....

  • A New Model for Web Pre-fetching Using Popularity-Based Prediction. Gupta, Neena; Manchanda, Mahesh // Annual International Conference on Advances in Distributed & Par;Nov2010, pR39 

    Due to the fast development of internet services and a huge amount of network traffic, it is becoming an essential issue to reduce World Wide Web user-perceived latency. Although web performance is improved by caching, the benefit of caches is limited. To further reduce the retrieval latency,...

  • Memory requirements for silent stabilization. Dolev, Shlomi; Gouda, Mohamed G.; Schneider, Marco // Acta Informatica;1999, Vol. 36 Issue 6, p447 

    Abstract. A stabilizing algorithm is silent if starting from an arbitrary state it converges to a global state after which the values stored in the communication registers are fixed. Many silent stabilizing algorithms have appeared in the literature. In this paper we show that there cannot exist...

  • Internet boom tests computer users' storage capacity.  // Inside Tucson Business;11/13/95, Vol. 5 Issue 33, p6B 

    Reports on a survey which found growth of Internet use has outstripped higher computer data storage capacity. Downloading of information from the 'net as one of the reasons; Notable facts on Internet use.

  • The Clonal Expansion and Memory Strategy Applied to Network Detection. Yuling Tian // Journal of Software (1796217X);Apr2014, Vol. 9 Issue 4, p785 

    The dynamic tendency of network environment determines that system can achieve an accurate fault diagnosis only by self-learning. Inspired by characters of artificial immune and adaptability of dynamic clonal selection algorithm for dynamic environment, an immune algorithm applied to network...

  • eBay keeps up with evolving storage demands. R. F. // Storage Magazine;Jul2007, Vol. 6 Issue 5, p15 

    The article describes the computer storage networks maintained and used by eBay for its online transactions. According to William Crosby-Lundin, storage attached network (SAN) and high-availability infrastructure manager of eBay, only 12 people manage eBay's storage consisting of 13 SAN that...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics