VP/VC lookup function
作者： Goran Wicklund
DOI:
关键词:
摘要: A new, efficient approach to ATM connection table lookup minimizes the number of tables and memory lookups through use hash coding binary search techniques. The virtual information associated with an incoming cell is coded. code provides a compressed representation information--allowing address space accessed based on be much smaller than maximum possible combinations that can encoded in header without restricting set combinations. cell's used efficiently select, from plural records code, particular record corresponding connection.
lens.org 参考文章(18)
Henry E. Huey, Michael J. Nishimura, Address handler for an asynchronous transfer mode switch ,(1993)
Hon Wah Chin, Addressing mechanism for multiple look-up tables ,(1997)
John P. Daane, Sanjay M. Desai, Michael D. Rostoker, Anthony Stelliga, Method for hashing in a packet network switching system ,(1995)
Bart Nicholas Locanthi, Joseph Henry Condon, Method and apparatus for storing and retrieving routing information in a network node ,(1995)
Chia Shen, Hugh Lauer, Abhijit Ghosh, Tag-based scheduling system for digital communication switch ,(1994)
Costas Calamvokis, Channel identifier generation ,(1994)
Gordon A. Charles, Processing system with memory arbitrating between memory access requests in a set top box ,(1996)
Bart Joseph Gerard Pauwels, Raymond Didier Albert Wulleman, Yves Therasse, Jozef Albert Octaaf Goubert, Method for reducing the number of bits in a binary word representing a series of addresses ,(1992)
David R. Milway, David J. Greaves, Brian J. Knight, Asynchronous transfer mode switch ,(1996)
T.-B. Pei, C. Zukowski, VLSI implementation of routing tables: tries and CAMs international conference on computer communications. pp. 515- 524 ,(1991) , 10.1109/INFCOM.1991.147548