A calculus for stochastic QoS analysis
Performance Evaluation
Performance bounds for feedforward queueing networks with upper-constrained inputs
Performance Evaluation
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
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
The notion of end-to-end capacity and its application to the estimation of end-to-end network delays
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Long range dependent trafic
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)
A design process of switched Ethernet architectures according to real-time application constraints
Engineering Applications of Artificial Intelligence
Robust non-probabilistic bounds for delay and throughput in credit-based flow control
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Dynamic demultiplexing in network calculus-Theory and application
Performance Evaluation
Class-specific quality of service guarantees in multimedia communication networks
Automatica (Journal of IFAC)
Providing end-to-end performance guarantees using non-work-conserving disciplines
Computer Communications
Mathematical and Computer Modelling: An International Journal
A self-extracting accurate modeling for bounded-delay video services
Computer Communications
Packet multiplexers with adversarial regulated traffic
Computer Communications
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
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
Mathematical formalisms for performance evaluation of networks-on-chip
ACM Computing Surveys (CSUR)
ACM SIGCOMM Computer Communication Review
On applying stochastic network calculus
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 754.84 |
For pt.I see ibid., vol.37, no.1, p.114-31 (1991). A method to analyze the flow of data in a network consisting of the interconnection of network elements is presented. Assuming the data that enters the network satisfies burstiness constraints, burstiness constraints are derived for traffic flowing between network elements. These derived constraints imply bounds on network delay and buffering requirements. By example, it is shown that the use of regulator elements within the network can reduce maximum network delay. It is also found that such a use of regulator elements can enlarge the throughput region where finite bounds for delay are found. Finally, it is shown how regulator elements connected in series can be used to enforce general burstiness constraints