Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
SCED: a generalized scheduling policy for guaranteeing quality-of-service
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Optimal smoothing for guaranteed service
IEEE/ACM Transactions on Networking (TON)
Real-Time Transport of MPEG Video with a Statistically Guaranteed Loss Ratio in ATM Networks
IEEE Transactions on Parallel and Distributed Systems
Some properties of variable length packet shapers
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A recursive estimator of worst-case burstiness
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Efficient delay computation methods for real-time traffic in an ATM network
Progress in computer research
A framework for guaranteeing statistical QoS
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Some properties of variable length packet shapers
IEEE/ACM Transactions on Networking (TON)
Delay jitter bounds and packet scale rate guarantee for expedited forwarding
IEEE/ACM Transactions on Networking (TON)
Deterministic Time-Varying Packet Fair Queueing for Integrated Services Networks
Journal of VLSI Signal Processing Systems
Internal design representations for embedded systems: extended abstract of embedded tutorial
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
A min, + system theory for constrained traffic regulation and dynamic service guarantees
IEEE/ACM Transactions on Networking (TON)
Delay bounds for a network of guaranteed rate servers with FIFO aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Equation-Based Dynamic Shaping Algorithm
MMNS '01 Proceedings of the 4th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
Optimal Call Admission Control under Generalized Processor Sharing Scheduling
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
DSS: A Deterministic and Scalable QoS Provisioning Scheme
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
Dynamic Adaptation of Virtual Network Capacity for Deterministic Service Guarantees
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Embedded Software in Network Processors - Models and Algorithms
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Mapping of Loss and Delay Between IP and ATM Using Network Calculus
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Deterministic End-to-End Delay Bounds in an Accumulation Network
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Dynamic Shaping for Self-Similar Traffic Using Network Calculus
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Shaping self-similar traffic at access of optical network
Performance Evaluation
MERIT: a scalable approach for protocol assessment
Mobile Networks and Applications
Packet scale rate guarantee for non-FIFO nodes
IEEE/ACM Transactions on Networking (TON)
Relationship between guaranteed rate server and latency rate server
Computer Networks: The International Journal of Computer and Telecommunications Networking
Many Sources Asymptotics for Networks with Small Buffers
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Optimal call admission control on a single link with a GPS scheduler
IEEE/ACM Transactions on Networking (TON)
A network service curve approach for the stochastic analysis of networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Schedulability criterion and performance analysis of coordinated schedulers
IEEE/ACM Transactions on Networking (TON)
Pricing and brokering services over interconnected IP networks
Journal of Network and Computer Applications
End-to-end delay bounds for traffic aggregates under guaranteed-rate scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
On the way to a distributed systems calculus: an end-to-end network calculus with data scaling
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Scaling properties of statistical end-to-end bounds in the network calculus
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A basic stochastic network calculus
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Analysis of manufacturing blocking systems with network calculus
Performance Evaluation
Concave piecewise linear service curves and deadline calculations
Information Sciences: an International Journal
A network calculus with effective bandwidth
IEEE/ACM Transactions on Networking (TON)
Buffer overflow asymptotics for multiplexed regulated traffic
Performance Evaluation
Analysis of temporal and throughput fair scheduling in multirate WLANs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stochastic Analysis of Expected Schedulability for Real-Time Tasks on a Single Computing System
DS-RT '08 Proceedings of the 2008 12th IEEE/ACM International Symposium on Distributed Simulation and Real-Time Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Capacity requirements of traffic handling schemes in multi-service networks
Computer Communications
A design process of switched Ethernet architectures according to real-time application constraints
Engineering Applications of Artificial Intelligence
AINTEC '09 Asian Internet Engineering Conference
Network calculus and its application in streaming media transmission
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
A framework for deterministic delay guarantee in OBS networks
Photonic Network Communications
Dynamic demultiplexing in network calculus-Theory and application
Performance Evaluation
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
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Experience-based admission control with type-specific overbooking
IPOM'06 Proceedings of the 6th IEEE international conference on IP Operations and Management
Analysis of stochastic service guarantees in communication networks: a server model
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Performance of experience-based admission control in the presence of traffic changes
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Searching for tight performance bounds in feed-forward networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Conforming the runtime inputs for hard real-time embedded systems
Proceedings of the 49th Annual Design Automation Conference
On the time scales in video traffic characterization for queueing behavior
Computer Communications
Accounting and pricing: a forecast of the scenario of the next generation Internet
Computer Communications
Packet multiplexers with adversarial regulated traffic
Computer Communications
On the aggregation of deterministic service flows
Computer Communications
Hi-index | 754.84 |
We use previous network calculus results to study some properties of lossless multiplexing as it may be used in guaranteed service networks. We call network calculus a set of results that apply min-plus algebra to packet networks. We provide a simple proof that shaping a traffic stream to conform to a burstiness constraint preserves the original constraints satisfied by the traffic stream. We show how all rate-based packet schedulers can be modeled with a simple rate latency service curve. Then we define a general form of deterministic effective bandwidth and equivalent capacity. We find that call acceptance regions based on deterministic criteria (loss or delay) are convex, in contrast to statistical cases where it is the complement of the region which is convex. We thus find that, in general, the limit of the call acceptance region based on statistical multiplexing when the loss probability target tends to 0 may be strictly larger than the call acceptance region based on lossless multiplexing. Finally, we consider the problem of determining the optimal parameters of a variable bit rate (VBR) connection when it is used as a trunk, or tunnel, given that the input traffic is known. We find that there is an optimal peak rate for the VBR trunk, essentially insensitive to the optimization criteria. For a linear cost function, we find an explicit algorithm for the optimal remaining parameters of the VBR trunk