IEEE/ACM Transactions on Networking (TON)
Dynamic queue length thresholds for shared-memory packet switches
IEEE/ACM Transactions on Networking (TON)
Explicit allocation of best-effort packet delivery service
IEEE/ACM Transactions on Networking (TON)
Effective bandwidths with priorities
IEEE/ACM Transactions on Networking (TON)
A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Loss probability calculations and asymptotic analysis for finite buffer multiplexers
IEEE/ACM Transactions on Networking (TON)
Testing the Gaussian approximation of aggregate traffic
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
IEEE/ACM Transactions on Networking (TON)
JoBS: Joint Buffer Management and Scheduling for Differentiated Services
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
A New Fluid-Based Methodology to Model AQM Techniques with Markov Arrivals
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Proportional differentiated services for the internet
Proportional differentiated services for the internet
Dynamic core provisioning for quantitative differentiated services
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable approach to the partition of QoS requirements in unicast and multicast
IEEE/ACM Transactions on Networking (TON)
Modelling Active Queue Management with Different Traffic Classes
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Efficient QoS partition and routing of unicast and multicast
IEEE/ACM Transactions on Networking (TON)
A simple FIFO-based scheme for differentiated loss guarantees
Computer Networks: The International Journal of Computer and Telecommunications Networking
Enhancing class-based service architectures with adaptive rate allocation and dropping mechanisms
IEEE/ACM Transactions on Networking (TON)
Proportional differentiation: a scalable QoS approach
IEEE Communications Magazine
Packet scheduling with delay and loss differentiation
Computer Communications
A case for relative differentiated services and the proportional differentiation model
IEEE Network: The Magazine of Global Internetworking
ABE: providing a low-delay service within best effort
IEEE Network: The Magazine of Global Internetworking
Analysis of Shared Memory Priority Queues with Two Discard Levels
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
This paper describes the algorithms and the architecture of a network able to provide end-to-end proportional packet loss probabilities at the flow level. We show that the combination of a simple classification technique at the sources, and a network core having two internal service classes, is sufficient to achieve proportional service without the need to deploy coordinated, complex per-hop scheduling schemes or signaling protocols, which is the conventional approach. The proposed architecture is complementary to any differentiation algorithm used by the routers. Our results show that any network endowed with some internal service classes with respect to packet loss probabilities can be exploited to build a set of external service classes with end-to-end and per-flow guarantees.