Putting routing tables in silicon
暂无分享,去创建一个
[1] Charles G. Sodini,et al. Dynamic cross-coupled bitline content addressable memory cell for high density arrays , 1985 .
[2] Douglas Comer,et al. Analysis of a heuristic for full trie minimization , 1981, TODS.
[3] J.P. Wade,et al. Dynamic cross-coupled bitline content addressable memory cell for high density arrays , 1987, 1985 International Electron Devices Meeting.
[4] Jeffrey C. Mogul. Network locality at the scale of processes , 1991, SIGCOMM 1991.
[5] Edward Fredkin,et al. Trie memory , 1960, Commun. ACM.
[6] Mischa Schwartz,et al. Telecommunication networks: protocols, modeling and analysis , 1986 .
[7] Kurt Maly. Compressed tries , 1976, CACM.
[8] U. Killat. ATM and its challenges to VLSI , 1989, Proceedings. VLSI and Computer Peripherals. COMPEURO 89.
[9] Jonathan S. Turner,et al. Design of an integrated services packet network , 1985, SIGCOMM '85.
[10] Douglas Comer,et al. Complexity of trie index construction , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[11] C MogulJeffrey. Network locality at the scale of processes , 1992 .
[12] Jeffrey C. Mogul,et al. Network locality at the scale of processes , 1991, SIGCOMM '91.
[13] D. C. Feldmeier,et al. Improving gateway performance with a routing-table cache , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.