Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications最新文献

筛选
英文 中文
Test Plan for Experiments to Provide Preliminary End-to-End Communication System Performance of an A 提供端到端通信系统初步性能的实验测试计划
M. Weibel
{"title":"Test Plan for Experiments to Provide Preliminary End-to-End Communication System Performance of an A","authors":"M. Weibel","doi":"10.1109/PCCC.1994.504157","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504157","url":null,"abstract":"in order for users to have a full understanding of how state-of-the-art satellite technology can improve the quality and reduce the costs of space-based communications, users must be given the system performance in terms they understand. For example, most users do not care how fast data can be routed through the satellite bus. The users want to know how fast they can send their data and thus the cost of sending a given amount of data. The experiments described in this test plan will provide a preliminary characterization of the Advanced Communication Technology Satellite (ACTS) from the user's perspective. The tests are designed, executed, and analyzed according to the American National Standards X3.102 and X3.141. The performance parameter values estimated in this preliminary characterization experiment will be used in the full characterization experiment to define failurehon-performance outcome thresholds.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124023429","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}
引用次数: 1
Index Concatenation: A New Reorganization Operation for Objectl Oriented Database Systems 索引连接:面向对象数据库系统的一种新的重组操作
A. Maamir, W. Grosky
{"title":"Index Concatenation: A New Reorganization Operation for Objectl Oriented Database Systems","authors":"A. Maamir, W. Grosky","doi":"10.1109/PCCC.1994.504120","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504120","url":null,"abstract":"In this paper we propose a new operation, called i!&Lsalu&\" , which can be applied to two existing indices and which improves the retrieval time with a minimal amount of extra overhead added to the update, insertion, and deletion costs. This operation considers only a subset of the workload and affects the database only locally. The costs of this operation are much lower than the cost of a global reorganization, Hence, this operation is a good candidate for a local reorganization which can take place between the times when global reorganizations occur. Index concatenation can also be applied at the time of a global reorganization as well.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123731305","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}
引用次数: 1
An Improved Resource Management Algol-ithm for Distributed Systems 一种改进的分布式系统资源管理算法
Kee Koon Chua, J. Carothers
{"title":"An Improved Resource Management Algol-ithm for Distributed Systems","authors":"Kee Koon Chua, J. Carothers","doi":"10.1109/PCCC.1994.504128","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504128","url":null,"abstract":"A new deadlock avoidance algorithm, the Distributed Banker’s algorithm, is presented for distributed resource allocation systems. The algorithm makes use of new corollaries and theorems that are also presented. In previous work, the authors developed an improved centralized deadlock algorithm, called the Modified Banker’s algorithm. The improved centralized algorithm is outlined. This centralized algorithm combined with results from Moser, is extended for use in distributed systems. Compared with Moser’s World Banker’s algorithm, the Distributed Banker’s algorithm is shown to be less restrictive in terms of the number of resources that a process can acquire from other processes and in the amount that a process can increase its maximum resource requirement.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126267537","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}
引用次数: 0
Combinatorial Effects of Bit and Byte Justification in SDH Networks SDH网络中位和字节校验的组合效应
H. Owen
{"title":"Combinatorial Effects of Bit and Byte Justification in SDH Networks","authors":"H. Owen","doi":"10.1109/PCCC.1994.504140","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504140","url":null,"abstract":"Existing Plesiochronous Digital Hierarchy networks synchronize signals by using fixed bit justification ratios. Justification bit opportunities are used a fixed percentage of the time in order to match the tributary to the transmission bit rate. Synchronous Digital Hierarchy Networks are different in that they use byte justifications instead of bit justifications. This important difference places new demands on SDH desynchronizers. These new demands are a result of the bit justification opportunities still present in lower order tributaries combining with the byte justification niechanisms provided in the SDH transmission. This paper examines the relative effects of bit justification in 2048 kbit/s signals in conjunction with the corresponding byte justification in SDH transmission networks to determine the dynamics of SDH network plesiochronous desynchronizer buffers. Additional effects which cause variations in desynchronizer buffers such as payload structures and pointer gaping effects are also examined.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121955621","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}
引用次数: 6
On the Regularity of Petri Net Languages Petri网语言的规律性研究
H. Yen
{"title":"On the Regularity of Petri Net Languages","authors":"H. Yen","doi":"10.1109/PCCC.1994.504134","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504134","url":null,"abstract":"Petri nets are known to be useful for modeling concurrent systems. Once modeled by a Petri net, the behavior of a concurrent system can be characterized by the set of all executable transition sequences, which in turn can be viewed as a language over an alphabet of symbols corresponding to the transitions of the underlying Petri net. In this paper, we study the language issue of Petri nets from a computational complexity viewpoint. We analyze the complexity of theregularity problem(i.e., the problem of determining whether a given Petri net defines an irregular language or not) for a variety of classes of Petri nets, includingconflict-free,trap-circuit,normal,sinkless,extended trap-circuit,BPP, andgeneralPetri nets. (Extended trap-circuit Petri nets are trap-circuit Petri nets augmented with a specific type ofcircuits.) As it turns out, the complexities for these Petri net classes range from NL (nondeterministic logspace), PTIME (polynomial time), and NP (nondeterministic polynomial time), to EXPSPACE (exponential space). In the process of deriving the complexity results, we develop adecomposition approachwhich, we feel, is interesting in its own right, and might have other applications to the analysis of Petri nets as well. As a by-product, an NP upper bound of the reachability problem for the class of extended trap-circuit Petri nets (which properly contains that of trap-circuit (and hence, conflict-free) and BPP-nets, and is incomparable with that of normal and sinkless Petri nets) is derived.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122084579","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}
引用次数: 16
A Self-Stabilizing Quickest Path Routing Algorithm 一种自稳定最快路径路由算法
A. Datta, B. Bourgon
{"title":"A Self-Stabilizing Quickest Path Routing Algorithm","authors":"A. Datta, B. Bourgon","doi":"10.1109/PCCC.1994.504123","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504123","url":null,"abstract":"This paper presents a self-stabilized algorithm for the quickest path problem. This algorithm will guarantee that an asynchronous distributed system will in finite t ime have an all-pairs quickest path routing table at each node i n finite t ime. Also, the system can handle node additions/deletions/perturbations without permanent eflects on the system.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122823892","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}
引用次数: 0
Design of correct communication protocols through analysis and synthesis 通过分析和综合设计正确的通信协议
Ye-In Chang, Jui‐Hsiang Chen
{"title":"Design of correct communication protocols through analysis and synthesis","authors":"Ye-In Chang, Jui‐Hsiang Chen","doi":"10.1109/PCCC.1994.504103","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504103","url":null,"abstract":"In this paper, we propose an algorithm to design correct protocols by applying both analysis and synthesis approaches. Given a protocol, we first apply the analysis approach to construct two machines which satisfy certain conditions. Then, we apply the synthesis approach to detect possible errors and provide the designer several choices to correct the errors. Moreover, the channel capacity can also be computed from the algorithm.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121030877","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}
引用次数: 0
A dual-channel binary hypercube network 双通道二进制超立方体网络
Qiang Li
{"title":"A dual-channel binary hypercube network","authors":"Qiang Li","doi":"10.1109/PCCC.1994.504125","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504125","url":null,"abstract":"This paper presents a deadlock-free direct binary hypercube network called the dual-channel hypercube. From a node to another of distance k, L + 1 simultaneous disjoint deadlockfree paths are provided. Large data sets can be partitioned and sent through multiple paths simultaneously, which implies a high inter-node bandwidth. In contrast, the e-cube routing algorithm in the traditional hypercube provides only one such path. Furthermore, a large number of deadlock-free routing choices from one node to another provides low routing latency and fault tolerance. Since the deadlock prevention is done by imposing routing restrictions, it can be used with wormhole routing providing every low routing latency. This paper first presents the dual-channel hypercube topology and the deadlock-free routing restrictions, and then concentrates on the high bandwidth aspect of the network. A multiple-path deadlock-free fixed routing algorithm is presented. A performance study of the dual-channel hypercube network under the fixed routing algorithm is also presented, which shows a significant increase of inter-node bandwidth.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128169241","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}
引用次数: 1
Next Generation Project Management Systems, Part 1: Needs and Motivation 下一代项目管理系统,第1部分:需求和动机
L. E. Heindel, V. Kasten, K. J. Schlieber
{"title":"Next Generation Project Management Systems, Part 1: Needs and Motivation","authors":"L. E. Heindel, V. Kasten, K. J. Schlieber","doi":"10.1109/PCCC.1994.504111","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504111","url":null,"abstract":"For the past several years, the authors have managed moderate-sized software development activities in a jobshop environment using various commercially available project management systems. Experiences with managing projects using these systems has led to a thorough understanding of their strengths and weaknesses, and an understanding of the need for extensions and enhancements in a next generation project management systems. This paper presents the requirements that were synthesized through these experiences. To demonstrate how a next generation project management system should perform, the authors developed a prototype compound application, P++, using commercially available highlevel, object-oriented tools combined with a small amount of procedural programming. Use of P+ to manage ongoing software development activities has confirmed the requirements for a next generation project management systems. The construction of P++ is discussed in Part 2 of this paper.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131282403","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}
引用次数: 4
Global Opportunities for North American Telecommunications Firms 北美电信公司的全球机遇
L. S. Pai, S. Pai
{"title":"Global Opportunities for North American Telecommunications Firms","authors":"L. S. Pai, S. Pai","doi":"10.1109/PCCC.1994.504109","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504109","url":null,"abstract":"reviewed and specific future courses of action in each market are suggested. Special American telecommunications firms in Europe and developments in the EEC are markets outside the United States of America discussed, Far Middle Eastem and and Canada* North American firms have Pacific Rim markets are analyzed with the experienced tm-”do~s growth in local special needs of each of these markets (e.g markets after deregulation. In the us, several development of Value Added Network companies mushroomed in an attempt to get a Services(VANS)) identified. Less developed piece of the market. Canada saw huge markets are reviewed in depth. The economies investments to improve the in these countries are growing rapidly. To telecommunications infrastructure. Today, contb~e this growth, there is a need to basic and advanced services are easily the telecommunications available to the man in North infrastructure immediately. The unique factors that govern these areas (lack of hard currency, nuances of dealing with America. However, these markets have matured and firms find their profits squeezed. governments etc.) are also presented. They need to turn to markets outside North This paper analyzes opportunities for attention is given to the new borderless","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131584786","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}
引用次数: 0
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学术文献互助群
群 号:481959085
Book学术官方微信