Sciweavers

307 search results - page 46 / 62
» Subjective-Cost Policy Routing
Sort
View
QUESTA
2010
93views more  QUESTA 2010»
13 years 2 months ago
Towards an Erlang formula for multiclass networks
Consider a multiclass stochastic network with state dependent service rates and arrival rates describing bandwidth-sharing mechanisms as well as admission control and/or load bala...
Matthieu Jonckheere, Jean Mairesse
INFOCOM
2009
IEEE
14 years 2 months ago
A Sybilproof Indirect Reciprocity Mechanism for Peer-to-Peer Networks
Abstract— Although direct reciprocity (Tit-for-Tat) contribution systems have been successful in reducing freeloading in peerto-peer overlays, it has been shown that, unless the ...
Raul Landa, David Griffin, Richard G. Clegg, Eleni...
GLOBECOM
2007
IEEE
14 years 2 months ago
Using Type-of-Relationship (ToR) Graphs to Select Disjoint Paths in Overlay Networks
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...
Sameer Qazi, Tim Moors
INFOCOM
2007
IEEE
14 years 2 months ago
Cost and Collision Minimizing Forwarding Schemes for Wireless Sensor Networks
—The paper presents a novel integrated MAC/routing scheme for wireless sensor networking. Our design objective is to elect the next hop for data forwarding by minimizing the numb...
Michele Rossi, Nicola Bui, Michele Zorzi
ICRA
2003
IEEE
128views Robotics» more  ICRA 2003»
14 years 1 months ago
Avoiding unsafe states in manufacturing systems based on polynomial digraph algorithms
Abstract − A deadlock-free unsafe (DFU) state of Resource Allocation System (RAS) is deadlock-free but inevitable to enter a deadlock state. Previous research revealed that in ma...
Yin Wang, Zhiming Wu