Learn More
This paper addresaea the problem of providing per-connection end-to-end delay guarantees in a high-speed network. We assume that the network is connection oriented and enforces some admission control which ensurea that the source traffic conforms to specitied traftic characteristics. We concentrate on the class of rate-controlled service (RCS) disciplbw, in(More)
Ž. In this paper, we review the basic mechanisms used in packet networks to support Quality-of-Service QoS guarantees. We outline the various approaches that have been proposed, and discuss some of the trade-offs they involve. Specifically, the paper starts by introducing the different scheduling and buffer management mechanisms that can be used to provide(More)
— The last couple of years has seen a growing momentum towards using the Internet for conducting business. One of the key enablers for business applications is the ability to setup secure channels across the internet. The Secure Sockets Layer (SSL) protocol provides this capability and it is the most widely used transport layer security protocol. In this(More)
In this paper, we investigate some issues related to the efficient provision of end-to-end delay guarantees in the context of the Guaranteed (G) Services framework [16]. First, we consider the impact of reshaping traffic within the network on the end-to-end delay, the end-to-end jitter, as well as per-hop buffer requirements. This leads us to examine a(More)
An anycast address is an IP address that may be bound to one or more network endpoints. Unlike multicast, a packet destined to an anycast address is forwarded to any one of the hosts with this address. In this paper, we investigate how the IP anycast service can be used as an effective load distribution mechanism at the network layer. The anycast service(More)
— In this paper, we share our experience in designing and building a content based switch which we call L5. In addition to the layer 2-3-4 information available in the packet, a content based switch uses application level information to route traffic in the network. Making routing decisions based on information contained in the payload is not a new idea. In(More)
In recent years, a number of link scheduling algorithms have been proposed that greatly improve upon traditional FIFO scheduling in being able to assure rate and delay bounds for individual sessions. However, they cannot be easily deployed in a backbone environment with thousands of sessions, as their complexity increases with the number of sessions. In(More)
We consider an important tradeoff between processor and memory allocation in distributed parallel processing systems. To study this tradeoff, we formulate stochastic models of parallel program behavior, distributed parallel processing environments and memory overheads incurred by parallel programs as a function of their processor allocation. A mathematical(More)
— This paper investigates the problem of making QoS guarantees available in access devices such as edge routers, that are commonly deployed in today's IP networks. In the paper, we propose a specific design which we evaluate by carrying out a complete implementation, whose performance we then measure in the context of an experimental testbed. Our results(More)