L.M. Breslau, Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks, doctoral dissertation, Computer 58  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of magnitude difference. In our scheme, the admission control algorithm at each switch enforces the queueing delay bound at that switch. We leave the satisfaction of end to end delay requirements to the end systems. An end system could, for example, use adaptive source routing, such as the one in [Bre95] to select a route that satisfies its end to end requirements. We also assume the existence of a reservation protocol, such as the one in [Z 93] which the end systems could use to communicate their resource requirements to the network. When admitting a new flow, the admission control ....

L. Breslau. Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks. PhD thesis, USC, 1995.

....used to route the request, and failure to establish a connection to the removal of the path from the cache. We chose to avoid such feedback to keep the system simple and the different components separate. A discussion of the effectiveness of these techniques in a similar context can be found in [16, 19]. All the above cache update policies require 6 choose a path for replacement to make room for a path with bandwidth b and length l for each path p in the cache if length(p) l and bandwidth(p) b return p if length(p) l and bandwidth(p) b mark p endfor for each path p in the cache ....

L. Breslau, Adaptive Source Routing of Real Time Traffic in Integrated Service Networks, Ph.D. Thesis, University of Southern California, December 1995

....of the network were heavily congested. These route oscillations are also due to similar traffic feedback [5] Several solutions to delay based oscillations have been proposed. These solutions use approaches such as constraining route selection [16] co ordination [33] and explicit routing [6]. Path vector protocols were developed [27,28] to suppress counting to infinity problems that occur in distance vector algorithms. These protocols use the shortest path route selection function and are therefore not susceptible to oscillations. BGP [26] and IDRP [15,23] add independent route ....

L. M. Breslau. Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks. PhD thesis, University of Southern California, December 1995.

....to the default path provided by current routing protocols. Developing an alternate path routing architecture for the Internet would allow applications to take advantage of these paths. Toward this end, some work has been done applying the alternate path approach to unicast Internet routing [17] [18]. However, alternate path routing for multicast remains an open area of research. In this paper we describe and evaluate two important components of alternate path multicast routing: 1) path computation and (2) path installation. Our primary concern in designing these components is the ability ....

L. Breslau, Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks, Ph.D. thesis, University of Southern California, December 1995.

....Section V, and propose new aggregation methods in Section VI. Finally, we draw conclusions in Section VII. II. RELATED WORK We briefly review routing protocol overhead reduction techniques, includingquantityand frequency reductions. Bothtopology aggregation [13] and limited update distribution [5] attempt to restrict update message delivery scope and belong to quantity reduction. However, in topology aggregation, the network nodes that do not receive detailed information can still receive aggregated information; while in limited update distribution, the network nodes either receive ....

....The method is theoretically simple but practically difficult, because both the bound and the distribution of errors in routing updates are usually difficult to predict under aggregation and thus it is difficult to estimate the probabilities. Limited update distribution is proposed by Breslau [5], including hop count limited flooding and reverse path update. In hop count limited flooding, a node distributes its state updates to the network nodes in its local area, within a certain hop count limitation. In reverse path update, a node distributes updates to the nodes that have active ....

[Article contains additional citation context not shown here]

L. M. Breslau. Adaptive source routing of real-time traffic in intergrated services networks. PhD thesis, University of Southern California, December 1995.

....of the network were heavily congested. These route oscillations are also due to similar traffic feedback [3] Several solutions to delay based oscillations have been proposed. These solutions use approaches such as constraining route selection [15] co ordination [31] and explicit routing [4]. Path vector protocols were developed [27, 28] to suppress counting to infinity problems that occur in distance vector algorithms. These protocols use the shortest path route selection function and are therefore not susceptible to oscillations. BGP [25] and IDRP [13, 22] add independent route ....

L. M. Breslau. Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks. PhD thesis, University of Southern California, December 1995.

....control algorithm at each switch enforces the queueing delay bound at that switch, assuming infinite buffer space. We leave the satisfaction of end to end delay requirements to the end systems. An end system could, for example, use adaptive source routing, such as the one proposed in reference [Bre95] to select a route that satisfies its end to end requirements. We also assume the existence of a reservation protocol, such as the one in [Z 93] which the end systems could use to communicate their resource requirements to the network. We require that there be compelling incentives, such as ....

L. Breslau. Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks. PhD thesis, USC, 1995.

.... application requirements, multimedia services are usually parameterized and quality of service(QoS) is defined for such parameterization [20,23,30] Recent work suggests that in order to guarantee an application s requested QoS, the network has to reserve resources for the duration of a connection [2,7,14,20]. The process of selecting a path connecting any two nodes in the network is referred to as routing [27] Resource reservation can only be made when routing has found a path with sufficient resources to meet the application s requirements without jeopardizing the QoS guarantees to already existing ....

L.M. Breslau, Adaptive Source Routing of Real-time Traffic in Integrated Services Networks, PhD Thesis, Department of Computer Science, Univ. of Southern California, 1995.

....a different delay bound. In our scheme, the admission control algorithm at each switch enforces the queueing delay bound at that switch. We leave the satisfaction of end to end delay requirements to the end systems. An end system could, for example, use adaptive source routing, such as the one in [Bre95] to select a route that satisfies its endto end requirements. We also assume the existence of a reservation protocol, such as the one in [Z 93] which the end systems could use to communicate their resource requirements to the network. Sources requesting service must characterize the ....

L. Breslau. Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks. PhD thesis, USC, 1995.

....using a resource reservation protocol. While much research has been devoted to the development of admission control, scheduling, and queueing mechanisms, relatively little attention has been paid to upgrading the routing infrastructure of the Internet to support these extensions. Previous work [Bre95, EZL 96] addressed some aspects of the problem for unicast routing. This paper is concerned with addressing the additional complexities that arise when considering multicast routing support for integrated services networks. Furthermore, we focus on interdomain routing, for which issues of ....

....The MORF mechanism may have a longer setup latency, but in return has the distinct advantage that it may prevent rather than just detect loops, as discussed above. 3. 2 Unicast Route Setup Previous work has studied the efficacy of using explicit routing to support unicast real time applications [Bre95] One way to use explicit routes to provide alternate paths or pinned routes is to embed the explicit route in an application s packets [EZL 96, HLFT94, DH95] Assuming the route will be inserted by the sender s nearest router, no modifications to applications will be needed. However, because ....

[Article contains additional citation context not shown here]

Lee Breslau. "Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks". PhD thesis, University of Southern California, December 1995.

....of the network were heavily congested. These route oscillations are also due to similar traffic feedback [4] Several solutions to delay based oscillations have been proposed. These solutions use approaches such as constraining route selection [14] co ordination [26] and explicit routing [5]. Path vector protocols were developed [22, 23] to suppress counting to infinity problems that occur in distance vector algorithms. These protocols use the shortest path route selection function and are therefore not susceptible to oscillations. BGP [21] and IDRP [13, 19] add independent route ....

L. M. Breslau. Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks. PhD thesis, University of Southern California, December 1995.

....scalability by reducing quantity of routing updates. In this section, we introduce two other methods that attempt to reduce the number of routing update messages by limiting the scope that the update messages are distributed. These methods are hop count limited flooding and reverse path update [6] ffl Hop count limited flooding. Updates can be reduced by limiting the number of hops they are allowed to travel. This method is motivated by the following observation: in a large network, the state of the local area is usually most important because the network users within a local area tend ....

....Hence the routing algorithm should be adjusted correspondingly to deal with coexistence of accurate and inaccurate information. Breslau s algorithm assigns a smaller weight to the inaccurate links and larger weight to the accurate links, so that the accurate links are more likely to be selected [6] Hop count limited flooding is in some sense similar to topology aggregation, in that both exploit spatial locality, i.e. accurate routing information is distributed within a certain scope. There are three major differences between the two schemes. 1) In hop count limited flooding, each ....

[Article contains additional citation context not shown here]

L. M. Breslau. Adaptive source routing of real-time traffic in intergrated services networks. PhD thesis, University of Southern California, December 1995.

No context found.

L.M. Breslau, Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks, doctoral dissertation, Computer 58

No context found.

L. Breslau, "Adaptive Source Routing of Real-Time Traffic in Integrated Services Networks," Ph.D. dissertation, University of Southern California, December 1995.

No context found.

L. Breslau, Adaptive Source Routing of Real Time Traffic in Integrated Service Networks, Ph.D. Thesis, University of Southern California, December 1995

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC