Data networks
On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
IEEE/ACM Transactions on Networking (TON)
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
IEEE/ACM Transactions on Networking (TON)
Statistical analysis of generalized processor sharing scheduling discipline
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Rednet: a wireless ATM local area network using infrared links
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Real-time block transfer under a link-sharing hierarchy
IEEE/ACM Transactions on Networking (TON)
Real-Time Virtual Resource: A Timely Abstraction for Embedded Systems
EMSOFT '02 Proceedings of the Second International Conference on Embedded Software
A Call Admission Control Algorithm Based on Stochastic Performance Bound for Wireless Networks
PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Performance Analysis of Multicast Flow Control Algorithms over Combined Wired/Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Real-Time Block Transfer Under a Link Sharing Hierarchy
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Per-domain packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
A basic stochastic network calculus
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A calculus for stochastic QoS analysis
Performance Evaluation
Network calculus and queueing theory: two sides of one coin: invited paper
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Per-domain packet scale rate guarantee for expedited forwarding
IWQoS'03 Proceedings of the 11th international conference on Quality of service
On superlinear scaling of network delays
IEEE/ACM Transactions on Networking (TON)
Analysis of stochastic service guarantees in communication networks: a server model
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
On applying stochastic network calculus
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
In most network models for quality of service support, the communication links interconnecting the switches and gateways are assumed to have fixed bandwidth and zero error rate. This assumption of steadiness, especially in a heterogeneous internet-working environment, might be invalid owing to subnetwork multiple-access mechanism, link-level flow/error control, and user mobility. Techniques are presented in this paper to characterize and analyze work-conserving communication nodes with varying output rate. In the deterministic approach, the notion of "fluctuation constraint," analogous to the "burstiness constraint" for traffic characterization, is introduced to characterize the node. In the statistical approach, the variable-rate output is modelled as an "exponentially bounded fluctuation" process in a way similar to the "exponentially bounded burstiness" method for traffic modelling. Based on these concepts, deterministic and statistical bounds on queue size and packet delay in isolated variable-rate communication server-nodes are derived, including cases of single-input and multiple-input under first-come-first-serve queueing. Queue size bounds are shown to be useful for buffer requirement and packet loss probability estimation at individual nodes. Our formulations also facilitate the computation of end-to-end performance bounds across a feedforward network of variable-rate server-nodes. Several numerical examples of interest are given in the discussion.