Data networks
Markovian network processes: congestion-dependent routing and processing
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic Flows and Product Form Solutions in Stochastic Transfer Networks
Queueing Systems: Theory and Applications
Markov network processes with product form stationary distributions
Queueing Systems: Theory and Applications
On performance bounds for balanced fairness
Performance Evaluation - Internet performance symposium (IPS 2002)
On performance bounds for the integration of elastic and adaptive streaming flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the joint international conference on Measurement and modeling of computer systems
On Stochastic Bounds for Monotonic Processor Sharing Networks
Queueing Systems: Theory and Applications
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Calculating the flow level performance of balanced fairness in tree networks
Performance Evaluation
Optimal insensitive routing and bandwidth sharing in simple data networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A queueing model for HTTP traffic over IEEE 802.11 WLANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sojourn time asymptotics in processor-sharing queues
Queueing Systems: Theory and Applications
Insensitive load balancing in data networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
Insensitive queueing models for communication networks
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Insensitive Traffic Models for Communication Networks
Discrete Event Dynamic Systems
Waiting times for M/M systems under state-dependent processor sharing
Queueing Systems: Theory and Applications
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal robust policies for bandwidth allocation and admission control in wireless networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Providing statistically guaranteed streaming quality for peer-to-peer live streaming
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
A queueing model for HTTP traffic over IEEE 802.11 WLANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Insensitive load balancing in data networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Selected papers from the 3rd international workshop on QoS in multiservice IP networks (QoS-IP 2005)
On sojourn times in M/GI systems under state-dependent processor sharing
Queueing Systems: Theory and Applications
Performance analysis of differentiated resource-sharing in a wireless ad-hoc network
Performance Evaluation
Randomized load balancing with general service time distributions
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Towards an Erlang formula for multiclass networks
Queueing Systems: Theory and Applications
State-dependent rates and semi-product-form via the reversed process
EPEW'10 Proceedings of the 7th European performance engineering conference on Computer performance engineering
Insensitive, maximum stable allocations converge to proportional fairness
Queueing Systems: Theory and Applications
A flow-aware MAC protocol for a passive optical metropolitan area network
Proceedings of the 23rd International Teletraffic Congress
Optimal load balancing in insensitive data networks
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
Queueing Systems: Theory and Applications
Optimal queue-size scaling in switched networks
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Product-form results for two-station networks with shared resources
Performance Evaluation
Processor sharing and pricing implications
Proceedings of the 24th International Teletraffic Congress
Overcoming performance pitfalls in rate-diverse high speed WLANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
We consider an open network of processor-sharing nodes with state-dependent service capacities, i.e., the speed of each node may depend on the number of customers at any node. We demonstrate that the stationary distribution of the network state is insensitive to the distribution of service times if and only if the service capacities are balanced, i.e., the considered network is a Whittle network. The stationary distribution then has a closed-form expression and the expected sojourn time of a customer at any node is proportional to its required quantity of service. These results are extended to the cases of closed networks and state-dependent arrival rates and routing. Two simple examples illustrate the practical interest of these results in the context of communication networks.