Sciweavers

11371 search results - page 209 / 2275
» The network inhibition problem
Sort
View
INFOCOM
2012
IEEE
13 years 9 months ago
Memory-assisted universal compression of network flows
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
Mohsen Sardari, Ahmad Beirami, Faramarz Fekri
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
16 years 1 months ago
On time-scale designs for networks
—We motivate the problem of designing a subset of the edge weights in a graph, to shape the spectrum of an associated linear time-invariant dynamics. We address a canonical desig...
Sandip Roy, Yan Wan, Ali Saberi
ADHOC
2007
107views more  ADHOC 2007»
15 years 6 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu
OL
2011
242views Neural Networks» more  OL 2011»
15 years 1 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
NETWORKING
2008
15 years 8 months ago
Thorough Analysis of 802.11e Star Topology Scenarios in the Presence of Hidden Nodes
In this paper the authors present a simulation study of two 802.11e network scenarios. The presented analysis is not only novel but most of all crucial for understanding how a theo...
Katarzyna Kosek, Marek Natkaniec, Luca Vollero