-
[show abstract]
[hide abstract]
ABSTRACT: We extend a measurement-based admission control algorithm suggested for predictive service to provide advance reservations for guaranteed and predictive service while keeping the attractive features of predictive service. The admission decision for advance reservations is based on information about flows that overlap in time. For flows that have not yet started, the requested values are used, and for those that have already started measurements are used. This allows us to estimate the network load accurately for the near future. To provide advance reservations we ask users to include durations in their requests. We provide simulation results to show that predictive service with advance reservations provides utilization levels significantly higher than those for guaranteed service.
10/2006: pages 1-15;
-
Quality of Service in Multiservice IP Networks, International Workshop, QoS-IP 2001, Rome, Italy, January 2001, Proceedings; 01/2001
-
[show abstract]
[hide abstract]
ABSTRACT: Wireless is becoming a popular way to connect mobile computers to the Internet and other networks. The bandwidth of wireless
links will probably always be limited due to properties of the physical medium and regulatory limits on the use of frequencies
for radio communication. Therefore, it is necessary for network protocols to utilize the available bandwidth efficiently.
Headers of IP packets are growing and the bandwidth required for transmitting headers is increasing. With the coming of IPv6
the address size increases from 4 to 16 bytes and the basic IP header increases from 20 to 40 bytes. Moreover, most mobility
schemes tunnel packets addressed to mobile hosts by adding an extra IP header or extra routing information, typically increasing
the size of TCP/IPv4 headers to 60 bytes and TCP/IPv6 headers to 100 bytes. In this paper, we provide new header compression
schemes for UDP/IP and TCP/IP protocols. We show how to reduce the size of UDP/IP headers by an order of magnitude, down to
four to five bytes. Our method works over simplex links, lossy links, multi‐access links, and supports multicast communication.
We also show how to generalize the most commonly used method for header compression for TCP/IPv4, developed by Jacobson, to
IPv6 and multiple IP headers. The resulting scheme unfortunately reduces TCP throughput over lossy links due to unfavorable
interaction with TCP's congestion control mechanisms. However, by adding two simple mechanisms the potential gain from header
compression can be realized over lossy wireless networks as well as point‐to‐point modem links.
Wireless Networks 09/1997; 3(5):375-387. · 0.52 Impact Factor
-
[show abstract]
[hide abstract]
ABSTRACT: We extend a measurement-based admission control algorithm suggested for predictive service to provide advance reservations
for guaranteed and predictive service, while retaining the attractive features of predictive service. The admission decision
for advance reservations is based on information about flows that overlap in time. For flows that have not yet started, the
requested values are used, and for those that have already started measurements are used. This allows us to estimate the network
load accurately for the near future. To provide advance reservations we ask users to include durations in their requests.
We present simulation results to show that predictive service with advance reservations provides utilization levels significantly
higher than those for guaranteed service, and comparable to those for predicted service without advance reservations. Those
utilization levels are reached without any preemption of other admitted flows. Finally, we discuss how to setup advance reservations
over multiple hops in the Internet using resource reservation setup protocols.
Multimedia Systems 04/1997; 5(3):177-186. · 0.73 Impact Factor
-
01/1997
-
Multimedia Telecommunications and Applications, Third International COST 237 Workshop, Barcelona, Spain, November 25-27, 1996, Proceedings; 01/1996
-
01/1996
-
Network and Operating System Support for Digital Audio and Video, 5th International Workshop, NOSSDAV '95, Durham, New Hampshire, USA, April 19-21, 1995, Proceedings; 01/1995
-
[show abstract]
[hide abstract]
ABSTRACT: . We extend a measurement-based admission control algorithm suggested for predictive service to provide advance reservations for guaranteed and predictive service while keeping the attractive features of predictive service. The admission decision for advance reservations is based on information about flows that overlap in time. For flows that have not yet started, the requested values are used, and for those that have already started measurements are used. This allows us to estimate the network load accurately for the near future. To provide advance reservations we ask users to include durations in their requests. We present simulation results to show that predictive service with advance reservations provides utilization levels significantly higher than those for guaranteed service, and comparable to those for predicted service without advance reservations. Those utilization levels are reached without any preemtion of other admitted flows. Finally, we discuss how to setup ...
02/1970;
-
Mikael Degermark
[show abstract]
[hide abstract]
ABSTRACT: This thesis addresses packet forwarding in packet-switching networks such as the Internet. The interconnection points tying transmission links together in such networks are called routers, computers that may be specialized for the task. Routers need to decide where, when, and in what form each packet should be forwarded. This thesis concerns aspects of these three decisions. A router has to decide where an incoming packet is to be sent. Routers need to determine which outgoing link to use and in the case of multi-access links where on the link the packet should go. Packet headers contain addressing information that specifies the destination of the packet. For IP that information has to be matched with topological information, gathered by routing protocols that operate between routers, to determine the next hop in a viable path through the network. A fast algorithm for this matching operation, the IP routing lookup, is presented. When realized in software running on commercially availa...
02/1970;
-
Mikael Degermark
[show abstract]
[hide abstract]
ABSTRACT: Low-speed wireless is becoming a popular way to connect mobile computers to the Internet and other networks. Users will desire the same services on low speed links as they already have on higher speed networks. Since bandwidth will probably always be a limitation on wide area wireless links, protocol mechanisms need to be developed to use the available bandwidth on low speed networks efficiently. In the face of growing address sizes, such as those in IPv6, we offer a header compression scheme that enables efficient use of bandwidth when packets are small. The scheme uses soft state, works over simplex links, supports multicast transmission for real time applications, and besides providing more usable bandwidth on wireless links, allows better utilization of gateways and servers attached to wireless networks. 1 Introduction In the future, many end systems will be attached to the global Internet over relatively low-speed wireless links. With the advent of the Mbone as well as some com...
02/1970;
