Sciweavers

1089 search results - page 30 / 218
» NetComplex: A Complexity Metric for Networked System Designs
Sort
View
139
Voted
GLOBECOM
2010
IEEE
15 years 1 months ago
Dynamic Resource Allocation Based Partial Crosstalk Cancellation in DSL Networks
The design of crosstalk mitigation techniques for DSL broadband access systems has mainly focused on physical layer transmit rate maximization. However, for certain applications, u...
Beier Li, Paschalis Tsiaflakis, Marc Moonen, Joche...
125
Voted
IPSN
2004
Springer
15 years 9 months ago
Sensing uncertainty reduction using low complexity actuation
The performance of a sensor network may be best judged by the quality of application specific information return. The actual sensing performance of a deployed sensor network depe...
Aman Kansal, Eric Yuen, William J. Kaiser, Gregory...
135
Voted
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
16 years 4 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
156
Voted
SIGCOMM
2005
ACM
15 years 9 months ago
Meridian: a lightweight network location service without virtual coordinates
This paper introduces a lightweight, scalable and accurate framework, called Meridian, for performing node selection based on network location. The framework consists of an overla...
Bernard Wong, Aleksandrs Slivkins, Emin Gün S...
DSN
2009
IEEE
15 years 10 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni