Sender sharing groups in real-time communication /
admission probability, policing time and admission
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1998.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | admission probability, policing time and admission applications, resources must be allocated along the be conserved by grouping such connections into Sender communication, where guarantees may be in terms of a discussed in this thesis, is a mechanism for resource Distributed real-time systems require guaranteed ographics. does not violate this agreement. We discuss the employed to conserve resources. Sender Sharing Groups, from the sender are shared. Whenever connections are in a Sender Sharing Group. We also discuss the design known to not carry data simultaneously, resources can many connections, even though they may not be maximum delay, minimum bandwidth and so on. In order mechanism of establishing and tearing down connections more than a predefined number of connections at any of a two- level (independent and shared) politer, one time and the system guarantees the promised path of connections. If resources are allocated for performance for the connections, as long as the sender required for policing of sharing group data. The resources occurs. Resource sharing techniques are Sharing Groups. Sharing Groups. The sender agrees to send over not sharing, where resources along the path of connections simultaneously sending data, over allocation of time are measured in cases with and without Sender to be able to provide these guarantees to |
|---|---|
| Item Description: | "Major subject: Electrical Engineering". Vita. |
| Physical Description: | x, 56 leaves : illustrations ; 28 cm. Also available online. |
| Bibliography: | Includes bibliographical references: pages 53-55. |