Sciweavers

307 search results - page 16 / 62
» Subjective-Cost Policy Routing
Sort
View
CONEXT
2008
ACM
13 years 9 months ago
Incentive-compatible caching and peering in data-oriented networks
Several new, data-oriented internetworking architectures have been proposed recently. However, the practical deployability of such designs is an open question. In this paper, we c...
Jarno Rajahalme, Mikko Särelä, Pekka Nik...
CN
2006
73views more  CN 2006»
13 years 8 months ago
Rate-distortion based link state update
Finding paths that satisfy the performance requirements of applications according to the link state information in a network is known as the quality-of-service (QoS) routing probl...
Gang Cheng, Nirwan Ansari
IOR
2007
82views more  IOR 2007»
13 years 7 months ago
Compensating for Failures with Flexible Servers
We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival ...
Sigrún Andradóttir, Hayriye Ayhan, D...
DSN
2007
IEEE
14 years 2 months ago
A Firewall for Routers: Protecting against Routing Misbehavior
In this work, we present the novel idea of route normalization by correcting on the fly routing traffic on behalf of a local router to protect the local network from malicious a...
Ying Zhang, Zhuoqing Morley Mao, Jia Wang
ICNP
2005
IEEE
14 years 1 months ago
On Understanding of Transient Interdomain Routing Failures
The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes [14,15]. Yet, routing behavior during BGP route convergence is poorly understood. BGP...
Feng Wang, Lixin Gao, Jia Wang, Jian Qiu