| T. Plagemann and B. Plattner. CoRA: A heuristic for protocol configuration and resource allocation. In Proceedings of the Workshop on Protocols for High-Speed Networks. IFIP, August 1994. |
....flow middleware. Event based middleware such as Echo [7, 11] provides a type safe and e# cient way of communicating data and control information in a distributed and heterogeneous environment. A higher level Infopipe layer can also be built on top of these platforms. Ensemble [34] and DaCaPo [27] are protocol frameworks that support the composition and reconfiguration of protocol stacks from modules. Both provide mechanisms to check the usability of configurations and use heuristics to build the stacks. Unlike these frameworks for local protocols, Infopipes use a uniform abstraction for ....
T. Plagemann and B. Plattner. CoRA: A heuristic for protocol configuration and resource allocation. In Proceedings of the Workshop on Protocols for High-Speed Networks. IFIP, August 1994.
....restricted to one language and the 3 potential performance penalties and unpredictability of a virtual machine. Blair et al. proposed a procedural approach to reflection as a general design principle for a middleware architecture [2] Modular protocol frameworks such as Ensemble [11] or DaCaPo [8] support the composition and reconfiguration of protocol stacks from modules. Both provide mechanisms to check the usability of configurations and use heuristics to build the stacks. Unlike these frameworks for local protocols, Infopipes use a uniform abstraction for handling information flow from ....
T. Plagemann and B. Plattner. CoRA: A heuristic for protocol configuration and resource allocation. In Proceedings of the Workshop on Protocols for High-Speed Networks. IFIP, August 1994.
....for its lower layer. In effect, this leads to configurations guided by local views only. Instead of factoring out the mapping policy, some systems also try to increase their flexibility based on more generalised mapping policies. DA CAPO, for instance, facilitates a heuristic called CORA [10] to derive suitable protocol graph configurations from a declarative specifications in real time. While in this way the sequence of local mappings between adjacent protocol components is replaced by a global mapping, it remains questionable whether a single hard coded heuristic will prove ....
T. Plagemann, A. Gotti, and B. Plattner. CoRA --- A Heuristic for Protocol Configuration and Resource Allocation, pages 103--119. In Neufeld and Ito [9], 1995.
....developed independently from the MSS approach [40] the ETHMICS architecture bears many similarities. For ATM oriented networks, an object oriented framework serving as a distributed kernel operating system, with QoSdetermined resource allocation has been developed [41] ffl The DaCaPo System [42] is based on three layer model that splits communication systems into the layers A (application oriented) C and T (basic transport infrastructure) Layer C is decomposed into protocol functions instead of sub layers. C protocols are configures dynamically (i.e. at connection setup) according to ....
T. Plagemann et al., "Cora - a heuristic for protocol configuration and resource allocation," Proceedings of the 4th IFIP International Workshop on Protocols for High Speed Networks, 1994.
....satisfied. The bottom layer called the T layer represents the existing and connected transport infrastructures and is determinant in the number of protocol graphs which can be configured, while the approach of O Malley and Peterson presented above is constrained to only one protocol graph. In [Plage 94] Plagemann and al. propose CoRA, a heuristic for the stack reconfiguration in Da CaPo. This heuristic is based on the classification of protocol entities and their resource usage. The aim of the approach is to ensure that the requirements of the application are met in a very fast way. All these ....
Plagemann T., Gotti A., Plattner B., CoRA --- A Heuristic for Protocol Configuration and Resource Allocation, Submitted to IFIP Fourth International Workshop on Protocols for High-Speed Networks, Vancouver, Canada, Aug. 10--12, 1994.
.... real time scheduler packet, Unix, Solaris real time scheduler real time scheduler QoS Guarantees yes yes limited yes yes Scalability for Multicasting no no limited Run time Flexibility yes no yes no yes Architectural Extensibility no yes yes yes References [5] 6] 15] 16] [17], 18] 19] 22] 11] 2] 3] more, performance guarantees of the network in terms of end to end connectivity and QoS guarantees are extended to cover not only the transport of data, but also by processing data within end systems. Communication services obtained enable advanced multimedia ....
T. Plagemann, A. Gotti, B. Plattner: "CoRA - A Heuristic for Protocol Configuration and Resource Allocation", IFIP Fourth International Workshop on Protocols for High-Speed Networks, Vancouver, Canada, August 1994. pp 85-102.
....or degrees of error detection and correction. For protocol configuration each protocol function in a protocol graph must be instantiated by one of its modules. Naturally, different protocol configurations support different QoS. 1. Some of the evaluation results are already published [3, 4]. 2 2 The realization of the three layer model is characterized by four co operating active entities and a database (Figure 1) The heuristic for Configuration and Resource Allocation (CoRA) 3] determines appropriate protocol configurations and QoS at runtime. The connection ....
....support different QoS. 1. Some of the evaluation results are already published [3, 4] 2 2 The realization of the three layer model is characterized by four co operating active entities and a database (Figure 1) The heuristic for Configuration and Resource Allocation (CoRA) [3] determines appropriate protocol configurations and QoS at runtime. The connection management negotiates a common protocol configuration and QoS for a layer C connection [4] The resource manager [7, 8] provides an efficient runtime environment for Da CaPo protocols. The resource manager ....
Plagemann, T., Gotti, A., Plattner, B.: "CoRA - A Heuristic for Protocol Configuration and Resource Allocation", to be published in: IFIP Fourth International Wokshop on Protocols for High-Speed Networks, Vancouver, Canada, August 1994, pp. 85-102
....protocol configuration in Da CaPo. The setQoSParameter method propagates the QoS specification also to the transport layer, i.e. Da CaPo. Based on the applications QoS specification, it is possible to select the most appropriate protocol configuration within a few microseconds (or less) see [8] for a detailed description. The Da CaPo module that implements the access to a particular network is able to reserve the required amount of resources if the network supports resource reservations, like ATM or RSVP IP. In other words, the first MULTE ORB prototype enables application Figure 4: ....
Plagemann, T., Gotti, A., Plattner, B.: CoRA - A Heuristic for Protocol Configuration and Resource Allocation, IFIP Fourth International Workshop on Protocols for High-Speed Networks, Vancouver, Canada, August 1994, pp. 85-102
....(IP) and via Asynchronous Transfer Mode (ATM) Only the ATM network supports resource reservation and QoS. Furthermore, the Resource Reservation Protocol (RSVP) 45] and Internet Protocol Version 6 (IPv6) 11] are considered in current developments. Admission control and QoS mapping are merged [35], because functionality of Da CaPo protocols and SHORE mainly determines the necessary resources. The available resources in turn determine which functions can be used. For example, the usage of a software compression mechanism in Da CaPo increases the CPU utilization and decreases the necessary ....
....set if it has no hard constraints and accepts every value. Weight functions describe objectives of the application by defining the importance of the particular requirement. The application requirements are passed to layer C where the heuristic method CoRA (Configuration and Resource Allocation) [35] performs together with a connection management protocol the QoS negotiation. Da CaPo supports unilateral and bilateral negotiation. In unilateral negotiation, the CoRA entity at the initiators side makes a coarse and optimistic admission control. If there are probably enough resources ....
[Article contains additional citation context not shown here]
Plagemann, T., Gotti, A., Plattner, B.: "CoRA - A Heuristic for Protocol Configuration and Resource Allocation" in: Neufeld, G., Ito, M. (Editors), "Protocols for High-Speed Networks IV", IFIP, Chapman & Hall, 1995, pp. 103-119
....range of application requirements on top of current networks (ranging from slow modem lines up to gigabit networks) without adding overhead in form of unnecessary functionality for multiple combinations of application requirements and networks. Communication subsystems like ADAPTIVE [1] Da CaPo [2, 3, 4], F CSS [5, 6] HOPS [7] and O Malley and Petersons approach [8, 9] try to solve this problem by introducing highly flexible communication subsystems and a protocol configuration approach. The main principles of protocol configuration are decomposition and configuration. Complex protocols are ....
....performance issues of protocol configuration The performance of a protocol can be only measured during the lifetime of an association that is realized by the protocol. Depending on the phase of the associations lifetime (association establish 2. Some of the evaluation results are published in [2, 3]. 3 ment, association established, and association release) different parameters are of importance to charge protocol performance. In the establishment and release phase establishment delay and release delay are important; for established associations the parameters throughput, end to end ....
[Article contains additional citation context not shown here]
Plagemann, T., Gotti, A., Plattner, B.: "CoRA - A Heuristic for Protocol Configuration and Resource Allocation", IFIP Fourth International Workshop on Protocols for High-Speed Networks, Vancouver, Canada, August 1994, pp. 85-102
....of the application by defining the importance of the particular requirement. The application requirements are passed to layer C where the Max f 1 x ( f 2 x ( f k x ( subject to: g i x ( 0 i = 1, m heuristic method CoRA (Configuration and Resource Allocation) [45] performs together with a connection management protocol the QoS negotiation. Da CaPo supports unilateral and bilateral negotiation. In unilateral negotiation, the CoRA entity at the initiators side makes a coarse and optimistic admission control. If there are probably enough resources ....
Plagemann, T., Gotti, A., Plattner, B.: "CoRA - A Heuristic for Protocol Configuration and Resource Allocation" in: "Protocols for High-Speed Networks IV", Neufeld, G., Ito, M. (Editors), IFIP, Chapman & Hall, 1995, pp. 103-119
No context found.
T. Plagemann and B. Plattner. CoRA: A heuristic for protocol configuration and resource allocation. In Proceedings of the Workshop on Protocols for High-Speed Networks. IFIP, August 1994.
No context found.
Plagemann T, Plattner B. CoRA: A heuristic for protocol configuration and resource allocation. In Proceedings of the Workshop on Protocols for High-Speed Networks. IFIP, 1994; .
No context found.
T. Plagemann and B. Plattner. CoRA: A heuristic for protocol configuration and resource allocation. In Proceedings of the Workshop on Protocols for High-Speed Networks. IFIP, August 1994.
No context found.
Plagemann T., Gotti A., Plattner B., CoRA --- A Heuristic for Protocol Configuration and Resource Allocation, Submitted to IFIP Fourth International Workshop on Protocols for High-Speed Networks, Vancouver, Canada, Aug. 10--12, 1994.
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