Sciweavers

330 search results - page 64 / 66
» A new traffic control algorithm for ABR service
Sort
View
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 25 days ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
ICC
2007
IEEE
103views Communications» more  ICC 2007»
14 years 18 days ago
A More Realistic Approach to Information-Theoretic Sum Capacity of Reverse Link CDMA Systems in a Single Cell
— In this paper, we discuss the information–theoretic approach to finding the pattern of transmission powers of the stations in a CDMA system which maximizes the aggregate cap...
Arash Abadpour, Attahiru Sule Alfa, Anthony C. K. ...
LCN
2003
IEEE
13 years 11 months ago
Improving the Aggregate Throughput of Access Points in IEEE 802.11 Wireless LANs
In IEEE 802.11 wireless LANs, the DCF access method and the PCF access method operate alternatively within a superframe to service the time-varying traffic demands. Due to differ...
X. James Dong, Mustafa Ergen, Pravin Varaiya, Anuj...
INFOCOM
2007
IEEE
14 years 17 days ago
A Framework for Multi-Objective SLA Compliance Monitoring
Abstract— Service level agreements (SLAs) specify performance guarantees made by service providers, typically in terms of packet loss, delay, delay variation, and network availab...
Joel Sommers, Paul Barford, Nick G. Duffield, Amos...
GLOBECOM
2006
IEEE
14 years 10 days ago
A Coverage-Preserving and Hole Tolerant Based Scheme for the Irregular Sensing Range in Wireless Sensor Networks
— Coverage is an important issue related to WSN quality of service. Several centralized/decentralized solutions based on the geometry information of sensors and under the assumpt...
Azzedine Boukerche, Xin Fei, Regina Borges de Arau...