The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We present a protocol for maintaining a spanning tree that is maximal with respect to any given (bounded and monotonic) routing metric. This protocol has two interesting adaptive properties. First, the protocol is stabilizing: starting from any state, the protocol stabilizes to a state where a maximal tree is present. Second, contrary to other approaches, the protocol converges in O(L * deg) time,...
Two techniques have been proposed in the literature to improve the scalability of QoS scheduling in the core of the Internet: flow aggregation and dynamic packet scheduling (DPS). These techniques reduce or eliminate the amount of state maintained by each router in a core network. Flow aggregation combines multiple individual flows into a single aggregate flow (and thus reducing the per-flow state...
Flow aggregation has been proposed as a technique to improve the scalability of QoS scheduling in the core of the Internet, by reducing the amount of per-flow state necessary at a router. This is accomplished by aggregating into a single flow multiple flows that share part of the same path to the destination. In its simplest form, flow aggregation is inherently non-work- conserving, that is, it may...
In the effort of reducing or eliminating per-flow state at routers, hence making QoS schedulers scalable in the core Internet, flow aggregation outperforms dynamic packet state by providing better end-to-end delay guarantee. Work-conserving flow aggregation (WCFA) has the advantage of gaining work-conserving property at the cost of an extra per-hop delay. Most research on work-conserving flow aggregation...
The Internet traditionally provides best effort service to all applications. While elastic applications are satisfied by this service, inelastic applications such as interactive audio and video suffer from end-to-end delay guarantees. Although guaranteed rate schedulers were developed to provide such guarantees, their scalability has been a concern because they maintain per-flow state. In an effort...
We present a new acknowledgment strategy to improve the performance of TCP sessions that originate or terminate in noisy wireless networks for mobile computers. This acknowledgment strategy allows the TCP source to distinguish between losses due to congestion and losses due to corruption. With this distinction, the source can reduce its sending rate when congestion occurs, and quickly retransmit when...
To support mobility, we propose to use a triple (M, N, d) as an address for every stationary or mobile computer in a multi-network system, like the Internet. In this (M, N, d) address, M is the network where the computer is currently located, N is the network where the computer is usually located, and d is a unique identifier of the computer in network N. The address of a stationary computer is always...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.