-
2
-
-
84967701397
-
The design philosophy of the darpa internet protocols
-
D. D. Clark, "The design philosophy of the darpa internet protocols'," in Proc. ACM SIGCOMM'88 Conf., 1988, pp. 106-114.
-
(1988)
Proc. ACM SIGCOMM'88 Conf.
, pp. 106-114
-
-
Clark, D.D.1
-
3
-
-
0003867558
-
-
RFC 1519, Internet Engineering Task Force, Sept.
-
V. Fuller, T. Li, J. Yu, and K. Varadhan, "Classless inter-domain routing (CIDR): An address assignment and aggregation strategy," RFC 1519, Internet Engineering Task Force, Sept. 1993.
-
(1993)
Classless Inter-domain Routing (CIDR): An Address Assignment and Aggregation Strategy
-
-
Fuller, V.1
Li, T.2
Yu, J.3
Varadhan, K.4
-
6
-
-
0022776461
-
Packet trains - Measurement and a new model for computer network traffic
-
Sept.
-
R. Jain and S. A. Routhier, "Packet trains - Measurement and a new model for computer network traffic," IEEE J. Select. Areas Commun., vol. SAC-03, pp. 986-995, Sept. 1986.
-
(1986)
IEEE J. Select. Areas Commun.
, vol.SAC-03
, pp. 986-995
-
-
Jain, R.1
Routhier, S.A.2
-
7
-
-
0030085398
-
Routing on longest-matching prefixes
-
Feb.
-
W. Doeringer, G. Karjoth, and M. Nassehi, "Routing on longest-matching prefixes," IEEE/ACM Trans. Networking, vol. 4, pp. 86-97, Feb. 1996.
-
(1996)
IEEE/ACM Trans. Networking
, vol.4
, pp. 86-97
-
-
Doeringer, W.1
Karjoth, G.2
Nassehi, M.3
-
8
-
-
0032069182
-
Beyond best effort: Router architectures for the differentiated services of tomorrow's internet
-
May
-
V. Kumar, T. V. Lakshman, and D. Stiliadis, "Beyond best effort: Router architectures for the differentiated services of tomorrow's Internet," IEEE Commun. Mag., vol. 36, pp. 152-164, May 1998.
-
(1998)
IEEE Commun. Mag.
, vol.36
, pp. 152-164
-
-
Kumar, V.1
Lakshman, T.V.2
Stiliadis, D.3
-
10
-
-
0030609294
-
Small forwarding tables for fast routing lookups
-
Cannes, France
-
M. Degermark, A. Brodnik, S. Carlsson, and S. Pink, "Small forwarding tables for fast routing lookups," in Proc. ACM SIGCOMM'97 Conf., Cannes, France, pp. 3-14.
-
Proc. ACM SIGCOMM'97 Conf.
, pp. 3-14
-
-
Degermark, M.1
Brodnik, A.2
Carlsson, S.3
Pink, S.4
-
11
-
-
0030609298
-
Scalable high speed IP routing lookups
-
Cannes, France
-
M. Waldvogel, G. Varghese, J. Turner, and B. Plattner, "Scalable high speed IP routing lookups," in Proc. ACM SIGCOMM'97 Conf., Cannes, France, pp. 25-35.
-
Proc. ACM SIGCOMM'97 Conf.
, pp. 25-35
-
-
Waldvogel, M.1
Varghese, G.2
Turner, J.3
Plattner, B.4
-
13
-
-
0001847147
-
Fast address lookup for internet routers
-
Stuttgart, Germany, Apr.
-
S. Nilsson and G. Karlsson, "Fast address lookup for Internet routers," in Proc. IFIP 4th Int. Conf. Broadband Communications, Stuttgart, Germany, Apr. 1998, pp. 11-22.
-
(1998)
Proc. IFIP 4th Int. Conf. Broadband Communications
, pp. 11-22
-
-
Nilsson, S.1
Karlsson, G.2
-
16
-
-
0003585440
-
-
Internet Engineering Task Force, Oct. work-in-progress
-
C. Villamizar, R. Chandra, and R. Govindan, "BGP route flap damping," Internet Engineering Task Force, Oct. 1997, work-in-progress.
-
(1997)
BGP Route Flap Damping
-
-
Villamizar, C.1
Chandra, R.2
Govindan, R.3
-
17
-
-
38149018071
-
Patricia - Practical algorithm to retrieve information coded in alphanumeric
-
Oct.
-
D. R. Morrison, "Patricia - Practical algorithm to retrieve information coded in alphanumeric," J. ACM, vol. 15, pp. 515-534, Oct. 1968.
-
(1968)
J. Acm
, vol.15
, pp. 515-534
-
-
Morrison, D.R.1
-
19
-
-
0345412268
-
-
Fore Systems, Tech. Rep., Jan.
-
A. Przygienda, R. Shekhar, and R. Coltun, "Fast IP address lookup using multi-resolution trees," Fore Systems, Tech. Rep., Jan. 1997.
-
(1997)
Fast IP Address Lookup Using Multi-resolution Trees
-
-
Przygienda, A.1
Shekhar, R.2
Coltun, R.3
-
20
-
-
0344550045
-
-
CSELT, Tech. Rep., in publication
-
E. Filippi, V. Innocenti, and V. Vercellone, "Address lookup solutions for gigabit switch/router," CSELT, Tech. Rep., 1998, in publication.
-
(1998)
Address Lookup Solutions for Gigabit Switch/router
-
-
Filippi, E.1
Innocenti, V.2
Vercellone, V.3
-
21
-
-
0004755523
-
Fast address lookups using controlled prefix expansion
-
Madison, WI
-
V. Srinivasan and G. Varghese, "Fast address lookups using controlled prefix expansion," in Proc. ACM Sigmetrics'98 Conf., Madison, WI, pp. 1-11.
-
Proc. ACM Sigmetrics'98 Conf.
, pp. 1-11
-
-
Srinivasan, V.1
Varghese, G.2
-
22
-
-
85031086563
-
Efficient suffix trees on secondary storage (extended abstract)
-
Atlanta, GA
-
D. R. Clark and J. I. Munro, "Efficient suffix trees on secondary storage (extended abstract)," in Proc. 7th Ann. ACM/SIAM Symp. on Discrete Algorithms, Atlanta, GA, 1996, pp. 383-391.
-
(1996)
Proc. 7th Ann. ACM/SIAM Symp. on Discrete Algorithms
, pp. 383-391
-
-
Clark, D.R.1
Munro, J.I.2
-
23
-
-
0031701316
-
IP lookups using multiway and multicolumn search
-
San Francisco, CA
-
B. Lampson, V. Srinivasan, and G. Varghese, "IP lookups using multiway and multicolumn search," in Proc. IEEE INFOCOM'98 Conf., San Francisco, CA, pp. 1247-1256.
-
Proc. IEEE INFOCOM'98 Conf.
, pp. 1247-1256
-
-
Lampson, B.1
Srinivasan, V.2
Varghese, G.3
-
24
-
-
0004190201
-
-
Philadelphia, PA: Society for Industrial and Applied Mathematics
-
R. Tarjan, Data Structures and Network Algorithms. Philadelphia, PA: Society for Industrial and Applied Mathematics, 1983.
-
(1983)
Data Structures and Network Algorithms
-
-
Tarjan, R.1
-
26
-
-
0023827335
-
Improving gateway performance with a routing table cache
-
New Orleans, LA
-
D. Feldmeier, "Improving gateway performance with a routing table cache," in Proc. IEEE INFOCOM'88 Conf., New Orleans, LA.
-
Proc. IEEE INFOCOM'88 Conf.
-
-
Feldmeier, D.1
-
27
-
-
0026748024
-
Putting routing tables in silicon
-
Jan.
-
T.-B. Pei and C. Zukowski, "Putting routing tables in silicon," IEEE Network Mag., pp. 42-50, Jan. 1992.
-
(1992)
IEEE Network Mag.
, pp. 42-50
-
-
T-B, P.1
Zukowski, C.2
-
32
-
-
84938015047
-
A method for the construction of minimum-redundancy codes
-
D. A. Huffman, "A method for the construction of minimum-redundancy codes," in Proc. the IRE, vol. 40, no. 9, pp. 1098-1101, 1952.
-
(1952)
Proc. the IRE
, vol.40
, Issue.9
, pp. 1098-1101
-
-
Huffman, D.A.1
-
35
-
-
0028312536
-
Shortest paths algorithms: Theory and experimental evaluation
-
Arlington, VA
-
B. V. Cherkassky, A. V. Goldberg, and T. Radzik, "Shortest paths algorithms: Theory and experimental evaluation," in Proc. 5th Ann. ACM SIAM Symp. Discrete Algorithms, Arlington, VA, 1994, pp. 516-525.
-
(1994)
Proc. 5th Ann. ACM SIAM Symp. Discrete Algorithms
, pp. 516-525
-
-
Cherkassky, B.V.1
Goldberg, A.V.2
Radzik, T.3
-
36
-
-
0028407068
-
A generalized processor sharing approach to flow control in integrated services networks: The multiple node case
-
A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiple node case," IEEE/ACM Trans. Networking, vol. 2, pp. 137-150, 1994.
-
(1994)
IEEE/ACM Trans. Networking
, vol.2
, pp. 137-150
-
-
Parekh, A.K.1
Gallager, R.G.2
-
38
-
-
0005363438
-
-
RFC 2073, Internet Engineering Task Force, Jan.
-
Y. Rekhter, P. Lothberg, R. Hinden, S. Deering, and J. Postel, "An IPv6 provider-based unicast address format," RFC 2073, Internet Engineering Task Force, Jan. 1997.
-
(1997)
An Ipv6 Provider-based Unicast Address Format
-
-
Rekhter, Y.1
Lothberg, P.2
Hinden, R.3
Deering, S.4
Postel, J.5
-
39
-
-
0344980997
-
-
RFC 2178, Internet Engineering Task Force, July
-
J. Moy, "OSPFv2," RFC 2178, Internet Engineering Task Force, July 1997.
-
(1997)
OSPFv2
-
-
Moy, J.1
-
41
-
-
25944477943
-
-
IBM, T. J. Watson Research Center, Res. Rep., work-in-progress
-
R. Guérin, A. Orda, and D. Williams, "Establishment and management of QoS routes," IBM, T. J. Watson Research Center, Res. Rep., 1996, work-in-progress.
-
(1996)
Establishment and Management of QoS Routes
-
-
Guérin, R.1
Orda, A.2
Williams, D.3
-
43
-
-
0032069181
-
Issues and trends in router design
-
May
-
S. Keshav and R. Sharma, "Issues and trends in router design," IEEE Commun. Mag., vol. 36, pp. 144-151, May 1998.
-
(1998)
IEEE Commun. Mag.
, vol.36
, pp. 144-151
-
-
Keshav, S.1
Sharma, R.2
|