ndor architectures have been discussed as network-processing platforms. Downloaded from Digital Engineering Library @ McGraw-Hill (www.digitalengineeringlibrary.com) Copyright © 2004 The McGraw-Hill Companies. All rights reserved. Any use is subject to the Terms of Use as given at the website. TRAFFIC MANAGERS 330 NETWORK PROCESSORS SUGGESTED REFERENCES Basic policing, shaping, and scheduling algorithms are covered in classic computer networking text- books. The following is a good recommendation: S. Keshav, "An Engineering Approach to Computer Networking," (Reading, Massachusetts: Addison-Wesley, 1997). Among many sources on MPLS and traffic engineering, the following is a good source: X. Xiao, A. Hannan, B. Bailey, and L. Ni, "Traffic Engineering with MPLS in the Internet," IEEE Network Magazine (March 2000). The following is an informative work about issues encountered in the implementation of solid traf- fic management: Jian-Guo Chen, David Sonnier, Robert Munoz, and Ambalavanar Arulambalam, "Traffic Management in the Agere 10 Gigabits Network Processor," a white paper from Agere Systems, October 2002. In addition to the IETF RFC documents mentioned in the text of the chapter, which can be easily downloaded from the IETF web site, the following are good sources for further information on the subject: Roch Guerin, Sanjay Kamat, Vinod Peris, and Raju Rajan, "Scalable QoS Provision Through Buffer Management," ACM SigComm (1998). A. Ioannou and M. Katevenis, "Pipelined Heap (Priority Queue) Management for Advanced Scheduling in High Speed Networks," Proceedings of the IEEE International Conference on Communications (ICC 2001) Helsinki, Finland (June 2001): 2043-2047. It is available online http://archvlsi.ics.forth.gr/muqpro/heapMgt.html. Anthony Kam and Kai-Yeung Siu, "Linear-Complexity Algorithms for QoS Support in Input Queued Switches with No Speedup," IEEE Journal of Selected Areas in Communications 17, no. 6 (June 1999): 1040-1056. R. LaMaire and D. Serpanos, "Two-Dimensional Round-Robin Schedulers for Pack