Amanote Research

Amanote Research

    RegisterSign In

Fully Decentralized Emulation of Best-Effort and Processor Sharing Queues

doi 10.1145/1375457.1375501
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2008

Authors
Rade StanojeviRobert Shorten
Publisher

ACM Press


Related search

Tail Behavior of Conditional Sojourn Times in Processor-Sharing Queues

Queueing Systems
StatisticsProbabilityManagement ScienceComputer Science ApplicationsMathematicsComputational TheoryOperations Research
2006English

Processor-Sharing and Random-Service Queues With Semi-Markovian Arrivals

Journal of Applied Probability
MathematicsStatisticsUncertaintyProbability
2005English

Sojourn Time Asymptotics in Processor Sharing Queues With Varying Service Rate

Queueing Systems
StatisticsProbabilityManagement ScienceComputer Science ApplicationsMathematicsComputational TheoryOperations Research
2007English

Decentralized Social Data Sharing

English

Fully Decentralized Computation of Aggregates Over Data Streams

2010English

Best-Effort Authentication for Opportunistic Networks

2011English

Efficient Decentralized Context Sharing via Smart Aggregation

2014English

Less-Than-Best-Effort Services: Pricing and Scheduling

English

Decentralized Collective Learning for Self-Managed Sharing Economies

ACM Transactions on Autonomous and Adaptive Systems
ControlSystems EngineeringComputer ScienceSoftware
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy