Rethinking the Design of the Internet: The End-To-End Arguments vs. The Brave New World

ACM Transactions on Internet Technology

Volumn 1, Issue 1, 2001, Pages 70-109

  Blumenthal, Marjory S ^a   Clark, David D ^b  

^a NATIONAL ACADEMY OF SCIENCES   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Economics; End to end argument; Internet; ISP; Legal Aspects

Indexed keywords

EID: 80052862897     PISSN: 15335399     EISSN: 15576051     Source Type: Journal    
DOI: 10.1145/383034.383037     Document Type: Article

References (12)

1. Chen, X., Zheng, J., Fu, Z., Nan, P., Zhong, Y., Lonardi, S., and Jiang, T. 2005. Computing the Assignment of Orthologous Genes Via Genome Rearrangement. In Proceedings of the 3Rd Asia-Pacific Bioinformatics Conference. 363-378. To Appear in Ieee/Acm Transactions on Computational Biology and Bioinformatics.
2. Chrobak, M., Kolman, P., and Sgall, J. 2004. The Greedy Algorithm Forthe Minimum Common String Partition Problem. In Proceedings of the 7Th International Workshop on Approximation Algorithms For Combinatorial Optimization Problems. Lecture Notes in Computer Science, Vol. 3122. Springer, Berlin, Germany, 84-95.
3. Cormode, G., and Muthukrishnan, J. 2002. The String Edit Distance Matching With Moves. In Proceedings of the 13Th Annual Symposium on Discrete Algorithms. 667-676.
4. Goldstein, A., Kolman, P., and Zheng, J. 2004. Minimum Common String Partition Problem: Hardness and Approximations. In Proceedings of the 15Th International Symposium on Algorithms and Computation. Lecture Notes in Computer Science, Vol. 3341. Springer, Berlin, Germany, 473-484.
5. Kaplan, H., and Shafrir, N. 2005. The Greedy Algorithm For Edit Distance With Moves. Inform. Process. Lett. To Appear.
6. Kolman, P. 2005. Approximating Reversal Distance For Strings With Bounded Number of Duplicates. In Proceedings of the 30Th International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, Vol. 3618. Springer, Berlin, Germany, 580-590.
7. Kruskal, J. B., and Sankoff, D. 1983. An Anthology of Algorithms and Concepts For Sequence Comparison. In Time Warps, String Edits, and Macromolecules: the Theory and Practice Ofsequence Comparison, D. Sankoff and J. B. Kruskal, Eds. Addison-Wesley, Reading, Ma.
8. Levenshtein, V. I. 1965. Binary Codes Capable of Correcting Deletions, Insertions and Reversals. Dok. Akad. Nauk Sssr 163, 4, 845-848. (In Russian).
9. Lopresti, D., and Tomkins, A. 1997. Block Edit Models For Approximate String Matching. Theoret. Comput. Sci. 181, 1, 159-179.
10. Shapira, D., and Storer, J. 2002. Edit Distance With Move Operations. In Proceedings of the 13Th Annual Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, Vol. 2373. Springer, Berlin, Germany, 85-98.
11. Tichy, W. F. 1984. The String-To-String Correction Problem With Block Moves. Acm Trans. Comput. Syst. 2, 4, 309-321.
12. Waterman, M. S., and Eggert, M. 1987. A New Algorithm For Best Subsequence Alignments With Applications To Trna-Rrna Comparison. J. Molec. Biol. 197, 4, 723-728.