IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243)最新文献

A dynamic buffer allocation scheme for nrt-traffics in ATM switches 一种ATM交换机中nrt流量的动态缓冲分配方案

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796172

Hong-soon Nam, Je-Chan Kim, B. Kim

引用次数: 1

ACK delay control for improving TCP throughput over satellite links 用于提高卫星链路上TCP吞吐量的ACK延迟控制

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796192

Jing Wu, Yu Shi, P. Zhang, Shiduan Cheng, Jian Ma

引用次数: 12

Low-delay heuristic algorithms for wavelength assignments in WDM networks WDM网络中波长分配的低延迟启发式算法

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796153

G. Shen, S. Bose, T. Cheng

引用次数: 0

Data spread: a novel authentication and security technique 数据传播:一种新的身份验证和安全技术

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796195

J. Zic

引用次数: 0

Network calculus and service curve scheduling in heterogeneous networks 异构网络中的网络演算与业务曲线调度

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796185

R. Malaney, G. Rogers

引用次数: 1

Adaptive admission control and scheduling for wireless packet communication 无线分组通信的自适应接纳控制与调度

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796176

J. Meggers

引用次数: 2

Optimal base station placement and fixed channel assignment applied to wireless local area network projects 无线局域网项目中最优基站布局与固定信道分配

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796177

Ricardo C. Rodrigues, G. Mateus, A. Loureiro

引用次数: 41

A fair queueing algorithm for multiple-streams delay-bounded services 多流延迟限制服务的公平排队算法

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796183

M. Liu, Lih-Chyau Wuu, L. Lin, Chun-Yeh Tsai

{"title":"A fair queueing algorithm for multiple-streams delay-bounded services","authors":"M. Liu, Lih-Chyau Wuu, L. Lin, Chun-Yeh Tsai","doi":"10.1109/ICON.1999.796183","DOIUrl":"https://doi.org/10.1109/ICON.1999.796183","url":null,"abstract":"In this paper, we propose a resource reservation and scheduling algorithm which guarantees the end-to-end delay constraints for the processing of single-source multiple-stream delivery. User applications initiate the requests by specifying the tolerable delay and priorities reflecting the preference for each stream. In order to provide efficient flow scheduling subject to the fairness and delay constraints, we consider a mechanism in which the resource reservation and scheduling are integrated into a framework so that the queueing delay can be taken into the consideration at the reservation phase. Packets are scheduled in a packet-by-packet base, the fairness characteristics in each scheduler is approximated by emulating the max-min fair discipline in the corresponding GPS server. Instead of tracking the fair utilization before the packet can be served in WFQ, the bandwidth share is monitored after the packet is sent. This approach can significantly reduce the computational complexity resulting from WFQ while maintaining the long-term fairness. The end-to-end delay is derived from the latency in each link and the worst-case waiting time at each scheduler. Examples are illustrated to show the performance, the results lead to high satisfaction in terms of delay and fairness.","PeriodicalId":423690,"journal":{"name":"IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120938050","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

Analysis of per-flow and aggregate QoS in scalable QoS networks 可扩展QoS网络中逐流和聚合QoS分析

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796190

E. Dutkiewicz, P. Boustead

{"title":"Analysis of per-flow and aggregate QoS in scalable QoS networks","authors":"E. Dutkiewicz, P. Boustead","doi":"10.1109/ICON.1999.796190","DOIUrl":"https://doi.org/10.1109/ICON.1999.796190","url":null,"abstract":"The future Internet will support a large variety of services whose QoS requirements may vary widely. In order to provide scalable quality of service traffic aggregation may be necessary. We examine several approaches to providing scalable QoS services which includes soft QoS with relative performance guarantees, and hard performance guarantees signaled by RSVP over an aggregated cell switched core. In these approaches QoS is based on aggregate traffic. The question then arises as to what level of QoS is perceived by individual flows within the aggregate. This has an important implication on QoS guarantees which the network can make to individual users. To provide answers to the above question we analyse per-flow and aggregate QoS in an ATM virtual path (VP) which is used as an example of a cut-through handling IP flows. Using cell loss as a measure of QoS, our analysis allows us to investigate the impact of the parameters of individual flows on per-flow QoS. We then compare per-flow QoS against the QoS experienced by the aggregate flow in the VP. Based on numerical tests we find that cell loss experienced by individual flows may be very different from cell loss experienced by the aggregate flow. Thus if aggregate cell loss is used as a QoS constraint in dimensioning of VP this may lead to unfair treatment of flows and hence to potential user dissatisfaction.","PeriodicalId":423690,"journal":{"name":"IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124981746","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

A programmable multicast service in ATM ATM中的可编程组播业务

IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243) Pub Date : 1999-09-28 DOI: 10.1109/ICON.1999.796170

H. Pung, N. Bajrach

引用次数: 0