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

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

筛选
英文 中文
Fair Bandwidth Allocation in Multiple Priority DQDB Networks 多优先级DQDB网络中的公平带宽分配
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504136
K. S. Ho, H. Abu-Amara
{"title":"Fair Bandwidth Allocation in Multiple Priority DQDB Networks","authors":"K. S. Ho, H. Abu-Amara","doi":"10.1109/PCCC.1994.504136","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504136","url":null,"abstract":"The Distributed Queue Dual Bus (DQDB) protocol has been adopted as the IEEE 802.6 standard for Metropolitan Area Networks (MANS). A MAN operates at a much higher speed than a LAN does and covers a large geographical area. The original DQDB protocol exhibits unfair bandwidth allocation under overload condition. To solve the problem, the Bandwidth Balancing scheme (BWB) has been incorporated in the standard. However, the BWB scheme suffers from low channel utilization and long transient time. Moreover, the BWB fails to ensure fair bandwidth allocation in a multiple priority network. In this paper, we propose an algorithm, MP-NSW, that improves the fair bandwidth allocation in a multiple priority DQDB network. MP-NSW requires only minor modifications to the DQDB protocol, and is easy to implement. The simulation results show that the MP-NSW has fairer bandwidth allocation in a multiple priority network than the BWB scheme does. The MP-NSW can also achieve a 100’7 channel utilization which results in lower access delay !or downstream hlgh priority nodes.","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":"130829143","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
Internet Access via Baseband and Broadband ISDN Gateways 通过基带和宽带ISDN网关接入互联网
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504158
J. Tao, R. Martinez
{"title":"Internet Access via Baseband and Broadband ISDN Gateways","authors":"J. Tao, R. Martinez","doi":"10.1109/PCCC.1994.504158","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504158","url":null,"abstract":"As the concept of digital super-highway being more widely perceived among the computer and communications professionals and users, one of the focuses of eflorts is to take the full advantage of new technologies, to provide users with mazimum Intemet connectivity. Among all, ISDN is one of today’s technology with the ability to transmit voice, data, and imaging simultaneously with declining communications costs. It is expected that the connectivity via baseband ISDN will be vital for home users and small to medium-size organizations, in order to match up the unprecedented amount of daily electronic information. And the broadband ISDN is believed to be the foundation of digital super-highway technology. The ISDN gateway project was motivated to design a gateway, utilizing the mature and widespreading Intemet technology, to provide ISDN users with the Internet connectivity and services. This paper describes the design, implementation of an ISDN to Internet gateway, using the TCP/IP protocol suite.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"9 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":"132619842","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
Multimedia Network Experiment 多媒体网络实验
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504146
A. Lane
{"title":"Multimedia Network Experiment","authors":"A. Lane","doi":"10.1109/PCCC.1994.504146","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504146","url":null,"abstract":"The goal of this experiment is to demonstrate the large scale production use of a distributed network for simultaneous access to multimedia materials including real- time video data, in DVI compressed video format. Rensselaer has developed and is using several multimedia applications in the undergraduate experience. We are investigating the simultaneous sharing of multimedia data, stored on our IBM ES/9000 mainframe, among clients distributed around the campus. This paper discusses the methodology and our experiences thus far in our experiment. The benefits from successful networking are well known, should it succeed, and the experience gained thus far in the experiment are worth the attempt.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"35 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":"133763416","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
Self-Stabilizing Load Balancing Algorithms 自稳定负载平衡算法
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504130
M. Flatebo, A. Datta, B. Bourgon
{"title":"Self-Stabilizing Load Balancing Algorithms","authors":"M. Flatebo, A. Datta, B. Bourgon","doi":"10.1109/PCCC.1994.504130","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504130","url":null,"abstract":"A distributed system consists of a set of loosely connected state machines which d o not share a global memory. The global state of the system depends on the states of each ofthe processes in the system. The set of global states can be split up into two categories, legal and illegal. A desired property of the system is that regardless of the initial state of the system, the system automatically converges to a legal state in a finite number of steps. Also, if an error occurs in the system causing the system to be put into an illegal state, the system will again correct itself and converge t o a legal state an a finite amount of time. If the system is able t o d o this, it is called a self-stabilizing system. A load balancing algorithm attempts t o distribute the tasks around the system so that no processors are extremely overloaded or underloaded. This paper presents two self-stabilizing load balancing algorithms. The system is an arbitrary network of processors, and once the system stabilizes, the load will be balanced around the system.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"111 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":"123096496","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 buffer management strategy for a model of digital continuous media display 一种数字连续媒体显示模型的缓冲区管理策略
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504151
Iiiiigsley C'. Niyosu
{"title":"A buffer management strategy for a model of digital continuous media display","authors":"Iiiiigsley C'. Niyosu","doi":"10.1109/PCCC.1994.504151","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504151","url":null,"abstract":"The advent of multimedia information processing has brottght a lot of information managnnent issues into attention in the past few years. Prominent among them include the efficient storage and retrieval of multimedia objects. When handling digital continuous media, these issues become more critical. An efficient storage and retrieval process becnmrs useful and meaningful when combined with efficient buffer management. The bu.fftr acquisition and retention mechanisms go a long way to achieving the display requirements. Here, we present a technique for continuous media displays that strive to maintain some degree of data availability thro1tgh efficient buffer management. Media displrzy factors are deN/oped for data acquisition and buffer retention to satisfy media display requirements.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"26 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":"123827307","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
Worst-case schedule bounds and performance evaluation of a near-optimal algorithm for scheduling of independent tasks on multiprocessors 多处理器上独立任务调度的最坏情况调度边界和近最优算法的性能评估
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504129
F. A. Samadzadeh
{"title":"Worst-case schedule bounds and performance evaluation of a near-optimal algorithm for scheduling of independent tasks on multiprocessors","authors":"F. A. Samadzadeh","doi":"10.1109/PCCC.1994.504129","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504129","url":null,"abstract":"This paper discusses the problem of assignment of independent tasks to processors and proposes an algorithm, the Variant-Load algorithm. for balancing the workload on each of the p processing elements used for scheduling of the tasks. An analysis of the worst-case schedule bounds of the Variant-Load algorithm is presented. The performance of the proposed algorithm is compared to several of the best known comparable algorithms in the literature. It is shown that the Variant-Load algorithm performs at least as well as the best known algorithms in terms of the optimality of the prcduced schedules and is superior to these algorithms in terms of its run-time complexity.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"34 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":"124218840","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
An Analysis of Space Priority Queueing in ATM Switches ATM交换机空间优先级排队分析
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504139
K. Reid, R. Bunt
{"title":"An Analysis of Space Priority Queueing in ATM Switches","authors":"K. Reid, R. Bunt","doi":"10.1109/PCCC.1994.504139","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504139","url":null,"abstract":"High-speed packet switched networks such as B-ISDN require algorithms to manage the ow of traac into and through the network. Each switching node and network access node is susceptible to overload. End-to-end congestion control algorithms will do much to ensure that overload periods are minimized, but intelligent buuering decisions at internal nodes may aid in managing congestion by shifting cell loss to lower priority traac. This paper investigates how space priority queueing might aid in supporting acceptable quality of service for diierent classes of traac on a high-speed packet switched network. Simulation was used to examine the behaviour of three priority queueing algorithms operating at the output buuer of a switch under realistic traac models, and showed that the performance of these algorithms depends on the shape and type of the traac. The results of this research suggest that space priority algorithms, when combined with other congestion control algorithms, can aid in supporting acceptable quality of service for the users of the network.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"18 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":"122251235","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
On Playing Synthetic Speech on the PC's Internal Speaker 关于在PC的内部扬声器上播放合成语音
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504148
A. Lobo, M. Malley
{"title":"On Playing Synthetic Speech on the PC's Internal Speaker","authors":"A. Lobo, M. Malley","doi":"10.1109/PCCC.1994.504148","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504148","url":null,"abstract":"","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"29 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":"129968684","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
PDATS Lossless Address Trace Compression For Reducing File Size And Access Time pdat无损地址跟踪压缩，减少文件大小和访问时间
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504117
E. Johnson, J. Ha
{"title":"PDATS Lossless Address Trace Compression For Reducing File Size And Access Time","authors":"E. Johnson, J. Ha","doi":"10.1109/PCCC.1994.504117","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504117","url":null,"abstract":"The tremendous storage space required for a useful data base of traces has driven a search for trace compaction techniques. In this paper we present an information-lossless trace compression scheme that can reduce both storage space and access time by an order of magnitude or more, compared to ASCII-format traces, without discarding either references or inter-reference timing from the original trace. This technique has been selected as the standard trace format for an extensive new trace data base that will be made accessible to the international research and teaching community.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"52 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":"125696232","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}
引用次数: 71
Performance of VBR Packet Video Communications on an Ethernet LAN: A Trace-Driven Simulation Study 以太网局域网中VBR分组视频通信性能:跟踪驱动仿真研究
Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications Pub Date : 1994-04-12 DOI: 10.1109/PCCC.1994.504149
F. Edwards, M. Schulz
{"title":"Performance of VBR Packet Video Communications on an Ethernet LAN: A Trace-Driven Simulation Study","authors":"F. Edwards, M. Schulz","doi":"10.1109/PCCC.1994.504149","DOIUrl":"https://doi.org/10.1109/PCCC.1994.504149","url":null,"abstract":"Provision of multimedia communication services on today’s packet-switched network infrastructure is becoming increasingly feasible. However, there remains a lack of information regarding the performance of multimedia sources operating in bursty data traffic conditions. In this study, a videotelephony system deployed on the Ethernet LAN is simulated, employing high time-resolution LAN traces as the data traffic load. In comparison with Poisson traffic models, the trace-driven cases produce highly variable packet delays, and higher packet loss, thereby degrading video traffic performance. In order to compensate for these effects, a delay control scheme based on a timed packet dropping algorithm is examined. Simulations of the scheme indicate that improvements in real time loss rates of videotelphony sources can be achieved.","PeriodicalId":203232,"journal":{"name":"Proceeding of 13th IEEE Annual International Phoenix Conference on Computers and Communications","volume":"55 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":"125042259","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学术文献互助群
群 号：481959085
Book学术官方微信