乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:10:57Z","timestamp":1725725457482},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[1999,8,30]]},"DOI":"10.1145\/316188.316223","type":"proceedings-article","created":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T19:25:58Z","timestamp":1069788358000},"page":"203-214","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Routing with a clue"],"prefix":"10.1145","author":[{"given":"Anat","family":"Bremler-Barr","sequence":"first","affiliation":[{"name":"Computer Science Department, Tel-Aviv University, Tel-Aviv 69978, Israel"}]},{"given":"Yehuda","family":"Afek","sequence":"additional","affiliation":[{"name":"Computer Science Department, Tel-Aviv University, Tel-Aviv 69978, Israel"}]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[{"name":"Computer Science Department, Tel-Aviv University, Tel-Aviv 69978, Israel"}]}],"member":"320","published-online":{"date-parts":[[1999,8,30]]},"reference":[{"key":"e_1_3_2_1_1_2","volume-title":"IETF","author":"CALLON R.","year":"1997","unstructured":"CALLON , R. , DOOLAN p P., N. FELDMAN , FRED ETTE , A.~ AND O. Sw ALLOW. A framwork for multiprotoco} label switching. Tech. rep ., IETF , November 1997 . draft-iet~-mplsframework-02.txt. CALLON, R., DOOLANp P., N.FELDMAN, FREDETTE, A.~ AND O.SwALLOW. A framwork for multiprotoco} label switching. Tech. rep., IETF, November 1997. draft-iet~-mplsframework-02.txt."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_2","DOI":"10.1109\/90.490742"},{"key":"e_1_3_2_1_3_2","volume-title":"Proc. INFOCOM 99 (March","author":"CHEUNG G.","year":"1999","unstructured":"CHEUNG , G. , AND MCCANN~ ., S. Optimal routing table design for ip adress lookups under memory constraints . In Proc. INFOCOM 99 (March 1999 ). CHEUNG, G., AND MCCANN~., S. Optimal routing table design for ip adress lookups under memory constraints. In Proc. INFOCOM 99 (March 1999)."},{"key":"e_1_3_2_1_4_2","volume-title":"Proc. INFOCOM 99 (March","author":"UP H, T","year":"1999","unstructured":"Cro UP . H, T . C., AND PRADHAN , P. High performance ip routing table lookup using cpu caching . In Proc. INFOCOM 99 (March 1999 ). CroUP. H, T. C., AND PRADHAN, P. High performance ip routing table lookup using cpu caching. In Proc. INFOCOM 99 (March 1999)."},{"key":"e_1_3_2_1_5_2","volume-title":"Switching in IP Networks","author":"DOOLAN P.","year":"1998","unstructured":"Dxvm, B., DOOLAN , P. , AND REKHTER , Y. Switching in IP Networks . Morgan Kaufmann Publishers Inc ., 1998 . Dxvm, B., DOOLAN, P., AND REKHTER, Y. Switching in IP Networks. Morgan Kaufmann Publishers Inc., 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_2","DOI":"10.1145\/263105.263133"},{"key":"e_1_3_2_1_7_2","volume-title":"IETF","author":"ROSEN A. V.","year":"1999","unstructured":"E.C. ROSEN , A. V. , AND CALLON , R. Multiprotocol label switching architecture. Tech. rep ., IETF , 1999 . draft-ietfmpls-arch-05.txt. E.C. ROSEN, A. V., AND CALLON, R. Multiprotocol label switching architecture. Tech. rep., IETF, 1999. draft-ietfmpls-arch-05.txt."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_2","DOI":"10.1109\/INFCOM.1998.662938"},{"key":"e_1_3_2_1_9_2","volume-title":"Internet Routing Architectures","author":"HALABI B.","year":"1997","unstructured":"HALABI , B. Internet Routing Architectures . New Riders Publishing , Cisco Press , 1997 . HALABI, B. Internet Routing Architectures. New Riders Publishing, Cisco Press, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_2","DOI":"10.1145\/285237.285283"},{"key":"e_1_3_2_1_11_2","volume-title":"Proc. INFOCOM 98 (March","author":"LAMPSON B.","year":"1998","unstructured":"LAMPSON , B. , SRINIVASAN , V. , AND VARGHESE , G. Ip lookups using multiway and multicolumm search . In Proc. INFOCOM 98 (March 1998 ). LAMPSON, B., SRINIVASAN, V., AND VARGHESE, G. Ip lookups using multiway and multicolumm search. In Proc. INFOCOM 98 (March 1998)."},{"key":"e_1_3_2_1_12_2","first-page":"1382","volume-title":"Proc. INFOCOM (March-April","author":"B~ A.","year":"1993","unstructured":"McAuI, B~ , A. , AND FRANCIS , P. Fast routing table lookup using cams . In Proc. INFOCOM (March-April 1993 ), pp. 1382 - 1391 . McAuI, B~, A., AND FRANCIS, P. Fast routing table lookup using cams. In Proc. INFOCOM (March-April 1993), pp. 1382-1391."},{"key":"e_1_3_2_1_13_2","volume-title":"Proc. ${GCOMM 95 (January","author":"B~ A. J.","year":"1995","unstructured":"McAur. B~ , A. J. , TSUCH rir A, P . F., AND Wm SON , D. V. Fast multilevel hierachical routing table using contentaddressable memory . In Proc. ${GCOMM 95 (January 1995 ). U.S. Patent serial number 034444. Assignee Bell Communications research Inc Livingston NJ. McAur. B~, A. J., TSUCHrirA, P. F., AND WmSON, D. V. Fast multilevel hierachical routing table using contentaddressable memory. In Proc. ${GCOMM 95 (January 1995). U.S. Patent serial number 034444. Assignee Bell Communications research Inc Livingston NJ."},{"unstructured":"Ipma statistics http:\/\/nic.merit.edu\/ipma. Ipma statistics http:\/\/nic.merit.edu\/ipma.","key":"e_1_3_2_1_14_2"},{"key":"e_1_3_2_1_15_2","volume-title":"Proc. INFOCOM 99 (March","author":"HUANG S. M.","year":"1999","unstructured":"N. F. HUANG , S. M. ZHAO , J. Y. P., AND SU , C. A. A fast ip routing lookup scheme for gigabit switching routers . In Proc. INFOCOM 99 (March 1999 ). N. F. HUANG, S. M. ZHAO, J. Y. P., AND SU, C. A. A fast ip routing lookup scheme for gigabit switching routers. In Proc. INFOCOM 99 (March 1999)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_2","DOI":"10.1109\/35.568212"},{"key":"e_1_3_2_1_17_2","volume-title":"Proc. IEEE Broadband Comraunications 98 (April","author":"N~LSSON S.","year":"1998","unstructured":"N~LSSON , S. , , ND K ,n LSSON , G. Fast address look-up for internet routers . In Proc. IEEE Broadband Comraunications 98 (April 1998 ). N~LSSON, S., ,ND K,nLSSON, G. Fast address look-up for internet routers. In Proc. IEEE Broadband Comraunications 98 (April 1998)."},{"volume-title":"NFS Workshop on Internet Statistics Measurement and Analysis.","author":"PART~DG~","unstructured":"PART~DG~ ., C. Locality and route caches, February 1996 . NFS Workshop on Internet Statistics Measurement and Analysis. PART~DG~., C. Locality and route caches, February 1996. NFS Workshop on Internet Statistics Measurement and Analysis.","key":"e_1_3_2_1_18_2"},{"key":"e_1_3_2_1_19_2","first-page":"1992","author":"PERLMAN R.","year":"1992","unstructured":"PERLMAN , R. Interconnections , Bridges and Routers. Addlson-Wesley , 1992 , 1992 . PERLMAN, R. Interconnections, Bridges and Routers. Addlson-Wesley, 1992, 1992.","journal-title":"Bridges and Routers. Addlson-Wesley"},{"key":"e_1_3_2_1_20_2","volume-title":"Proc. INFOCOM 99 (March","author":"D.","year":"1999","unstructured":"R. P. DrtAv~.s, C. KtNa, S. V., AND Zmr., B. D. Constructing optimal ip routing tables . In Proc. INFOCOM 99 (March 1999 ). R. P. DrtAv~.s, C. KtNa, S. V., AND Zmr., B. D. Constructing optimal ip routing tables. In Proc. INFOCOM 99 (March 1999)."},{"key":"e_1_3_2_1_21_2","volume-title":"IETF","author":"RBKHT~R Y.","year":"1996","unstructured":"RBKHT~R , Y. , DA vm, B., KATZ , D. , ROS~N , E. , SWALLOW , G. , AND FA mN ACCI , D. Tag switching architecture overview. Tech. rep ., IETF , 1996 . ftp:\/\/ds.internic.net\/internetdrafts\/draft-rfced-info-rekhter-00.txt. RBKHT~R, Y., DAvm, B., KATZ, D., ROS~N, E., SWALLOW, G., AND FAmNACCI, D. Tag switching architecture overview. Tech. rep., IETF, 1996. ftp:\/\/ds.internic.net\/internetdrafts\/draft-rfced-info-rekhter-00.txt."},{"key":"e_1_3_2_1_22_2","volume-title":"The Design and implementation of the 4.$BSD UNIX","author":"L~ Fr","year":"1988","unstructured":"S. L~ .F Fr , BR , M. McKu SICK , M. K. , AND QUARTERMAN , J. The Design and implementation of the 4.$BSD UNIX . Addison-Wesley , 1988 . S. L~.FFr, BR, M. McKuSICK, M. K., AND QUARTERMAN, J. The Design and implementation of the 4.$BSD UNIX. Addison-Wesley, 1988."},{"key":"e_1_3_2_1_23_2","volume-title":"A tree-based routing table for berkeley unix. Tech. rep","author":"SKLOW","year":"1992","unstructured":"SKLOW gn, K. A tree-based routing table for berkeley unix. Tech. rep ., 1992 . SKLOWgn, K. A tree-based routing table for berkeley unix. Tech. rep., 1992."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_2","DOI":"10.1145\/277851.277863"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_2","DOI":"10.1145\/285237.285282"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_2","DOI":"10.1145\/263105.263136"}],"event":{"sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"acronym":"SIGCOMM99","name":"SIGCOMM99: ACM SIGCOMM 99 - Applications, Technologies, Architectures,and Protocols forComputer Communication","location":"Cambridge Massachusetts USA"},"container-title":["Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/316188.316223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:31:37Z","timestamp":1693855897000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/316188.316223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8,30]]},"references-count":26,"alternative-id":["10.1145\/316188.316223","10.1145\/316188"],"URL":"https:\/\/doi.org\/10.1145\/316188.316223","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/316194.316223","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[1999,8,30]]},"assertion":[{"value":"1999-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}