This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Several recent proposals for sharing congestion information across concurrent flows between end-systems overlook an important problem: two or more flows sharing congestion state...
Aditya Akella, Srinivasan Seshan, Hari Balakrishna...
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and pee...
Abstract— Several techniques have been proposed for measuring network-internal delays. However, those that rely on router responses have questionable performance, and all propose...
Kostas G. Anagnostakis, Michael Greenwald, Raphael...
— The core-stateless service architecture alleviates the scalability problems of the integrated service framework while maintaining its guaranteed service semantics. The admissio...