| Switching Networks: Recent Advances 2001 Edition Contributor(s): Ding-Zhu Du (Editor), Hung Q. Ngo (Editor) |
|
 |
ISBN: 079236953X ISBN-13: 9780792369530 Publisher: Springer OUR PRICE: $104.49 Product Type: Hardcover - Other Formats Published: June 2001 Annotation: This book contains recent developments in switching networks and applications, including classic topics, such as nonblocking and Benes conjecture, and new directions, such as optical switching networks and applications in VLSI designs. It provides the state of the art for researchers in computer networks and applied mathematics. Audience: Researchers in computer networks and applied mathematics. The book is appropriate for use in graduate courses. |
| Additional Information |
| BISAC Categories: - Computers | Computer Science - Mathematics | Applied - Computers | Data Processing |
| Dewey: 004.015 |
| LCCN: 2001029551 |
| Series: Network Theory and Applications |
| Physical Information: 0.94" H x 6.6" W x 9.68" (1.51 lbs) 357 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: The switching net.work is an important. classic research area in t.ele- communication and comput.er net.works. It.s import.ancc st.ems from both theory and practice. In fact, some open problems, such as Benes conjec- ture on shuffle-exchange networks and Chung-Rmis conjecture on multi- rate rearrangeability, still attract many researchers and the further de- velopment in optical networks requires advanced technology in optical switching networks. In 1997, we had a workshop in switching networks held in NSF Sci- ence and Technology Center in Discrete Mathematics and Theoretical Computer Science (DIMACS), at Princeton University. This workshop was very successful. Many participants wished to have a similar activity every two or three years. This book is a result of such a wish. We are putting together SOllle important developments in this area during last. several years, including articles ill fault-tolerance, rearrang{ ability. non- blocking, optical networks. random permutation generat.ioll. and layout complexity. SOlllC of thos( art ides are research papers alld SOIllC an' sur- veys. All articles were reviewed. We would like to uWlItioll two special problems studied in those articles. |