Study of delay jitter with and without peak rate enforcement
IEEE/ACM Transactions on Networking (TON)
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
A survey on wireless multimedia sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A calculus for stochastic QoS analysis
Performance Evaluation
Performance bounds for feedforward queueing networks with upper-constrained inputs
Performance Evaluation
A new scheduling scheme for high-speed packet networks: Earliest-virtual-deadline-first
Computer Communications
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Concave piecewise linear service curves and deadline calculations
Information Sciences: an International Journal
Transforming general networks into feed-forward by using turn-prohibition
Computer Communications
Buffer overflow asymptotics for multiplexed regulated traffic
Performance Evaluation
A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
Performance Evaluation
Optimal routing for end-to-end guarantees using Network Calculus
Performance Evaluation
Stability bounds in networks with dynamic link capacities
Information Processing Letters
Enabling network calculus-based simulation for TCP congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Guaranteed real-time communication in packet-switched networks with FCFS queuing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adversarial queuing theory with setups
Theoretical Computer Science
Stochastic and deterministic performance evaluation of automotive CAN communication
Computer Networks: The International Journal of Computer and Telecommunications Networking
Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Traffic shaping in aggregate-based networks: implementation and analysis
Computer Communications
Capacity requirements of traffic handling schemes in multi-service networks
Computer Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Conjugate network calculus: A dual approach applying the Legendre transform
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)
Comparison and analysis of the revenue-based adaptive queuing models
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)
Conformance analysis in networks with service level agreements
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scalability and QoS guarantee for streams with (m,k)-firm deadline
Computer Standards & Interfaces
A design process of switched Ethernet architectures according to real-time application constraints
Engineering Applications of Artificial Intelligence
Source policing for ATM systems based on peakedness rate
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Dynamic demultiplexing in network calculus-Theory and application
Performance Evaluation
Genetic algorithms for delays evaluation in networked automation systems
Engineering Applications of Artificial Intelligence
Computer Networks: The International Journal of Computer and Telecommunications Networking
Class-specific quality of service guarantees in multimedia communication networks
Automatica (Journal of IFAC)
A real-time data aggregation method for fault-tolerant wireless sensor networks
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Providing end-to-end performance guarantees using non-work-conserving disciplines
Computer Communications
Towards optimal policing in ATM networks
Computer Communications
Issues in improving TCP performance over ATM
Computer Communications
Research: Offline real-time channel establishment in packet-switched networks
Computer Communications
Mathematical and Computer Modelling: An International Journal
Scheduling of periodic connections with flexibility
Optical Switching and Networking
An efficient packet service algorithm for high-speed ATM switches
Computer Communications
On the time scales in video traffic characterization for queueing behavior
Computer Communications
Performance evaluation of optimal aggregate-flow scheduling: a simulation study
Computer Communications
A self-extracting accurate modeling for bounded-delay video services
Computer Communications
A probabilistic priority scheduling discipline for multi-service networks
Computer Communications
Charging for packet-switched network communication-motivation and overview
Computer Communications
Packet multiplexers with adversarial regulated traffic
Computer Communications
Computing robust basestock levels
Discrete Optimization
Network calculus and mixed-integer LP applied to a switched aircraft cabin network
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Computer Networks: The International Journal of Computer and Telecommunications Networking
Branching processes, the max-plus algebra and network calculus
ASMTA'12 Proceedings of the 19th international conference on Analytical and Stochastic Modeling Techniques and Applications
Worst-case performance analysis of 2-D mesh NoCs using multi-path minimal routing
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Effective capacity of a correlated Nakagami-m fading channel
Wireless Communications & Mobile Computing
Combining network calculus and scheduling theory to improve delay bounds
Proceedings of the 20th International Conference on Real-Time and Network Systems
Evolving robust networks for systems-of-systems
SSBSE'12 Proceedings of the 4th international conference on Search Based Software Engineering
On the impact of storage in residential power distribution systems
ACM SIGMETRICS Performance Evaluation Review
Cyclo-static DataFlow phases scheduling optimization for buffer sizes minimization
Proceedings of the 16th International Workshop on Software and Compilers for Embedded Systems
Mathematical formalisms for performance evaluation of networks-on-chip
ACM Computing Surveys (CSUR)
Impact of resource sharing on performance and performance prediction: a survey
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
ACM SIGCOMM Computer Communication Review
On applying stochastic network calculus
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 754.84 |
A calculus is developed for obtaining bounds on delay and buffering requirements in a communication network operating in a packet switched mode under a fixed routing strategy. The theory developed is different from traditional approaches to analyzing delay because the model used to describe the entry of data into the network is nonprobabilistic. It is supposed that the data stream entered into the network by any given user satisfies burstiness constraints. A data stream is said to satisfy a burstiness constraint if the quantity of data from the stream contained in any interval of time is less than a value that depends on the length of the interval. Several network elements are defined that can be used as building blocks to model a wide variety of communication networks. Each type of network element is analyzed by assuming that the traffic entering it satisfies bursting constraints. Under this assumption, bounds are obtained on delay and buffering requirements for the network element; burstiness constraints satisfied by the traffic that exits the element are derived