Proceedings of the conference on Communications architectures, protocols and applications最新文献

User-space protocols deliver high performance to applications on a low-cost Gb/s LAN 用户空间协议在低成本Gb/s LAN上为应用程序提供高性能

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190316

Aled Edwards, G. Watson, J. Lumley, D. Banks, Costas Calamvokis, Chris R. Dalton

{"title":"User-space protocols deliver high performance to applications on a low-cost Gb/s LAN","authors":"Aled Edwards, G. Watson, J. Lumley, D. Banks, Costas Calamvokis, Chris R. Dalton","doi":"10.1145/190314.190316","DOIUrl":"https://doi.org/10.1145/190314.190316","url":null,"abstract":"Two important questions in high-speed networking are firstly, how to provide Gbit/s networking at low cost and secondly, how to provide a flexible low-level network interface so that applications can control their data from the instant it arrives. We describe some work that addresses both of these questions. The Jetstream Gbit/s LAN is an experimental, low-cost network interface that provides the services required by delay-sensitive traffic as well as meeting the performance needs of current applications. Jetstream is a combination of traditional shared-medium LAN technology and more recent ATM cell- and switch-based technology. Jetstream frames contain a channel identifier so that the network driver can immediately associate an incoming frame with its application. We have developed such a driver that enables applications to control how their data should be managed without the need to first move the data into the application's address space. Consequently, applications can elect to read just a part of a frame and then instruct the driver to move the remainder directly to its destination. Individual channels can elect to receive frames that have failed their CRC, while applications can specify frame-drop policies on a per-channel basis. Measured results show that both kernel- and user-space protocols can achieve very good throughput: applications using both TCP and our own reliable byte-stream protocol have demonstrated throughputs in excess of 200 Mbit/s. The benefits of running protocols in user-space are well known- the drawback has often been a severe penalty in the performance achieved. In this paper we show that it is possible to have the best of both worlds.","PeriodicalId":142337,"journal":{"name":"Proceedings of the conference on Communications architectures, protocols and applications","volume":"481 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116415210","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}

引用次数: 91

TCP Vegas: new techniques for congestion detection and avoidance TCP Vegas:拥塞检测和避免的新技术

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190317

L. Brakmo, S. O'Malley, L. Peterson

引用次数: 1606

Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing 基于信用的ATM网络流量控制:信用更新协议、自适应信用分配和统计复用

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190324

H. T. Kung, T. Blackwell, A. Chapman

引用次数: 235

An algorithm for lossless smoothing of MPEG video 一种MPEG视频无损平滑算法

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190340

S. Lam, Simon Chow, David K. Y. Yau

{"title":"An algorithm for lossless smoothing of MPEG video","authors":"S. Lam, Simon Chow, David K. Y. Yau","doi":"10.1145/190314.190340","DOIUrl":"https://doi.org/10.1145/190314.190340","url":null,"abstract":"Interframe compression techniques, such as those used in MPEG video, give rise to a coded bit stream where picture sizes differ by a factor of 10 or more. As a result, buffering is needed to reduce (smooth) rate fluctuations of encoder output from one picture to the next; without smoothing, the performance of networks that carry such video traffic would be adversely affected. Various techniques have been suggested for controlling the output rate of a VBR encoder to alleviate network congestion or prevent buffer overflow. Most of these techniques, however, are lossy, and should be used only as a last resort. In this paper, we design and specify an algorithm for lossless smoothing. The algorithm is characterized by three parameters: D (delay bound), K (number of pictures with known sizes), and H (lookahead interval). We present a theorem which guarantees that, if K ≥ 1, the algorithm finds a solution that satisfies the delay bound. (Although the algorithm and theorem were motivated by MPEG video, they are applicable to the smoothing of compressed video in general). To study performance characteristics of the algorithm, we conducted a large number of experiments using statistics from four MPEG video sequences.","PeriodicalId":142337,"journal":{"name":"Proceedings of the conference on Communications architectures, protocols and applications","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134367757","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}

引用次数: 151

USC: a universal stub compiler USC:通用存根编译器

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190341

S. O'Malley, Todd A. Proebsting, Allen Brady Montz

引用次数: 76

Scalable feedback control for multicast video distribution in the Internet 互联网多播视频分发的可伸缩反馈控制

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190320

J. Bolot, T. Turletti, I. Wakeman

引用次数: 429

On optimization of polling policy represented by neural network 基于神经网络的轮询策略优化研究

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190331

Y. Matsumoto

引用次数: 6

An architecture for wide-area multicast routing 广域组播路由体系结构

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190326

S. Deering, D. Estrin, D. Farinacci, V. Jacobson, Ching-Gung Liu, Liming Wei

{"title":"An architecture for wide-area multicast routing","authors":"S. Deering, D. Estrin, D. Farinacci, V. Jacobson, Ching-Gung Liu, Liming Wei","doi":"10.1145/190314.190326","DOIUrl":"https://doi.org/10.1145/190314.190326","url":null,"abstract":"Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and senders to those group members, are distributed sparsely across a wide area, these schemes are not efficient; data packets or membership report information are occasionally sent over many links that do not lead to receivers or senders, respectively. We have developed a multicast routing architecture that efficiently establishes distribution trees across wide area internets, where many groups will be sparsely represented. Efficiency is measured in terms of the state, control message processing, and data packet processing, required across the entire network in order to deliver data packets to the members of the group. Our Protocol Independent Multicast (PIM) architecture: (a) maintains the traditional IP multicast service model of receiver-initiated membership; (b) can be configured to adapt to different multicast group and network characteristics; (c) is not dependent on a specific unicast routing protocol; and (d) uses soft-state mechanisms to adapt to underlying network conditions and group dynamics. The robustness, flexibility, and scaling properties of this architecture make it well suited to large heterogeneous inter-networks.","PeriodicalId":142337,"journal":{"name":"Proceedings of the conference on Communications architectures, protocols and applications","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123101920","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}

引用次数: 465

Distributed, scalable routing based on link-state vectors 基于链路状态向量的分布式、可扩展路由

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190327

Jochen Behrens, J. Garcia-Luna-Aceves

{"title":"Distributed, scalable routing based on link-state vectors","authors":"Jochen Behrens, J. Garcia-Luna-Aceves","doi":"10.1145/190314.190327","DOIUrl":"https://doi.org/10.1145/190314.190327","url":null,"abstract":"A new family of routing algorithms for the distributed maintenance of routing information in large networks and internets is introduced. This family is called link vector algorithms (LVA), and is based on the selective diffusion of link-state information based on the distributed computation of preferred paths, rather than on the flooding of complete link-state information based on the distributed computation of preferred paths, rather than on the flooding of complete link-state information to all routers. According to LVA, each router maintains a subset of the topology that corresponds to the links used by its neighbor routers in their preferred paths to known destinations. Based on that subset of topology information, the router derives its own preferred paths and communicates the corresponding link-state information to its neighbors. An update message contains a vector of updates; each such update specifies a link and its parameters. LVAs can be used for different types of routing. The correctness of LVA is verified for arbitrary types of routing when correct and deterministic algorithms are used to select preferred paths at each router. LVA is shown to have smaller complexity than link-state and distance-vector algorithms, and to have better average performance than the ideal topology-broadcast algorithm and the distributed Bellman-Ford algorithm.","PeriodicalId":142337,"journal":{"name":"Proceedings of the conference on Communications architectures, protocols and applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1994-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129223267","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}

引用次数: 69

A methodology for designing communication protocols 设计通信协议的方法学

Proceedings of the conference on Communications architectures, protocols and applications Pub Date : 1994-10-01 DOI: 10.1145/190314.190337

Gurdip Singh

引用次数: 6