Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)最新文献

筛选
英文 中文
A scalable QoS routing architecture for real-time CSCW applications 用于实时CSCW应用的可扩展QoS路由体系结构
I. Matta, M. Eltoweissy
{"title":"A scalable QoS routing architecture for real-time CSCW applications","authors":"I. Matta, M. Eltoweissy","doi":"10.1109/RTTAS.1998.683197","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683197","url":null,"abstract":"Computer supported cooperative work (CSCW) has the potential of providing the environment needed for groups of diverse users to cooperate in real-time to achieve their common goals. This potential has been under-utilized due to the lack of cooperation between CSCW systems and the underlying network services to accommodate the dynamic behavior and varying quality-of-service (QoS) requirements of CSCW groups and the applications they use. To satisfy such requirements, QoS multicast routing should be employed. Unfortunately, current multicast services are inadequate for the traffic generated in CSCW environments. The authors present a CSCW-specific routing architecture that supports QoS requirements and is both scalable and robust. Scalability is needed to accommodate a large number of multicast groups and highly dynamic group membership and behavior, while robustness provides reliability and stable performance for each group during adaptation and in presence of the other existing groups. In the architecture, a router QoS manager, on behalf of a multicast routing manager, negotiates with host and CSCW-specific QoS managers for efficient resource utilization and guaranteed QoS delivery. The multicast routing manager switches between routing trees and algorithms as warranted by the changes in the characteristics and requirements of the CSCW systems running at the hosts. They present a class-based and a partial view-based method to scalability. They also present a centralized and a distributed method to establishing a group's QoS multicast path while providing robustness.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132839776","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Managing memory requirements in the synthesis of real-time systems from processing graphs 在处理图形的实时系统合成中管理内存需求
S. Goddard, K. Jeffay
{"title":"Managing memory requirements in the synthesis of real-time systems from processing graphs","authors":"S. Goddard, K. Jeffay","doi":"10.1109/RTTAS.1998.683188","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683188","url":null,"abstract":"In the past, environmental restrictions on size, weight, and power consumption have severely limited both the processing and storage capacity of embedded signal processing systems. Today, however, as increases in processor speed and capabilities continually out pace increases in memory densities and performance, processor capacity is no longer a major concern for many signal processing applications-memory usage is now the primary concern. We present techniques for managing the memory requirements of signal processing applications in the synthesis of a real time uniprocessor system from processing graphs. To demonstrate the effectiveness of our memory management techniques, we compare the memory requirements of a statically scheduled implementation of an INMARSAT (International Maritime Satellite) mobile receiver, with our dynamic scheduling techniques. The case study demonstrates that state of the art, static schedulers use over 300% more memory than our simple, preemptive, EDF scheduler for a large class of signal processing applications.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128754618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Fully distributed wireless MAC transmission of real-time data 完全分布式无线MAC实时数据传输
M. Markowski, A. Sethi
{"title":"Fully distributed wireless MAC transmission of real-time data","authors":"M. Markowski, A. Sethi","doi":"10.1109/RTTAS.1998.683187","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683187","url":null,"abstract":"As ad hoc wireless networks become more common, the need for real time services on these networks is emerging. However little work has focused on supporting real time requirements in such a demanding environment where the medium of transmission is noisy and protocols must be fully decentralized. Addressing this, we present a MAC protocol, preemptive in nature, that supports the transmission of hard, soft and non real time data. To guarantee stability even in overloaded conditions and still offer support for deadlines, we use splitting protocols. A protocol model is presented and analyzed, showing its performance under a wide range of offered loads with various fractions of real time types. We show that the protocol is easily implemented without making unreasonable hardware demands and so could be used as the basis for building real time services in an ad hoc wireless network.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"195 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115651596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Performance analysis of an RSVP-capable router 支持rsvp的路由器性能分析
T. Chiueh, A. Neogi, P. Stirpe
{"title":"Performance analysis of an RSVP-capable router","authors":"T. Chiueh, A. Neogi, P. Stirpe","doi":"10.1109/RTTAS.1998.683186","DOIUrl":"https://doi.org/10.1109/RTTAS.1998.683186","url":null,"abstract":"RSVP is a bandwidth reservation protocol that allows distributed real time applications such as videoconferencing software to make bandwidth reservations over packet switched networks. Coupled with real time scheduling mechanisms built into packet routers, the network guarantees to provide the reserved bandwidth throughout the lifetime of the applications. Although guaranteed services (S. Shenker et al., 1997) are of great value to both end users and carrier providers, their performance cost, due to additional control and data processing overhead, can potentially have a negative impact on the packet throughput and latency of the RSVP capable routers. The goal of the paper is to examine the performance cost of RSVP based on measurements from an industry strength RSVP implementation on a commercial IP router. The focus is on the detailed evaluation of the performance implications of various architectural decisions in RSVP, as well as the effectiveness of RSVP in the presence of network faults. We found that RSVP's control messages do not incur significant overhead in terms of processing delay and bandwidth consumption. However, the performance overhead of real time packet scheduling is noticeable in the presence of a large number of real time connections. In extreme cases, the performance guarantees of existing real time connections may not be kept, and some best effort packets are actually dropped, although the overall bandwidth requirement from these connections is smaller than the available link bandwidth.","PeriodicalId":193571,"journal":{"name":"Proceedings. Fourth IEEE Real-Time Technology and Applications Symposium (Cat. No.98TB100245)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134436582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 61
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书