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

Proceedings of IEEE INFOCOM '96. Conference on Computer Communications最新文献

筛选
英文 中文
Sojourn-time analysis on nodal congestion in broadband networks and its impact on QoS specifications 宽带网络中节点拥塞的逗留时间分析及其对QoS规范的影响
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493080
W. Lau, San-qi Li
{"title":"Sojourn-time analysis on nodal congestion in broadband networks and its impact on QoS specifications","authors":"W. Lau, San-qi Li","doi":"10.1109/INFCOM.1996.493080","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493080","url":null,"abstract":"In this paper, we study the sojourn-time statistics and the temporal behavior of nodal congestion in integrated broadband networks. The node is modeled as a finite quasi-birth-death (QBD) process with level-dependent transitions. By formulating the problem as one which is amenable to the generalized folding algorithm (GFA), we are, for the first time, able to analyze realistic systems with large buffer and complex input traffic. The dynamics of the system under realistic traffic environment and different operating regimes are studied. The effects of various modeling artifacts such as fluid-flow and infinite-buffer approximations are also investigated. The potential of statistical multiplexing in reducing bursty cell loss is demonstrated. The trade-offs between different system design alternatives, e.g., buffering vs. statistical multiplexing, are discussed. We also investigate the controlling effect of preemptive cell discarding on steady-state and transient system performance. Both single-level and two-level overload control with hysteresial-switching mechanisms are considered. The use of sojourn-time based QoS metrics to supplement long-term steady-state metrics is also discussed.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123456559","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}
引用次数: 10
Maintaining high throughput during overload in ATM switches 在ATM交换机过载时保持高吞吐量
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.497905
J. Turner
{"title":"Maintaining high throughput during overload in ATM switches","authors":"J. Turner","doi":"10.1109/INFCOM.1996.497905","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497905","url":null,"abstract":"This paper analyzes two popular heuristics for ensuring packet integrity in ATM switching systems. In particular, we analyze the behavior of packet tail discarding, in order to understand how the packet level link efficiency is dependent on the rates of individual virtual circuits and the degree of the imposed overload. In addition, we study early packet discard and show that the queue capacity needed to achieve high efficiency under worst-case conditions grows with the number of virtual circuits and we determine the efficiency obtainable with more limited queue capacities. Using the insights from these analyses, extensions to early packet discard are proposed which achieve high efficiency with dramatically smaller queue capacities (independent of the number of virtual circuits).","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116407721","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
Real-time estimation of UPC parameters for arbitrary traffic sources in ATM networks ATM网络中任意流量源UPC参数的实时估计
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.497917
B. L. Mark, G. Ramamurthy
{"title":"Real-time estimation of UPC parameters for arbitrary traffic sources in ATM networks","authors":"B. L. Mark, G. Ramamurthy","doi":"10.1109/INFCOM.1996.497917","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497917","url":null,"abstract":"In networks based on the asynchronous transfer mode (ATM), traffic sources are subjected to a usage parameter control (UPC) function which controls the emitted cell stream by either discarding or delaying cells according to the parameters of a deterministic algorithm (e.g. the dual leaky bucket). The UPC parameters constitute a traffic descriptor which are used to allocate network resources to the traffic source. This paper presents a scheme for determining dual leaky bucket UPC parameter values for an arbitrary traffic source from observations of its emitted cell stream. The selection of UPC parameters is based on a novel statistical characterization of the observed cell stream, the user's tolerance for traffic shaping and a cost function based on the network resource allocation policy. Our scheme makes weak modeling assumptions and is robust for a wide class of traffic streams.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122325735","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}
引用次数: 24
Comparison of wavelength-interchanging and wavelength-selective cross-connects in multiwavelength all-optical networks 多波长全光网络中波长交换和波长选择交叉连接的比较
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.497889
G. Jeong, E. Ayanoglu
{"title":"Comparison of wavelength-interchanging and wavelength-selective cross-connects in multiwavelength all-optical networks","authors":"G. Jeong, E. Ayanoglu","doi":"10.1109/INFCOM.1996.497889","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497889","url":null,"abstract":"We quantify the benefits of wavelength interchanging in terms of the required capacity and the blocking probability. Most of the previous work on this subject assumed single-fiber links; we study networks with multiple fibers, extend Barry's (see Proceedings of IEEE INFOCOM '95, vol.2, p.402, 1995) probability analysis to the multifiber case, and compare those results with fiber gain calculations in exemplary networks. We quantify the gain in the blocking probability when wavelength interchanging cross-connects are used compared to the case when wavelength-selective cross-connects are used, and show that this gain decreases rapidly with an increasing number of fibers on a link. The formulation captures the effects of the topology and the traffic on this gain. Calculations and simulations are performed which verify the analytical results.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"220 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122524597","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}
引用次数: 115
Congestion-oriented shortest multipath routing 面向拥塞的最短多路径路由
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493045
S. Murthy, J. Garcia-Luna-Aceves
{"title":"Congestion-oriented shortest multipath routing","authors":"S. Murthy, J. Garcia-Luna-Aceves","doi":"10.1109/INFCOM.1996.493045","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493045","url":null,"abstract":"We present a framework for the modeling of multipath routing in connectionless networks that dynamically adapt to network congestion. The basic routing protocol uses a short-term metric based on hop-by-hop credits to reduce congestion over a given link, and a long-term metric based on end-to-end path delay to reduce delays from a source to a given destination. A worst-case bound on the end-to-end path delay is derived under three architectural assumptions: each router adopts weighted fair queueing (or packetized generalized processor sharing) service discipline on a per destination basis, a permit-bucket filter is used at each router to regulate traffic flow on a per destination basis, and all paths are loop free. The shortest multipath routing protocol regulates the parameters of the destination-oriented permit buckets and guarantees that all portions of a multipath are loop free.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114270239","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}
引用次数: 86
Weighted fair blocking mechanisms for discrete-time multiplexing 离散时间复用的加权公平阻塞机制
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493047
A. Conway, C. Rosenberg
{"title":"Weighted fair blocking mechanisms for discrete-time multiplexing","authors":"A. Conway, C. Rosenberg","doi":"10.1109/INFCOM.1996.493047","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493047","url":null,"abstract":"A major challenge in integrated services packet networks is the design of packet multiplexing systems to support different QoS requirements. We focus on the problem of satisfying different loss requirements. In time-slotted multiplexing systems, one may have batch arrivals (i.e., simultaneous arrivals in a time slot), and it is necessary to reject some of the packets in a batch when there is an insufficient number of available buffers. We propose a simple and intelligent probabilistic mechanism for rejecting packets in order to meet the loss requirements. It may be used as a selective discard mechanism to provide different QoS levels in terms of loss (weighted fair blocking). It may also be used to achieve fairness (balanced fair blocking). It offers important advantages and gains relative to existing approaches while being very simple. It allows decoupling of buffer dimensioning from the parameterization of a discard mechanism. It is universal in the sense that it may be used on top of many discrete-time multiplexing schemes. It also reduces the buffer space needed to meet loss requirements compared to natural rejection methods such as random selection. The mechanism is derived explicitly for two Markov modulated Bernoulli sources. The derivation for an arbitrary number of Bernoulli sources is formulated as a linear programming problem.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117007575","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
Transient behavior of ATM networks under overloads 过载下ATM网络的瞬态行为
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493039
Chang-Yu Wang, D. Logothetis, Kishor S. Trivedi, Y. Viniotis
{"title":"Transient behavior of ATM networks under overloads","authors":"Chang-Yu Wang, D. Logothetis, Kishor S. Trivedi, Y. Viniotis","doi":"10.1109/INFCOM.1996.493039","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493039","url":null,"abstract":"We characterize the time-dependent behavior of a typical queuing system that arise in ATM networks under the presence of overloads. The transient queue length distribution and transient cell loss probability are obtained numerically and transient characteristics such as maximum overshoot and relaxation time are used to quantify the effects of congestion periods. A new measure, expected excess loss in overload (EELO) is defined to quantify the effects of overload when compared with the system behavior in the steady-state regime. The basic modeling technology that we use is an extended form of stochastic Petri nets and a software tool called the stochastic Petri net package (SPNP).","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128522104","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}
引用次数: 36
A management system for load balancing through adaptive routing in multi-service ATM networks 基于自适应路由的多业务ATM网络负载均衡管理系统
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493385
P. Georgatsos, D. Griffin
{"title":"A management system for load balancing through adaptive routing in multi-service ATM networks","authors":"P. Georgatsos, D. Griffin","doi":"10.1109/INFCOM.1996.493385","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493385","url":null,"abstract":"This paper proposes a hierarchical approach to the routing issue in ATM-based broadband multi-service networks. We show how distributed route selection algorithms embedded within network nodes may be managed by a TMN system, by virtue of a management service called load balancing, to increase their adaptivity to network wide conditions and therefore their effectiveness. The paper elaborates on the issues involved, presents specific algorithms and a TMN-compliant management architecture. The proposed management service influences the routing decisions by conveying network-wide information and contributes to the network load balancing by directing the routing algorithms to route traffic to the least congested network areas. Results regarding the effect of the proposed management system on the network operation are also presented.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116492178","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
Network algorithms and protocol for multimedia servers 多媒体服务器的网络算法和协议
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493085
P. Goyal, H. Vin
{"title":"Network algorithms and protocol for multimedia servers","authors":"P. Goyal, H. Vin","doi":"10.1109/INFCOM.1996.493085","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493085","url":null,"abstract":"We present a network service specifically designed for multimedia servers. It uses a histogram based traffic characterization and an overload control protocol to the eliminate packet losses in the network while providing heterogeneous statistical QoS. The key contribution of our protocol lies in combining open-loop and feedback-based control to: (1) provide heterogeneous QoS to clients in networking environments consisting of switches that may not have any scheduling support; and (2) migrate the functionality of discarding packets, in the event of congestion, to the sources which understand the semantics of the data. The protocol is efficient, makes very few assumptions about the underlying network, is realizable on current switching hardware (supporting FCFS scheduling), and is completely integrated with the architecture of a multimedia server.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128026472","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}
引用次数: 15
HOL-EDD: a flexible service scheduling scheme for ATM networks HOL-EDD: ATM网络灵活的业务调度方案
Proceedings of IEEE INFOCOM '96. Conference on Computer Communications Pub Date : 1996-03-24 DOI: 10.1109/INFCOM.1996.493360
M. Vishnu, J. Mark
{"title":"HOL-EDD: a flexible service scheduling scheme for ATM networks","authors":"M. Vishnu, J. Mark","doi":"10.1109/INFCOM.1996.493360","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493360","url":null,"abstract":"The salient properties of a work-conserving, rate-based service scheduling scheme for ATM networks, called the head-of-the-line earliest due date (HOL-EDD), are described. The major feature of HOL-EDD is that it does not use cell stamping. Instead, it uses an integer decision variable for each VC to schedule cells for transmission. It is shown that the HOL-EDD has a connectionist implementation of O(1) computational complexity. The flexibility of the scheme is shown by generalizing it to schedule the CBR, ABR and UBR service classes.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"141 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132075019","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}
引用次数: 17
下一页 尾页
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学术官方微信