Multicast and quality of service provisioning in parallel shared memory switches

Access Full Text

Multicast and quality of service provisioning in parallel shared memory switches

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© The Institution of Engineering and Technology
Published

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.

Inspec keywords: telecommunication network routing; parallel memories; multicast communication; quality of service; queueing theory; telecommunication traffic; distributed shared memory systems; DiffServ networks; telecommunication switching; multimedia communication

Other keywords: quality of service provisioning; differentiated service; memory management; parallel shared memory switches; output-queued switches; memory unit; Internet multimedia; PSM architecture; high-memory bandwidth requirement; multicast traffic; router; parallel shared memory architecture

Subjects: Storage system design; Computer communications; Multimedia; Communication network design, planning and routing; Parallel architecture; Memory circuits; Multimedia communications; Communication switching; Other computer networks; Queueing systems

References

    1. 1)
      • C.-S. Chang , D.-S. Lee , C.-Y. Yue . Providing guaranteed rate services in the load balanced Birkhoff–von Neumann switches. IEEE/ACM Trans. Netw. , 644 - 656
    2. 2)
      • C.-S. Chang , D.-S. Lee , C.-M. Lien . Load balanced Birkhoff–von Neumann switches, part II: multi-stage buffering. Comput. Commun. , 6 , 623 - 634
    3. 3)
    4. 4)
      • Prakash, A., Sharif, S., Aziz, A.: `An o(log2 ', IEEE INFOCOM 2002, 2002.
    5. 5)
      • Prabhakar, B., McKeown, N.: `On the speedup required for combined input and output queued switching', CSL-TR-97-738, Technical, 1997.
    6. 6)
      • N. McKeown . The iSLIP scheduling algorithm for input-queued switches. IEEE/ACM Trans. Netw. , 188 - 201
    7. 7)
      • Prakash, A., Aziz, A., Ramachandra, V.: `Randomized parallel schedulers for switch–memory–switch routers: analysis and numerical studies', IEEE INFOCOM 2004, 2004.
    8. 8)
      • Minkenberg, C.: `Integrating unicast and multicast traffic scheduling in a combined input- and output-queued packet-switching system', Proc. Ninth Int. Conf on. Computer Communications and Networks, 2000, Las Vegas, NV, USA, p. 127–134.
    9. 9)
      • Iyer, S., Zhang, R., McKeown, N.: `Routers with a single stage of buffering', Proc. 2002 SIGCOMM Conf., 2002, 32, p. 251–264.
    10. 10)
      • C.-S. Chang , D.-S. Lee , Y.-S. Jou . Load balanced Birkhoff–von Neumann switches, Part I: one-stage buffering. Comput. Commun. , 6 , 611 - 622
    11. 11)
      • M.A. Marsan , A. Bianco , P. Giaccone , E. Leonardi , F. Neri . Multicast traffic in input-queued switches: optimal scheduling and maximum throughput. IEEE/ACM Trans. Netw. , 465 - 477
    12. 12)
      • Nong, G., Hamdi, M.: `Providing qos guarantees for unicast/multicast traffic withfixed/variable-length packets in multiple input-queued switches', Proc. Sixth IEEE Symp. on Computers and Communications, 2001, Hammamet, Tunisia, p. 166–171.
    13. 13)
      • Lee, J., Sohn, J., Lee, M.: `Design of a shared multi-buffer ATM switch with enhanced throughputin multicast environments', IEEE Proceedings ATM Workshop, 1999, 1999, Kochi, Japan, p. 455–461.
    14. 14)
      • Aziz, A., Prakash, A., Ramachandra, V.: `A near optimal scheduler for switch–memory–switch routers', Proc. Fifteenth Annual ACM Symp. on Parallel Algorithms and Architectures, July 2003, p. 343–352.
    15. 15)
      • A.K. Parekh , R.G. Gallager . A generalized processor sharing approach to flow control inintegrated services networks: the single-node case. IEEE/ACM Trans. Netw. , 344 - 357
    16. 16)
      • Matthews, B., Elhanany, I., Tabatabaee, V.: `Fabric on a Chip: Towards consolidating packet switching functions on silicon', Proc. IEEE Int. Conf. on Communications (ICC), June 2006.
    17. 17)
      • S. Iyer , N. McKeown . On the speedup required for a multicast parallel packet switch. IEEE Commun. Lett. , 269 - 271
    18. 18)
      • Tamir, Y., Frazier, G.: `Higher performance multiqueue buffers for vlsi communication switches', 15thAnnual Symp. on Computer Architecture, 1988, p. 343–354.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2009.0609
Loading

Related content

content/journals/10.1049/iet-com.2009.0609
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading