C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267--283, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a monitoring function, hence making the feedback to applications more precise. This is also a form of adaptive control, in that the control architecture uses information about resource revocation to invoke application level adaptation mechanisms. The dynamic connection management (DCM) scheme [Parris94] uses connection rerouting to maintain QoS reservations. The lack of scalability of the DCM approach is addressed by trying to limit the extent of dynamic recon guration of a connection to a small number of network nodes [Bettati96] These two connection management schemes are examples of ....

Colin Parris, Hui Zhang, and Domenico Ferrari. Dynamic Management of Guaranteed Performance Multimedia Connections. ACM/Springer-Verlag Multimedia Systems Journal, 1:267-283, 1994.

....and reconfiguration options. In Section 6 we present preliminary results with the visual tracking application. Section 7 concludes the paper and discusses future work. 2 Related Work The field of QoS Adaptation in distributed multimedia applications has been studied by various previous work. In [13], a graceful adaptation service dynamically manages the QoS of real time communications by changing the parameter configurations in the network with no or limited disruption. It is implemented using mechanisms such as dynamic re routing and load balancing. In contrast to our work, it focuses ....

C. Parris, G. Ventre, and H. Zhang. Dynamic Management of Guaranteed-PerformanceMultimedia Connections. ACM Springer-Verlag Multimedia Systems Journal, 1994.

....time. However, the characteristic of 1 persistent CSMA CD networks with BEB is quite different from their result with the non persistent version. 1.2.5 QoS Routing There are basically two approaches to QoS routing: source directed routing and distributed routing. In the source directed approach [30, 55, 67, 69, 102], the source switch or router selects a path based on connection traffic parameters and available resources in the network. This approach can be refined into static or dynamic routing, depending on whether or not load information at each local node is used for path computation. The former uses ....

....be distributed throughout the network, so that any source can have access to the correct information on resources available in the network. The information distributed is often called link state. By applying either Dijkstra s shortest path algorithm [91] or Bellman Ford shortest path algorithm [67] based on link state information, one can find a qualified route for the requested connection. Examples of source directed routing protocols are the ATM Forum s PNNI standard [69] and a QoS extension to the OSPF protocol named QOSPF [30, 102] Because of its high operational overhead in ....

C. Parris, H. Zhang, and D. Ferrari, "Dynamic management of guaranteed performance multimedia connections," Multimedia Systems Journal, vol. 1, pp. 267--283, 1994.

....4.3 An Approximation Algorithm The proposed maxmin routing algorithm requires the knowledge of the routes of all existing flows. When flows join and leave the network frequently, the communication overhead for collecting the routes of all flows will be excessively high. Many routing algorithms [16, 19, 20] rely on the state information of the links in the network, instead of that of the flows. The state of the links can be collected and maintained at each node by the link state algorithm [18] which has been implemented on many internetworks. In the following, we approximate the proposed maxmin ....

C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267--283, 1994. 14

.... resources [8,11] Even when protocols and mechanisms such as RSVP and ATM that provide QoS (Quality of Service) assurances are available to meet the demands of NetMM applications, researchers have explored the use of adaptation in the presence of resource constraints and changes in resource usage [8,12,16,17]. Given the positive effects of adaptation on application quality, we decided to explore how application writers can add adaptivity to applications without having to worry about the intricacies of adaptation. In particular, this paper examines how NetMM applications that adapt to changing network ....

Parris, C., Zhang H., and Ferrari, D., "Dynamic Management of Guaranteed Performance Multimedia.Connections," ACM Journal of Multimedia Systems, Apr. 1993.

....studied and there have been different methods proposed to solve the problem [8, 2] In addition, dynamically increasing or decreasing bandwidth requires a signaling mechanism. Such signaling protocols exist. For example, the Dynamic Connection Management scheme in the Tenet Protocol Suite [14] or the ATM signaling protocol can be used for this purpose [10] Therefore, we can assume that the rate transition can be effectively detected and dynamical bandwidth increase or decrease can be effectively accomplished, so in the following, we focus only on the issue of dynamic bandwidth ....

C. Parris, H. Zhang and D. Ferrari, "Dynamic management of guaranteed performance multimedia connections ", Multimedia Systems Journal, 1:267--283, 1994.

....to model a user accessing multimedia documents, with some think time between accesses. We can use statistical distributions to control the duration and magnitude of these periods, as well as augment the current model with multiple busy period types. A similar application model is used in [5]. 3 This stream is a segment of the movie Jurassic Park, and was obtained from: ftp info3.informatik.uni wuerzburg.de pub MPEG . Figure shows the traffic stream generated by the Multimedia Browser model and used in our evaluation. Transmission Index Bytes 0 200 400 600 800 Figure 7: ....

.... Res Time Cost 0 2 4 6 8 = # # # # # Figure 9: Video Clip connection oriented platforms such as ATM has driven much of the effort; two typical ATM examples are [4] and [1] The Tenet group s Dynamic Connection Management (DCM) scheme [5] provides dynamic modification of service parameters using network support. The DCM paper describes additions to the Tenet protocol suite to support dynamic changes. Bansal et al. 1] have developed an ATM Service Manager (ASM) which is intended to provide dynamic renegotiation, traffic behavior ....

C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. ACM Multimedia, 1995.

....allocation can lead to potential waste of bandwidth. Therefore, if there are multiple time scales in traffic, then dynamic bandwidth dimensioning is required to alleviate the waste. With the support of appropriate mechanisms for signaling and detecting state transition of the traffic process [2, 5, 6, 10], we can simply focus on each subspace of the traffic process separately for bandwidth allocation. It may not be convenient to use the performance measures defined for individual ON intervals directly for transient loss guarantee. Instead, we consider some stochastic upper bounds on the transient ....

C. Parris, H. Zhang and D. Ferrari, "Dynamic management of guaranteed performance multimedia connections ", Multimedia Systems Journal, 1:267--283, 1994.

....means asking for more or less system resources for a connection than the one currently committed. Renegotiation may be performed either when the application using the connection explicitly requests it or when it is triggered by the QOS monitoring system due to sustained QOS violations. In [11], renegotiation is also performed during the connection setup phase. In order to efficiently perform renegotiations, resource interfaces must allow immediate changes in resource reservation, i.e. without the need to release the resource first. Furthermore, renegotiation has the potential to ....

Parris, C., Zhang, H., and Ferrari, D., "Dynamic Management of Guaranteed-Performance Multimedia Connections." Multimedia Systems, No. 1, 1994, pp. 267-283.

....routing. Ma and Steenkiste [8] studied and compared four bandwidth constrained sourcerouting algorithms which select the widest shortest path, the shortest widest path, the dynamicalternative path and the shortest dist(P , 1) path, respectively. The Tenet s dynamic resource management scheme [13] provides source routing by using a modified version of the Bellman Ford algorithm, which finds a delay bounded path with the least hops. The delay constrained least cost (DCLC) routing problem, i.e. finding a delay bounded path with the minimum cost, is NP complete [5] A centralized algorithm ....

C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267--283, 1994.

....problems In general, resource overload is solved by application and user defined policies. The system must detect (end to end) QoS violations by using some monitoring mechanisms, and follow the policies to solve, or react to, overload situations. Most existing approaches [Top 90, Gil 91, Yin 91, Par 94, Tob 92] for managing QoS violations have one or more of the following characteristics: 1) they are restricted to the communication sub system; 2) they react only after the occurrence of end to end QoS violations which means that the problem is passed on to the user or the application; or (3) ....

....coding parameters and to vary the output rate. This allows the sources to dynamically adjust their maximum transmission rates to match the available resources. A significant contribution on QoS adaptation has come from the Tenet group at the University of California at Berkeley. Paris et al. Par 94] propose a network adaptation scheme (called graceful adaptation service) to increase the adaptivity of real time networks. Graceful adaptation service allows to dynamically manage the QoS of real time communications by changing the parameters that specify it during the lifetime of the ....

[Article contains additional citation context not shown here]

C.Parris, G.Ventre and H.Zhang, Dynamic Management of Guaranteed-Performance Multimedia Connections, Multimedia Systems Journal, August 1994

....studied and there have been different methods proposed to solve the problem [9, 3] In addition, dynamically increasing or decreasing bandwidth requires a signaling mechanism. Such signaling protocols exist. For example, the Dynamic Connection Management scheme in the Tenet Protocol Suite [15] or the ATM signaling protocol can be used for this purpose [11] Therefore, we can assume that the rate transition can be effectively detected and dynamical bandwidth increase or decrease can be effectively accomplished, so in the following, we focus only on the issue of dynamic bandwidth ....

C. Parris, H. Zhang and D. Ferrari, "Dynamic management of guaranteed performance multimedia connections ", Multimedia Systems Journal, 1:267--283, 1994.

....is assumed to be static in the sense that the allocated bandwidth is fixed for the duration of the stream. In dynamic bandwidth allocation, each stream would be free to adjust its allocation (or to have it adjusted by the network controller) in response to varying system loads [KL94, CKLV95, PZF94, DHH 94] This would require more intelligence on the part of the network controller and the stream server(s) and would require the video server to be able to adjust the bit rate of the transmitted stream in real time. We therefore believe dynamic allocation to be less widely applicable than ....

Colin Parris, Hui Zhang, and Domenico Ferrari. Dynamic management of guaranteed-performance multimedia connections. Multimedia Systems, 1:267-- 283, 1994.

....5 An Approximation Algorithm The proposed maxmin routing algorithm requires the knowledge of the routes of all existing flows. When flows join and leave the network frequently, the communication overhead for collecting the routes of all flows will be excessively high. Many routing algorithms [14, 17, 20] rely on the state information of the links in the network, instead of that of the flows. The state of the links can be collected and maintained at each node by the link state algorithm [16] which has been implemented on many internetworks. In the following, we approximate the proposed maxmin ....

C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267--283, 1994.

....on different connections independently when determining their resource requirements. One technique to improve utilization (and hence the connection acceptance rate) is to measure the actual traffic characterization of individual connections and to modify their traffic characterizations dynamically [10]. Another technique uses performance measurements over aggregations of connections to predict future performance [1] The first approach still over estimates aggregate resource requirements, since it fails to capture the important relationships between connections (e.g. in a conference, usually ....

Colin Parris, Hui Zhang, and Domenico Ferrari. Dynamic management of guaranteed performance multimedia connections, April 1993. to appear in ACM Journal of Multimedia Systems.

....we provide an overview for three key resource management algorithms and the interaction between them. 4. 1 Admission Control and Resource Conflicts Admission control converts end to end QoS requirements into per hop requirements and tests for the availability of resources at intermediate nodes [6]. It is conducted for both a newly arriving flow and a handoff flow. For flows with QoS bound specification, the network is only committed to provide assurance for the QoS lower bound, and provides better service beyond the lower bound depending upon the dynamic availability of the network ....

C. Parris, H. Zhang and D. Ferrari, "Dynamic management of guaranteed performance multimedia connections", Multimedia Systems Journal, vol. 1, 1994.

....is an end point architecture for provision of real time guarantees in networked multimedia systems (NMS) OMEGA achieves global application to application guarantees. We assume in this paper that network management and transmission protocols for provision of guarantees in intermediate nodes exist [PZF94, CCH93, KS95] and concentrate on the role and elements of OMEGA. Since OMEGA functions can be partitioned into distributed and local, we model the system in two parts, 1) the communication model, and (2) the resource model at the end points. 2.1 Communication Model The communication system is ....

C. Parris, H. Zhang, and D. Ferrari. Dynamic Management of Guaranteed Performance Multimedia Connections. Multimedia Systems, 1(6), 1994.

....connections independently when determining their resource requirements. One technique to improve utilization (and hence the connection acceptance rate) is to measure the actual traffic characterization of individual connections and to modify the connection traffic characterization dynamically [16]. Another technique uses performance measurements over aggregations of connections to predict future performance [2] The first approach still over estimates aggregate resource requirements, since it fails to capture the important relationships between connections (e.g. in a conference, usually ....

Colin Parris, Hui Zhang, and Domenico Ferrari. Dynamic management of guaranteed performance multimedia connections, April 1993. to appear in ACM Journal of Multimedia Systems.

....and reconfiguration options. In Section 6 we present preliminary results with the visual tracking application. Section 7 concludes the paper and discusses future work. 2 Related Work The field of QoS Adaptation in distributed multimedia applications has been studied by various previous work. In [13], a graceful adaptation service dynamically manages the QoS of real time communications by changing the parameter configurations in the network with no or limited disruption. It is implemented using mechanisms such as dynamic re routing and load balancing. In contrast to our work, it focuses ....

C. Parris, G. Ventre, and H. Zhang. Dynamic Management of Guaranteed-PerformanceMultimedia Connections. ACM Springer-Verlag Multimedia Systems Journal, 1994.

....of this new channel. This queueing delay is calculated by using the admissions tests provided in Section 3.2 and Section 4.2.1 to determine the minimum queueing delay that this link can offer a connection with these traffic characteristics. The details of the routing algorithm can be found in [10]. The administrative constraints (e.g. resource sharing) are achieved by modifying the weights associated with the edges (i.e. links) of the graph before applying the algorithm. With an administrative parameter value of 0 and 1, no adjustment is made to the edges of the graphs. With a value of 2 ....

Colin Parris, Hui Zhang, and Domenico Ferrari. Dynamic management of guaranteed performance multimedia connections. ACM Multimedia Journal, (to appear), 1994.

....the observed behavior from the perspective of the end application. The receive bandwidth for both RMTP RTIP vic sessions are unaffected by each other as well as the IP data loading that occurs during the sessions. 1 The local delay bound may be changed by the Dynamic Channel Management algorithm [10]. Without loss of generality, we assume that there is no DCM for the purpose of this discussion. 4.3 Qualitative Investigations The purpose of the Tenet protocol suite is to provide end toend performance guarantees to network clients that require such a service. The final evaluation of the ....

C. Parris, H. Zhang, and D. Ferrari. Dynamicmanagement of guaranteedperformancemultimedia connections, April 1993. to appear in ACM Journal of Multimedia Systems.

....adjust the Q factor of its compression algorithm and lower the transmission rate, which will gracefully lower the perceptual quality of the compressed video. Renegotiations are accomplished via the signaling mechanism such as the Dynamic Connection Management scheme in the Tenet Protocol Suite [11] or via an ATM signaling protocol in an ATM network. We name this scheme REnegotiated Deterministic Variable Bit Service or RED VBR. The scheme can be better understood by considering the timescales that are important for network control as shown in Figure 3. Packet service disciplines at the ....

C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267--283, 1994.

....adjust the Q factor of its compression algorithm and lower the transmission rate, which will gracefully lower the perceptual quality of the compressed video. Renegotiations are accomplished via the signaling mechanism such as the Dynamic Connection Management scheme in the Tenet Protocol Suite [28] or via an ATM signaling protocol in an ATM network. We name this scheme REnegotiated Deterministic Variable Bit Service or RED VBR. us. ms. sec. min. Trip Service Round Renegotiation Connection Lifetime Packet Figure 3: Important Control Time Scales RED VBR can be better understood by ....

C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267--283, 1994.

....adjust the Q factor of its compression algorithm and lower the transmission rate, which will gracefully lower the perceptual quality of the compressed video. Renegotiations are accomplished via the signaling mechanism such as the Dynamic Connection Management scheme in the Tenet Protocol Suite [13] or via an ATM signaling protocol in an ATM network. us. ms. sec. min. Trip Service Round Renegotiation Connection Lifetime Packet Figure 2: Important Control Time Scales RED VBR can be better understood by considering the time scales that are important for network control as shown in Figure 2. ....

C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267--283, 1994.

No context found.

C. Parris, H. Zhang, and D. Ferrari. Dynamic management of guaranteed performance multimedia connections. Multimedia Systems Journal, 1:267--283, 1994.

First 50 documents

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