Generating Linear Extensions Fast
SIAM Journal on Computing
Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Any work-conserving policy stabilizes the ring with spatial re-use
IEEE/ACM Transactions on Networking (TON)
Journal of the ACM (JACM)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Embedded Software in Network Processors - Models and Algorithms
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Computer Networks: The International Journal of Computer and Telecommunications Networking - Network processors
A Filtering Theory for Deterministic Traffic Regulation
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
International Journal of Communication Systems
"Pay bursts only once" does not hold for non-FIFO guaranteed rate nodes
Performance Evaluation - Performance 2005
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Instability of FIFO in the permanent sessions model at arbitrarily small network loads
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
EMSOFT '07 Proceedings of the 7th ACM & IEEE international conference on Embedded software
An Algorithmic Toolbox for Network Calculus
Discrete Event Dynamic Systems
Stochastic Network Calculus
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
Estimating the worst-case delay in FIFO tandems using network calculus
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Timed automata based analysis of embedded system architectures
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Sensor network calculus – a framework for worst case analysis
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
DEBORAH: a tool for worst-case analysis of FIFO tandems
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
A self-adversarial approach to delay analysis under arbitrary scheduling
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Rare events in network simulation using MIP
Proceedings of the 23rd International Teletraffic Congress
Worst-case delay bounds with fixed priorities using network calculus
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Network calculus: application to switched real-time networking
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
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
Synthesis of communication schedules for TTEthernet-based mixed-criticality systems
Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Continuity for network calculus
Proceedings of the 21st International conference on Real-Time Networks and Systems
| Hi-index | 0.00 |
Network Calculus theory aims at evaluating worstcase performances in communication networks. It provides methods to analyze models where the traffic and the services are constrained by some minimum and/or maximum envelopes (service/arrival curves). While new applications come forward, a challenging and inescapable issue remains open: achieving tight analyzes of networks with aggregate multiplexing. The theory offers efficient methods to bound maximum endto-end delays or local backlogs. However as shown recently, those bounds can be arbitrarily far from the exact worst-case values, even in seemingly simple feed-forward networks (two flows and two servers), under blind multiplexing (i.e. no information about the scheduling policies, except FIFO per flow). For now, only a network with three flows and three servers, as well as a tandem network called sink tree, have been analyzed tightly. We describe the first algorithm which computes the maximum end-to-end delay for a given flow, as well as the maximum backlog at a server, for any feed-forward network under blind multiplexing, with concave arrival curves and convex service curves. Its computational complexity may look expensive (possibly super-exponential), but we show that the problem is intrinsically difficult (NP-hard). Fortunately we show that in some cases, like tandem networks with cross-traffic interfering along intervals of servers, the complexity becomes polynomial. We also compare ourselves to the previous approaches and discuss the problems left open.