Sciweavers

102291 search results - page 20168 / 20459
» Computability in Computational Geometry
Sort
View
CN
2007
95views more  CN 2007»
15 years 6 months ago
Quality-of-Service routing with path information aggregation
Most of the research proposals on Quality-of-Service (QoS) mechanisms have focused on providing guarantees in a single domain. Supporting QoS guarantees in the interdomain setting...
W.-Y. Tam, King-Shan Lui, Suleyman Uludag, Klara N...
CN
2007
89views more  CN 2007»
15 years 6 months ago
Determining an appropriate sending rate over an underutilized network path
Determining an appropriate sending rate when beginning data transmission into a network with unknown characteristics is a fundamental issue in best-effort networks. Traditionally,...
Pasi Sarolahti, Mark Allman, Sally Floyd
INTERNET
2008
175views more  INTERNET 2008»
15 years 6 months ago
Mashing Up Search Services
through suitable abstractions and tools is a viable option for improving servicebased computations. T he past few years have witnessed end users' increasing involve ment in th...
Daniele Braga, Stefano Ceri, Florian Daniel, David...
CN
2007
141views more  CN 2007»
15 years 6 months ago
Identifying lossy links in wired/wireless networks by exploiting sparse characteristics
In this paper, we consider the problem of estimating link loss rates based on end-to-end path loss rates in order to identify lossy links on the network. We first derive a maximu...
Hyuk Lim, Jennifer C. Hou
CN
2007
111views more  CN 2007»
15 years 6 months ago
An auction mechanism for allocating the bandwidth of networks to their users
We present a mechanism for auctioning bandwidth on a network-wide basis to end users or ISPs that will utilize it for the same time period. This mechanism consists of a set of sim...
Manos Dramitinos, George D. Stamoulis, Costas Cour...
« Prev « First page 20168 / 20459 Last » Next »