Sciweavers

4411 search results - page 21 / 883
» Communication Complexity and Its Applications
Sort
View
INFOCOM
2009
IEEE
14 years 4 months ago
Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design
Abstract—We study the joint power control and minimumframe-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transm...
Liqun Fu, Soung Chang Liew, Jianwei Huang
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
14 years 1 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
INFOCOM
2007
IEEE
14 years 4 months ago
The Cache Inference Problem and its Application to Content and Request Routing
— In many networked applications, independent caching agents cooperate by servicing each other’s miss streams, without revealing the operational details of the caching mechanis...
Nikolaos Laoutaris, Georgios Zervas, Azer Bestavro...
ICC
2007
IEEE
120views Communications» more  ICC 2007»
14 years 4 months ago
Fixed-Period Packet Sampling and its Application to Flow Rate Estimation
Abstract— We propose a packet sampling strategy called fixedperiod sampling, which selects at most one packet in every fixedlength period. Under the fixed-period sampling, the...
Sadayoshi Ito, Kousuke Uchiyama, Shigeo Shioda
SIGCOMM
1998
ACM
14 years 2 months ago
An Active Service Framework and Its Application to Real-Time Multimedia Transcoding
Several recent proposals for an “active networks” architecture advocate the placement of user-defined computation within the network as a key mechanism to enable a wide range...
Elan Amir, Steven McCanne, Randy H. Katz