-
1
-
-
0037298256
-
Chord: A scalable peer-to-peer lookup protocol for internet applications
-
Feb.
-
I. Stoica, R. Morris, D. Liben-Nowell, M. R. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A scalable peer-to-peer lookup protocol for internet applications," IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 17-32, Feb. 2003.
-
(2003)
IEEE/ACM Trans. Netw.
, vol.11
, Issue.1
, pp. 17-32
-
-
Stoica, I.1
Morris, R.2
Liben-Nowell, D.3
Kaashoek, M.R.4
Dabek, F.5
Balakrishnan, H.6
-
2
-
-
0003007594
-
Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems
-
Nov.
-
A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Proc. IFIP/ACM Middleware, Nov. 2001.
-
(2001)
Proc. IFIP/ACM Middleware
-
-
Rowstron, A.1
Druschel, P.2
-
3
-
-
0034445565
-
A case for end system multicast
-
Y. Chu, S. G. Rao, S. Seshan, and H. Zhang, "A case for end system multicast," in Proc. ACM SIGMETRICS, 2000, pp. 1-12.
-
(2000)
Proc. ACM SIGMETRICS
, pp. 1-12
-
-
Chu, Y.1
Rao, S.G.2
Seshan, S.3
Zhang, H.4
-
4
-
-
3242729988
-
Incentives for cooperation in peer-to-peer networks
-
Jun.
-
K. Lai, M. Feldman, I. Stoica, and J. Chuang, "Incentives for cooperation in peer-to-peer networks," in Proc. Workshop on Economics of Peer-to-Peer Syst., Jun. 2003.
-
(2003)
Proc. Workshop on Economics of Peer-to-Peer Syst.
-
-
Lai, K.1
Feldman, M.2
Stoica, I.3
Chuang, J.4
-
5
-
-
2642533950
-
Incentives for sharing in peer-to-peer networks
-
P. Golle, K. L. Brown, I. Mironov, and M. Lillibridge, "Incentives for sharing in peer-to-peer networks," in Proc. 2nd Int. Workshop Electron. Commerce, 2001.
-
(2001)
Proc. 2nd Int. Workshop Electron. Commerce
-
-
Golle, P.1
Brown, K.L.2
Mironov, I.3
Lillibridge, M.4
-
6
-
-
0038183237
-
How bad is selfish routing
-
T. Roughgarden and É. Tardos, "How bad is selfish routing?," J. ACM, vol. 49, no. 2, pp. 236-259, 2002.
-
(2002)
J. ACM
, vol.49
, Issue.2
, pp. 236-259
-
-
Roughgarden, T.1
Tardos, É.2
-
7
-
-
0042941501
-
Bandwidth allocation in ad hoc networks: A price-based approach
-
Y. Qiu and P. Marbach, "Bandwidth allocation in ad hoc networks: A price-based approach," in Proc. IEEE INFOCOM, 2003, pp. 797-807.
-
(2003)
Proc. IEEE INFOCOM
, pp. 797-807
-
-
Qiu, Y.1
Marbach, P.2
-
8
-
-
65349150208
-
Optimal resource allocation in overlay multicast
-
Y. Cui, Y. Xue, and K. Nahrstedt, "Optimal resource allocation in overlay multicast," in Proc. 11th IEEE Int. Conf. Netw. Protocols, 2003, pp. 71-81.
-
(2003)
Proc. 11th IEEE Int. Conf. Netw. Protocols
, pp. 71-81
-
-
Cui, Y.1
Xue, Y.2
Nahrstedt, K.3
-
9
-
-
0029376115
-
Fundamental design issues for the future Internet
-
Sep.
-
S. Shenker, "Fundamental design issues for the future Internet," IEEE J. Sel. Areas Commun., vol. 13, no. 7, pp. 1176-1188, Sep. 1995.
-
(1995)
IEEE J. Sel. Areas Commun.
, vol.13
, Issue.7
, pp. 1176-1188
-
-
Shenker, S.1
-
10
-
-
0032027247
-
Rate control in communication networks: Shadow prices, proportional fairness and stability
-
F. Kelly, A. Maulloo, and D. Tan, "Rate control in communication networks: Shadow prices, proportional fairness and stability," J. Oper. Res. Soc., vol. 49, pp. 237-252, 1998.
-
(1998)
J. Oper. Res. Soc.
, vol.49
, pp. 237-252
-
-
Kelly, F.1
Maulloo, A.2
Tan, D.3
-
11
-
-
21644470909
-
SplitStream: High-bandwidth multicast in cooperative environments
-
M. Castro, P. Druschel, A. M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh, "SplitStream: High-bandwidth multicast in cooperative environments," in Proc. 20th ACM Symp. Oper. Syst. Principles (SOSP), 2003.
-
(2003)
Proc. 20th ACM Symp. Oper. Syst. Principles (SOSP)
-
-
Castro, M.1
Druschel, P.2
Kermarrec, A.M.3
Nandi, A.4
Rowstron, A.5
Singh, A.6
-
12
-
-
21644448224
-
Bullet: High bandwidth data dissemination using an overlay mesh
-
D. Kostic, A. Rodriguez, J. Albrecht, and A. Vahdat, "Bullet: High bandwidth data dissemination using an overlay mesh," in Proc. 20th ACM Symp. Oper. Syst. Princples, 2003.
-
(2003)
Proc. 20th ACM Symp. Oper. Syst. Princples
-
-
Kostic, D.1
Rodriguez, A.2
Albrecht, J.3
Vahdat, A.4
-
13
-
-
84975880325
-
Overcast: Reliable multicasting with an overlay network
-
J. Jannotti, D. K. Gifford, K. L. Johnson, M. F. Kaashoek, and J. W. O'Toole, Jr., "Overcast: Reliable multicasting with an overlay network," in Proc. 4th Symp. Oper. Syst. Design Implementation, 2000.
-
(2000)
Proc. 4th Symp. Oper. Syst. Design Implementation
-
-
Jannotti, J.1
Gifford, D.K.2
Johnson, K.L.3
Kaashoek, M.F.4
O'Toole Jr., J.W.5
-
15
-
-
0038147762
-
An intelligent agent for optimizing QoS-for-money in priced ABR connections
-
C. Courcoubetis, G. D. Stamoulis, C. Manolakis, and F. P. Kelly, "An intelligent agent for optimizing QoS-for-money in priced ABR connections," Telecommun. Syst. (Special Issue on Network Economics), 2000.
-
(2000)
Telecommun. Syst. (Special Issue on Network Economics)
-
-
Courcoubetis, C.1
Stamoulis, G.D.2
Manolakis, C.3
Kelly, F.P.4
-
16
-
-
0004092085
-
-
Englewood Cliffs, NJ: Prentice-Hall
-
L. Ljung, System Identification. Englewood Cliffs, NJ: Prentice-Hall, 1999.
-
(1999)
System Identification
-
-
Ljung, L.1
-
18
-
-
0004161838
-
-
Cambridge, U.K.: Cambridge Univ. Press
-
W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery, Numerical Recipes in C: The Art of Scientific Computing, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2002.
-
(2002)
Numerical Recipes in C: the Art of Scientific Computing, 2nd Ed
-
-
Press, W.H.1
Teukolsky, S.A.2
Vetterling, W.T.3
Flannery, B.P.4
-
20
-
-
29144510784
-
Nettimer: A tool for measuring bottleneck link bandwidth
-
_, "Nettimer: A tool for measuring bottleneck link bandwidth," in Proc. USENIX Symp. Internet Technol. Syst., 2001.
-
(2001)
Proc. USENIX Symp. Internet Technol. Syst.
-
-
-
21
-
-
84861245858
-
-
Boston, MA. [Online]
-
Boston Univ., Brite: Universal topology generator, Boston, MA. [Online]. Available: http://www.cs.bu.edu/brite
-
Brite: Universal Topology Generator
-
-
-
22
-
-
0001983901
-
A scalable content-addressable network
-
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, "A scalable content-addressable network," in Proc. ACM SIGCOMM, 2001.
-
(2001)
Proc. ACM SIGCOMM
-
-
Ratnasamy, S.1
Francis, P.2
Handley, M.3
Karp, R.4
Shenker, S.5
-
24
-
-
0003025676
-
Freenet: A distributed anonymous information storage and retrieval system
-
I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, "Freenet: A distributed anonymous information storage and retrieval system," in Proc. Workshop Design Issues Anonymity Unobservability, 2000.
-
(2000)
Proc. Workshop Design Issues Anonymity Unobservability
-
-
Clarke, I.1
Sandberg, O.2
Wiley, B.3
Hong, T.W.4
-
25
-
-
0000421874
-
Algorithmic mechanism design
-
N. Nisan and A. Ronen, "Algorithmic mechanism design," Games Econ. Behav., vol. 35, pp. 166-196, 2001.
-
(2001)
Games Econ. Behav.
, vol.35
, pp. 166-196
-
-
Nisan, N.1
Ronen, A.2
-
27
-
-
0036957186
-
A BGP-based mechanism for lowest-cost routing
-
J. Feigenbaum, C. Papadimitriou, R. Sami, and S. Shenker, "A BGP-based mechanism for lowest-cost routing," in Proc. ACM Symp. Principles Distrib. Comput., 2002.
-
(2002)
Proc. ACM Symp. Principles Distrib. Comput.
-
-
Feigenbaum, J.1
Papadimitriou, C.2
Sami, R.3
Shenker, S.4
-
29
-
-
0003967424
-
Discovering Internet topology
-
Cornell Univ., Ithaca, NY
-
R. Siamwalla, R. Sharma, and S. Keshav, "Discovering Internet topology," Cornell Univ., Ithaca, NY, Tech. Rep., 1999.
-
(1999)
Tech. Rep.
-
-
Siamwalla, R.1
Sharma, R.2
Keshav, S.3
|