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

One-way-delay measurements with CM toolset 单向延迟测量与CM工具集

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.830300

Ulrich Hofmann, T. Pfeiffenberger, Bernhard Hechenleitner

{"title":"One-way-delay measurements with CM toolset","authors":"Ulrich Hofmann, T. Pfeiffenberger, Bernhard Hechenleitner","doi":"10.1109/PCCC.2000.830300","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830300","url":null,"abstract":"Internet Quality of Service (QoS) is an actual research topic. The need for more or less guaranteed transmission rates (e.g. for bulk-data transfer applications), upper bounds for transmission delay and jitter (e.g. for real time applications like IP telephony, video-conferencing) stimulated the development of QoS transmission technologies like ATM, IP-RSVP and the actual discussion about Diff-Serv mechanisms. This paper describes the implementation and the first measurement trials with the One-Way-Delay measurement components of CM-Toolset. The overall tool architecture consists of a distributed system of load generators and receivers (agents) and a measurement server, which stores the measurement results in a data-base. To measure the exact One-Way-Delay (OWD) the synchronised GPS clock system was integrated. The measurements were realised in a 4 hop heterogeneous IP and ATM network. The clock drift during the loop measurements was about 10 ms, linear and deterministic. So the drift could be eliminated by statistical computations. The measurements were made for UDP flows under different load situations( 1 UDP....5 UDP, TSDU size, interarrival time), and for n*UDP+1 TCP. The measurements show very clearly the interaction and dependencies between the number of flows, their load parameters and the QoS parameters like packet loss and one way delay. The measurements of UDP+TCP multiplexed flows explains, why the concept of flow separation is important for QoS guarantees. CM Toolset can be used by protocol engineers for the development of new QoS-based network technologies by collecting measurement data for modelling the network behaviour. Network managers can tune the operational network to improve the quality e.g. of IP-Telephon.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"49 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":"116329195","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

Modeling shared-memory ATM switches with fluid-flow models 用流体流动模型建模共享内存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.830316

J. D. Ho, S. Singh, N. K. Sharma

引用次数: 3

Hot spot analysis in wormhole-routed tori 虫洞路径环面的热点分析

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.830336

H. Sarbazi-Azad, L. Mackenzie, M. Ould-Khaoua

引用次数: 3

An efficient rollback recovery algorithm for distributed mobile computing 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.830338

T. Juang, Yuh-Shyan Chen

{"title":"An efficient rollback recovery algorithm for distributed mobile computing systems","authors":"T. Juang, Yuh-Shyan Chen","doi":"10.1109/PCCC.2000.830338","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830338","url":null,"abstract":"One major breakthrough on the communication society recently is the extension of networking from wired to wireless networks. This has made possible creating a mobile distributed computing environment and has brought us several new challenges in distributed protocol design. Obviously, wireless networks do have some fundamental differences from wired networks that need to be paid special attention of, such as lower communication bandwidth compared to wired networks, limited electrical power due to battery capacity, and mobility of processes. These new issues make traditional recovery algorithm unsuitable. In order to cope with these problems, the tasks of logging and recovery procedure are performed by the MSSs. In this paper, we propose an efficient algorithm with O(n/sub r/) message complexity where O(n/sub r/) is the total number of mobile hosts (MHs) related to the failed MH. In addition, these MHs only need to rollback once and can immediately resume its operation without waiting for any coordination message from other MHs. During normal operation, the application message needs O(1) additional information when it transmitted between MHs and mobile support stations (MSSs). Each MSS must keep an n/sub total-h/*n/sub cell-h/ dependency matrix, where O(n/sub total-h/) is the total number of MHs in the system and n,,n h is the total number of MHs in its cell.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"24 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":"128934859","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

Intelligent browser initiated server pushing 智能浏览器启动服务器推送

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.830296

Wenting Tang, M. Mutka

引用次数: 3

Hint-based acceleration of Web proxy caches 基于提示的Web代理缓存加速

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.830299

D. Roşu, A. Iyengar, D. Dias

引用次数: 11

Destination-controlled routing with resource reservation 带资源预留的目的地控制路由

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.830344

H. Hassanein, M. Al-Otaibi

{"title":"Destination-controlled routing with resource reservation","authors":"H. Hassanein, M. Al-Otaibi","doi":"10.1109/PCCC.2000.830344","DOIUrl":"https://doi.org/10.1109/PCCC.2000.830344","url":null,"abstract":"This paper proposes a framework for routing and resource reservation in ATM networks, where call admission control (CAC), resource reservation and routing interweave together. A Forward-Routing and Backward-Setup process (FRBS) scheme is proposed. FRBS has two stages, a forward routing stage and a backward setup stage. During the forward stage, routing information on all paths from source to destination are forwarded through setup messages to the destination using a controlled flooding approach. Setup messages include CAC information on all links within the traversed path. The destination node collects information on all possible paths in its routing table. The destination then makes a selection of the path with the best cost value, and reservation is attempted along this path backwards towards the source. This represents the backward setup stage, which includes reserving resources along the selected path such that the CAC criteria are met. Various simulation experiments were conducted under different traffic characteristics and network parameters. Results indicate that the FRBS scheme possesses a number of performance advantages in terms of accuracy of routing decisions and call blocking probabilites.","PeriodicalId":387201,"journal":{"name":"Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086)","volume":"185 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":"122202476","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

An admission control scheme for continuous media servers using caching 使用缓存的连续媒体服务器的许可控制方案

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.830350

J. Kwon, H. Yeom

引用次数: 8

Supporting quality of service in a terabit switch 支持太比特交换机的服务质量

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.830302

K. W. James, K. Yun

引用次数: 7

Object organization on parallel broadcast channels in a global information sharing environment 全局信息共享环境下并行广播信道的对象组织

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.830337

A. Hurson, Y. C. Chehadeh, J. Hannan

引用次数: 29