1997 IEEE International Performance, Computing and Communications Conference最新文献

筛选
英文 中文
The design and implementation of call/connection control software in ATM switching system for multimedia services 多媒体业务ATM交换系统呼叫/连接控制软件的设计与实现
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581526
Ji-Hoon Jeong, Moon-Kyun Oh, Han-Kyoung Kim
{"title":"The design and implementation of call/connection control software in ATM switching system for multimedia services","authors":"Ji-Hoon Jeong, Moon-Kyun Oh, Han-Kyoung Kim","doi":"10.1109/PCCC.1997.581526","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581526","url":null,"abstract":"The call/connection control functions, capable of diverse call/connection, are one of the most important capability in ATM switching system for multimedia services. We describe the design and implementation technology of call/connection control based on the scenario socket, process instance identifier (PID) succession, call/connection processing system library, and the data configuration method for multimedia services. By using these in the ATM switching system development, we can provide urgently demanded B-ISDN services and adopt new diverse services easily.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115315292","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
Connection admission control for PRMA/DA wireless access protocol PRMA/DA无线接入协议的连接允许控制
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581553
J. G. Kim, I. Widjaja
{"title":"Connection admission control for PRMA/DA wireless access protocol","authors":"J. G. Kim, I. Widjaja","doi":"10.1109/PCCC.1997.581553","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581553","url":null,"abstract":"Next generation wireless communication systems will handle a wide range of services such as voice, video, and data. In this multi-service scenario, major technical issues are concerned with the selection of a suitable media access control (MAC) protocol and provision of adequate quality of service (QoS) to network users. We introduce a wireless media access control (MAC) protocol which is capable of transporting broadband traffic and providing seamless connectivity to ATM (asynchronous transfer mode) networks. Our protocol, having an air interface comparable to ATM, adopts a dynamic channel allocation scheme which enables expeditious network access and utilizes bandwidth resource efficiently for a mixed voice/video/data traffic environment. Simulation results presented here show the effectiveness of wireless access scheme, QoS provision, and dynamic channel allocation in terms of key performance metrics such as: throughput, cell loss-rate, call access delay, and cell transmission delay.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114913009","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
A case study of authenticated and secure file transfer: the Iowa Campaign Finance Reporting System (ICFRS) 认证和安全文件传输的案例研究:爱荷华州竞选财务报告系统(ICFRS)
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581560
N. Hastings, J. Whitmer, J. Davis, D. Jacobson
{"title":"A case study of authenticated and secure file transfer: the Iowa Campaign Finance Reporting System (ICFRS)","authors":"N. Hastings, J. Whitmer, J. Davis, D. Jacobson","doi":"10.1109/PCCC.1997.581560","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581560","url":null,"abstract":"The Iowa Campaign Finance Disclosure project (ICFD) is a pilot effort to develop a simple and secure way for candidates running for public office or Political Action Committees (PACs) to disclose required financial information. In the prototype system described in this paper, a candidate or PAC can transmit information to the Iowa Ethics and Campaign Disclosure Board (IECDB) in the state capitol using a PC running specialized communication software as part of the Iowa Campaign Finance Reporting System (ICFRS). After the identity of the candidate or PAC has been authenticated, the information is used to update a database made available to the press and public. The communication software described in this paper employs an interesting mix of cryptography and digital signatures to ensure proper authentication. Two constraints, namely, the desire to keep the process of sending data simple, and having to interface to an established data processing shop, are discussed along with the impact on the robustness of the communication software.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123684736","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
Buffer control scheme in multimedia synchronization 多媒体同步中的缓冲控制方案
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581558
A. Hác, C. X. Xue
{"title":"Buffer control scheme in multimedia synchronization","authors":"A. Hác, C. X. Xue","doi":"10.1109/PCCC.1997.581558","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581558","url":null,"abstract":"We present a complete synchronization scheme for multimedia information systems. The playout schedule is ensured by setting medium retrieval schedule based on the suitable control time at each different medium servers and by providing a suitable buffer for each medium at the client side. Because of the asynchronous nature of the network and the host operating system, certain buffer management at client side is also needed. We test three buffer control algorithms: switch, first order delay, and second order delay.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"32 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114026511","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
An implementation of MLS on a network of workstations using X.500/509 MLS在使用X.500/509的工作站网络上的实现
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581562
J. Davis, D. Jacobson, S. Bridges, K. Wright
{"title":"An implementation of MLS on a network of workstations using X.500/509","authors":"J. Davis, D. Jacobson, S. Bridges, K. Wright","doi":"10.1109/PCCC.1997.581562","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581562","url":null,"abstract":"We describe a project whose goal is to provide a secure distributed access control mechanism for user tasks in a heterogeneous network of computing resources. This is accomplished by implementing a UNIX-based multi-level security (MLS) scheme where users and resources are labeled with a security level and a group. Access control is enforced by an access list server that uses X.500 directory and X.509 authentication services. Groundwork is laid for the next step of the project, which is to extend the security services for migrating tasks so that workstations are protected from security threats posed by incoming tasks, and also to protect tasks from threats originating from the workstation.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"31 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126231406","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
Fault-tolerant hierarchical routing 容错分层路由
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581504
G. Alari, A. Datta, J. Derby, J. Lawrence
{"title":"Fault-tolerant hierarchical routing","authors":"G. Alari, A. Datta, J. Derby, J. Lawrence","doi":"10.1109/PCCC.1997.581504","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581504","url":null,"abstract":"This paper presents a self-stabilizing, fault-tolerant hierarchical routing algorithm. Hierarchical routing algorithms are less expensive algorithm than traditional all-pairs routing algorithms (i.e., lower memory requirements, faster routing table lookups, and less costly broadcast). The algorithm presented here retains these benefits yet, maintains routing capability between all pairs of connected nodes, even in the presence of faults, such as link/node failures and repairs and corruption of program variables. Additionally, this algorithm solves the problem of area partition where nodes that are defined to be in the same subset of the network become isolated by link or node failure. Being self-stabilizing, starting from an arbitrary state the protocol is guaranteed to reach a configuration with routing tables containing valid entries in a finite time. The protocol automatically updates the shortest paths in the face of dynamically changing link weights. The protocol dynamically allocates/deallocates storage for the routing information as the network size changes. The algorithm works on an arbitrary topology and under a distributed daemon model.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130156105","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
Voting without version numbers 没有版本号的投票
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581496
D. Long, J. Paris
{"title":"Voting without version numbers","authors":"D. Long, J. Paris","doi":"10.1109/PCCC.1997.581496","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581496","url":null,"abstract":"Voting protocols are widely used to provide mutual exclusion in distributed systems and to guarantee the consistency of replicated data in the presence of network partitions. Unfortunately, the most efficient voting protocols require fairly complex metadata to assert which replicas are up-to-date and to denote the replicas that belong to that set. We present a much simpler technique that does not require version numbers and maintains only n+log(n) bits of state per replica. We show, under standard Markovian assumptions, that a static voting protocol using our method provides nearly the same data availability as a static voting protocol using version numbers. We also describe a dynamic voting protocol using our method that provides the same data availability as a dynamic voting protocol using much more complex metadata.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114446949","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}
引用次数: 8
A non-blocking copy network for priority handling in ATM multicast switch 一种用于ATM组播交换机优先级处理的非阻塞复制网络
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581522
Y. Oh, S. Rai
{"title":"A non-blocking copy network for priority handling in ATM multicast switch","authors":"Y. Oh, S. Rai","doi":"10.1109/PCCC.1997.581522","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581522","url":null,"abstract":"This paper analyzes the performance of a non-blocking copy network for priority handling in a modular structured ATM multicast switch. Priority handling is required for a network congestion control as well as time critical services like video and voice conferences and interactive data services. The architecture of the non-blocking copy network is presented. The performance analysis for the copy network using an analytical method and a simulation are performed for both priority and non-priority cells. The results of the analysis in terms of a cell delay, a delay jitter, and a cell loss probability with different buffer sizes and fanouts under various input traffic loads are given. The results show that the proposed copy network provides a good performance for priority cells with a small sacrifice of non-priority cells.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127420066","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
The performance of multithreading and scheduling on client-server systems 客户机-服务器系统上多线程和调度的性能
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581383
W. C. Graham, S. Majumdar
{"title":"The performance of multithreading and scheduling on client-server systems","authors":"W. C. Graham, S. Majumdar","doi":"10.1109/PCCC.1997.581383","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581383","url":null,"abstract":"Two approaches to the improvement of the performance of client-server systems, multithreading and scheduling of servers, are investigated. Both of these approaches are observed to have a significant impact on system performance. The use of multithreading improves throughput characteristics of systems whereas the deployment of appropriate scheduling strategies at servers can produce a significant improvement in mean client response times. Based on a simulation model a number of basic questions that are important in the context of scheduling on non-multithreaded as well as multithreaded systems are analyzed. Two factors, monopolization of servers by large requests and software bottlenecking, are observed to be important in scheduling on client server systems. Both server scheduling as well as multithreading can be used to control these effects and lead to a higher system performance. Scheduling policies based on request characteristics are observed to perform well. A new request characteristic that is useful in the scheduling of client-server systems in the presence of software bottlenecks is presented.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130217211","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}
引用次数: 2
Advanced alterable pipeline timer (adapt): a tool to design a high performance PowerPC/sup TM/ microprocessor 高级可变管道定时器(自适应):设计高性能PowerPC/sup TM/微处理器的工具
1997 IEEE International Performance, Computing and Communications Conference Pub Date : 1997-02-05 DOI: 10.1109/PCCC.1997.581527
B. Burgess, S. Plummer Litch
{"title":"Advanced alterable pipeline timer (adapt): a tool to design a high performance PowerPC/sup TM/ microprocessor","authors":"B. Burgess, S. Plummer Litch","doi":"10.1109/PCCC.1997.581527","DOIUrl":"https://doi.org/10.1109/PCCC.1997.581527","url":null,"abstract":"The microprocessor discussed in this paper is a member of the G3 family of PowerPC processors, the third generation of PowerPC microprocessor products. It provides the performance levels required for high end desktop systems while offering the low typical power dissipation and small die size that make it very attractive for portable systems. It is an advanced superscalar design with six execution units, aggressive upstream branch processing, out-of-order instruction execution, and a tightly integrated \"backside\" L2 cache. Most notably it achieves workstation/server class performance while only dissipating 5 watts. A major portion of the design effort involved architectural performance modeling, making cost/power/performance trade-offs, and verifying performance of the implementation.","PeriodicalId":317009,"journal":{"name":"1997 IEEE International Performance, Computing and Communications Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127631448","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
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学术官方微信
小红书