发布求助
文献互助 智能选刊 最新文献

Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)最新文献

筛选
英文 中文
A flexible MAC protocol for all-optical WDM metropolitan area networks 全光WDM城域网的灵活MAC协议
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830364
T. Strosslin, M. Gagnaire
{"title":"A flexible MAC protocol for all-optical WDM metropolitan area networks","authors":"T. Strosslin, M. Gagnaire","doi":"10.1109/PCCC.2000.830364","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830364","url":null,"abstract":"In a metropolitan sized high-speed Wavelength Division Multiplexed optical network (WDM MAN), Media ACcess (MAC) protocols can only obtain low delay and high performance when reservation based protocols are used. However, reservation protocols limit the maximum number of network nodes. In existing solutions, this limit is either very tight, or the transmission delay is increased to allow more stations. In this paper, a new MAC protocol called Signal-Reservation-Decoupling (SRD) is proposed. SRD is capable of increasing the number of nodes considerably. Transmission delay is kept low by strictly avoiding signal-retransmissions. SRD is message-aware which faciliates transport of higher-level Protocol Data Units (PDUs) like IP datagrams. Directing subsequent packets of a message without interruption improves throughput when tuning times are not neglected.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129305817","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 fault tolerant ATM switching architecture 一个容错的ATM交换架构
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830331
Muhammad Anan, Mohsen Guizani
{"title":"A fault tolerant ATM switching architecture","authors":"Muhammad Anan, Mohsen Guizani","doi":"10.1109/PCCC.2000.830331","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830331","url":null,"abstract":"This paper proposes a new fault-tolerant, self-routing, and high performance switching architecture for ATM networks based on multistage interconnection networks (MINs). It consists of two closely linked Banyan networks. Links are provided at every stage to allow cells to transfer to and from each plane. Reliability analysis shows that this architecture has a much fault-tolerance than some of the fault-tolerant ATM networks found in the literature. Simulation results also indicate that the proposed architecture offers better performance in terms of cell loss rates with or without the presence of faults in the network. The proposed architecture offers high throughput with acceptable cell delay time, low cost, simple routing, and priority of messages. Furthermore, the proposed switch architecture is modular in its design making it ideal for VLSI implementation.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124642292","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
Senddata: an agent for data processing systems using email Senddata:用于使用电子邮件的数据处理系统的代理
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830327
Jason Dongwon Kwak, R. Elmasri, K. K. Lee
{"title":"Senddata: an agent for data processing systems using email","authors":"Jason Dongwon Kwak, R. Elmasri, K. K. Lee","doi":"10.1109/PCCC.2000.830327","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830327","url":null,"abstract":"People communicate with each other using email with great convenience, but there has been no research effort for utilizing email systems for Data Processing Systems (DPS). A certain class of DPS applications, such as order processing or sales reporting, do not require real-time response, so they may utilize email or protocols that allow delaying or relaying of messages. Lit this paper, we propose two models of DPS that utilize a MTA (Mail Transport Agent) to transport data and data processing commands. We introduce the concept of a DUA (Data User Agent), which we call Senddata, that interacts with a MTA, users, and applications. Our approach helps to reduce certain problems that can occur in DPS, such as overloaded server, heavy traffic on the Internet, and querying a database. We also discuss how these protocols can enhance security by utilizing a three-tier model.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"224 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123032186","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}
引用次数: 3
Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees 计算权约束最短路径和权约束最小生成树的原对偶算法
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830328
G. Xue
{"title":"Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees","authors":"G. Xue","doi":"10.1109/PCCC.2000.830328","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830328","url":null,"abstract":"In the QoS shortest path problem, we want to find a path connecting two given vertices u and v to minimize path cost subject to the constraint that the path weight is no greater than a given bound. In the QoS minimum spanning tree problem, we want to find a spanning tree to minimize tree cost subject to the constraint that the tree weight is no greater than a given bound. Both problems are NP-hard and have important applications in computer and communication networks. We present simple but effective primal-dual algorithms for computing approximate solutions for both problems. Computational results show that our algorithm find optimal solutions in more than 80% of the cases and find close to optimal solutions in all other cases, while using much less time.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117196517","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}
引用次数: 32
Power spectral analysis-based QoS evaluation of VBR video and its application to pricing model 基于功率谱分析的VBR视频QoS评价及其在定价模型中的应用
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830351
Chan-Hyun Youn, Sangbum Kim, Jung-Guk Bae
{"title":"Power spectral analysis-based QoS evaluation of VBR video and its application to pricing model","authors":"Chan-Hyun Youn, Sangbum Kim, Jung-Guk Bae","doi":"10.1109/PCCC.2000.830351","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830351","url":null,"abstract":"Since so many potentials of QoS degradation, it is difficult to predict the QoS degradation of VBR MPEG video application under high-speed network environment. The general procedure of the call admission requires the QoS contract between the users and the network. But, various statistical properties of the source traffic and its hard estimation make it difficult to satisfy the QoS contract. In this paper, we propose the measurement-based cell-rate autocorrelation function as the criterion of estimation on QoS degradation. The analysis of the power spectrum of MPEG video with P-MMBBP traffic modeling is ventured. Simulation results show that QoS degradation of the input traffic, particularly delay is closely related to the power spectrum. Furthermore, a new method of the pricing scheme based on the power spectral analysis is proposed and analyzed.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125678406","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
Horizontal fragmentation in object DBMS: new issues and performance evaluation 对象DBMS中的水平碎片:新问题和性能评估
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830308
F. Baião, M. Mattoso, Gerson Zaverucha
{"title":"Horizontal fragmentation in object DBMS: new issues and performance evaluation","authors":"F. Baião, M. Mattoso, Gerson Zaverucha","doi":"10.1109/PCCC.2000.830308","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830308","url":null,"abstract":"Horizontal fragmentation may improve the performance of database systems. Defining primary and derived horizontal fragmentation along the classes in a database schema is an important and complex issue, yet not discussed in the literature, which must be considered when horizontally fragmenting a database. In this paper, we focus on an analysis to help the designer upon the decision for primary or derived horizontal fragmentation. This analysis considers performance results of distributed databases using horizontal fragmentation to evaluate the potential benefits and drawbacks of primary and derived techniques. Therefore, this paper presents a horizontal fragmentation algorithm that chooses the most adequate strategy (primary or derived) based on class relationships, single class access and query access frequencies.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124454413","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
Application aware scheduling for power management on IEEE 802.11 基于IEEE 802.11的电源管理的应用感知调度
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830325
E. Takahashi
{"title":"Application aware scheduling for power management on IEEE 802.11","authors":"E. Takahashi","doi":"10.1109/PCCC.2000.830325","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830325","url":null,"abstract":"Asynchronous medium access protocols, like the MAC of IEEE 802.11, are inherently energy inefficient. Hosts have to continuously listen to the air waiting for packet arrivals. The power management mode of operation of IEEE 802.12 represents a significant improvement, however still has energy inefficiencies due to the one-fits-all policy and the medium access contention. To maximize energy efficiency and user satisfaction, the power management mechanism has to take into account application requirements. Traditional QoS specifications ignore energy consumption, and we argue that all service classes, including best effort, should be subdivided in energy consumption sublevels. We developed an application aware power management mechanism on top of the IEEE 802.12 power management which works on the trade-off between delay and power consumption, and allows per-flow customization.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121583547","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}
引用次数: 22
A new deadlock recovery mechanism for fully adaptive routing algorithms 一种新的全自适应路由算法死锁恢复机制
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830311
Z. Al-Awwami, M. Obaidat, M. Al-Mulhem
{"title":"A new deadlock recovery mechanism for fully adaptive routing algorithms","authors":"Z. Al-Awwami, M. Obaidat, M. Al-Mulhem","doi":"10.1109/PCCC.2000.830311","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830311","url":null,"abstract":"Routing algorithms used in wormhole switched networks must all provide a solution to the deadlock problem. If the routing algorithm allows deadlock cycles to form, then it must provide a deadlock recovery mechanism. Because deadlocks are anomalies that occur while routing, the deadlock recovery mechanism should not allocate any expensive hardware resources for the sake of handling such a rare event. Rather, it should only dedicate a minimal set of required resources to the recovery process in order to engage most of the hardware resources to the task of routing normal packets. This paper proposes a new deadlock recovery mechanism to be used with the True Fully Adaptive Routing algorithm. The new deadlock recovery mechanism takes advantage of the concept behind wormhole switching. The scheme is efficient in terms of hardware requirements, causes fewer deadlocks and can compete with other expensive deadlock recovery schemes.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121665467","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
QoS guarantees and performance analysis in mobile wireless ATM networks 移动无线ATM网络的QoS保障与性能分析
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830301
S. Medidi
{"title":"QoS guarantees and performance analysis in mobile wireless ATM networks","authors":"S. Medidi","doi":"10.1109/PCCC.2000.830301","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830301","url":null,"abstract":"Current research in wireless ATM networks focuses on its design, its protocol stack, data link layers, and issues related to mobility management functions but QoS guarantees during handoff has received limited attention. We present a new framework in this paper to allocate resources to both new calls and handoff calls based on the resource availability at the intermediate nodes also. The criterion for determining a route for a call is based on a combination of the resource availability at the links and the QoS requirements. We propose an algorithm that assigns the resources to the links proportional to the resource availability so as to reduce congestion on the heavily used links, and thereby reducing the chance of call failure and handoff failure. Another contribution in this paper is the performance analysis of wireless ATM network. The effects of different mobility parameters, blocking probability and handoff failure are examined for homogeneous traffic condition. We also present results about delay under heterogeneous traffic conditions.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122742138","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 performance model for task and interaction patterns in mobile agent systems 移动代理系统中任务和交互模式的性能模型
Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086) Pub Date : 2000-02-20 DOI: 10.1109/PCCC.2000.830353
O. Rana, D. Walker
{"title":"A performance model for task and interaction patterns in mobile agent systems","authors":"O. Rana, D. Walker","doi":"10.1109/PCCC.2000.830353","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830353","url":null,"abstract":"Mobile agents involve the migration of code and state, thereby facilitating the establishment of various communication and execution patterns in application programs. Automating the development of distributed systems that involve mobile agents is a nontrivial problem, requiring the developer to explicitly control and manage the complete environment, involving various host platforms and operating systems. Petri net models of design patterns in the Aglets mobile agent libraries are described, to support automated soft-ware engineering of mobile agent systems. The master-slave design pattern is described for modelling concurrent behaviour, and verified with an Aglets implementation.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131221905","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
首页 上一页 下一页 尾页
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学术官方微信