1022 search results - page 97 / 205 » New models and algorithms for programmable networks |
153
click to vote
MASCOTS
2004
15 years 7 months ago
2004
It is known that the resources that limit the overall performance of the system are the congested ones, referred to as bottlenecks. From the knowledge of the bottleneck stations w...
165
click to vote
GLOBECOM
2007
IEEE
16 years 17 days ago
2007
IEEE
This paper introduces a new game theoretic formulation for the design and routing of resilient and translucent networks. An integer linear programming (ILP) modeling is also presen...
152
click to vote
GLOBECOM
2006
IEEE
16 years 11 days ago
2006
IEEE
— Anycast routing is very useful for many applications such as resource discovery in Delay Tolerant Networks (DTNs). In this paper, based on a new DTN model, we first analyze th...
150
click to vote
VLDB
2005
ACM
15 years 11 months ago
2005
ACM
Discovering associations between elements occurring in a stream is applicable in numerous applications, including predictive caching and fraud detection. These applications requir...
165
click to vote
TCOM
2008
15 years 6 months ago
2008
In this paper, a new information theoretic algorithm is proposed for signal enumeration in DS-CDMA networks. The approach is based on the predictive description length (PDL) of the...