{"title":"Efficient analysis of shared buffer management strategies in ATM networks under non-uniform bursty traffic","authors":"B. Collier, Hyong S. Kim","doi":"10.1109/INFCOM.1996.493363","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493363","url":null,"abstract":"This paper describes an approach for the analysis of multistage switching networks with a variety of buffer sharing strategies. The approach allows non-uniform bursty traffic, and it features a computational complexity which is independent of the buffer size. We decompose the complex shared buffer analysis problem into an equivalent dedicated buffer problem through an iterative series of buffer size approximations. Results are compared with simulations and are used to quantify the performance differences of several buffer sharing policies.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"4020 3 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":"127539775","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}
{"title":"The role of the manager in a noncooperative network","authors":"Y. A. Korilis, A. Lazar, A. Orda","doi":"10.1109/INFCOM.1996.493075","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493075","url":null,"abstract":"Traditional computer networks were typically designed with system-wide optimization in mind. In noncooperative networks users make control decisions that optimize their individual performance objectives. Nash equilibria characterize the operating points of such networks. Nash equilibria exhibit, in general, suboptimal network performance. Focusing on routing, a methodology is devised for overcoming this deficiency, through the intervention of the network manager. The manager controls part of the network flow, is aware of the noncooperative behavior of the users and performs its routing aiming at improving the overall system performance. The existence of maximally efficient strategies for the manager, i.e., strategies that drive the system into the global network optimum, is investigated. Necessary and sufficient conditions for the existence of a maximally efficient strategy are derived. The maximally efficient strategy are shown to be unique and it is specified explicitly.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"5 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":"124574660","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}
{"title":"Video traffic characterization for multimedia networks with a deterministic service","authors":"D. Wrege, J. Liebeherr","doi":"10.1109/INFCOM.1996.493346","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493346","url":null,"abstract":"One of the most important traffic types in future packet-switched networks is high-bandwidth, variable-bit-rate (VBR) video. Since video is a delay-sensitive media, the network must allocate resources to maintain quality-of-service (QoS) guarantees on throughput, delay, and delay jitter to video connections. A key component of resource allocation is the traffic characterization of video sources that determines the resources required to support video connections. In this study, we propose a method for characterizing VBR video traffic with a fixed number of leaky buckets in networks with a deterministic service. We explore tradeoffs of network utilization in two directions: (1) the number of leaky buckets used for traffic characterisation, and (2) the amount of information from a video sequence used to produce the characterization. We evaluate our method with a set of 30-minute long MPEG-compressed video traces.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"111 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":"124734425","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}
{"title":"A network architecture for mobile computing","authors":"K. Brown, Suresh Singh","doi":"10.1109/INFCOM.1996.493087","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493087","url":null,"abstract":"We report on an ongoing project to design and build the network and transport layers for mobile networking. The network architecture used is unique in that it separates the mobile network(s) from fixed networks and provides connectivity between the two via special gateways. These gateways provide QOS guarantees to mobile users for all their open connections. We provide summaries of all the protocols we are implementing (or have implemented) and discuss possible improvements.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":" 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1996-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120932011","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}
{"title":"Efficient solution of multiple server queues with application to the modeling of ATM concentrators","authors":"A. Kamal","doi":"10.1109/INFCOM.1996.497900","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.497900","url":null,"abstract":"This paper introduces a method for obtaining the steady state probabilities in G/sup [X]//D/C/K type queues. The solution method is more efficient than other known techniques in terms of both time and space requirements. The method is an extension of the MBH technique used to solve single server queues, It is shown that this method allows one to perform a parametric study quickly and efficiently by building on already existing results. The solution technique is used to evaluate the performance of concentrators used in ATM networks where low speed lines are connected to higher speed ones, e.g., 150 Mb/s lines to a 620 Mb/s or 1.2 Gb/s line. The concentrator is equipped with a finite capacity buffer, and is modeled as a synchronous multiple server queue with finite buffer. The concentrator is fed by a discrete batch Markov arrival process (D-BMAP) which is capable of capturing the traffic characteristics of a broad range of applications. The paper derives the probability of cell loss introduced by the concentrator buffering, and considers the effect of the buffer size as well as the line speeds on this measure.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"30 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":"116736178","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}
{"title":"Evaluating the queue distribution of an ATM multiplexer with multiple time scale arrivals","authors":"P. Jelenkovic, A. Lazar","doi":"10.1109/INFCOM.1996.493344","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493344","url":null,"abstract":"For an ATM multiplexer we develop a recursive asymptotic expansion method for approximating the queue length distribution and investigate the radius of convergence of the queue asymptotic expansion series. The analysis focuses on \"small\" to \"moderate\" buffer sizes under the conditions of strictly stable multiple time scale arrivals. For a class of examples we analytically determine the radius of convergence using methods of linear operator theory. We also give general sufficient conditions under which the radius converges to zero; this shows roughly what situations have to be avoided for the proposed method to work well. We combine the asymptotic expansion method with the EB approximation, and give an approximation procedure for the buffer probabilities for all buffer ranges. The procedure is tested on extensive numerical examples. We suggest this procedure for efficient admission control in ATM networks.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"130 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":"116214175","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}
{"title":"A pricing model for high speed networks with guaranteed quality of service","authors":"Hong Jiang, S. Jordan","doi":"10.1109/INFCOM.1996.493388","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493388","url":null,"abstract":"In this paper, we discuss the role of prices in combining user characterization, network resource allocation, and contract negotiation to form a complete connection establishment process. We suggest that such a process should encourage network efficiency through distributed resource allocation among virtual circuits, circuit bundles, and virtual paths. We adopt effective bandwidth as our user traffic characterization and our pricing base, and we measure network efficiency by total user benefit. We allow a limited degree of statistical multiplexing by incorporating multiplexing gain into the prices. Finally, we propose a hierarchical and distributed negotiation structure under which only hierarchically adjacent and geographically local network entities communicate with each other.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"21 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":"121565838","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}
{"title":"Directed antennas in the Mobile Broadband System","authors":"M. Horneffer, D. Plassmann","doi":"10.1109/INFCOM.1996.493367","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493367","url":null,"abstract":"The article investigates the usage of adaptive directed antennas for the Mobile Broadband System (MBS). The advantages and problems are considered. Solutions for the problems are proposed and evaluated with respect to cost, feasibility and efficiency. The MBS is a wireless cellular network operating at 60 GHz. It has been developed in the European collaborative RACE II project R2057, addressing techniques and technology (especially GaAs MMIC, i.e. millimetre-wave monolithic integrated circuits) as well as system concepts. A major feature of MBS is to transparently transport ATM cells over the air interface at bit rates of 34 Mbit/s per carrier.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"14 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":"125209583","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}
J. Hsieh, D. Du, James A. MacDonald, Joseph P. Thomas, Jack Pugaczewski, Jeff Kays, Melissa Wiklund
{"title":"Experimental study of extended HIPPI connections over ATM networks","authors":"J. Hsieh, D. Du, James A. MacDonald, Joseph P. Thomas, Jack Pugaczewski, Jeff Kays, Melissa Wiklund","doi":"10.1109/INFCOM.1996.493072","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493072","url":null,"abstract":"To extend the widespread use of the high performance parallel interface (HIPPI) as a networking solution for high-speed communications, the 25-meter distance limitation must be solved. Three options available for alleviating the problem of distance limitation are serial-HIPPI, HIPPI/SONET mapping or HIPPI-ATM mapping, and IP routing. Serial-HIPPI, HIPPI/SONET mapping and HIPPI-ATM mapping provide extended HIPPI connectivities at the physical layer, while IP routing forwards data between the HIPPI networks and other networks at the network layer. We study two feasible solutions of this problem, HIPPI tunneling (HIPPI-ATM mapping) and IP routing. We compare these two schemes in terms of network connectivities, protocol overhead, and flow control. The performance evaluation of one implementation of HIPPI tunneling and IP routing is presented. The experimental performance suggests that a high degree of bandwidth utilization was achieved by both HIPPI tunneling and IP routing in this implementation.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"34 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":"125237546","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}
{"title":"Distributed queue packet scheduling algorithms for WDM-based networks","authors":"A. Muir, J. Garcia-Luna-Aceves","doi":"10.1109/INFCOM.1996.493034","DOIUrl":"https://doi.org/10.1109/INFCOM.1996.493034","url":null,"abstract":"Two protocols for scheduling variable-length packet transmissions in an optical passive star network using wavelength division multiplexing (WDM) are specified and analyzed. These protocols require: a separate channel for transmission of control packets, a fixed transmitter and receiver and a tunable transmitter and receiver. The distinction between these protocols and other WDM protocols is that message transmissions are initiated by the receipt of a control message; other schemes schedule packet transmission for some fixed point in the future. This flexibility allows these protocols to avoid \"head-of-line\" blocking which is a problem encountered in some other protocols. The protocols presented place no constraints on the size of a message, the size of a packet or on the number of available data channels; maintain a distributed queue for each of the output nodes; and guarantee that there are no receiver or data channel collisions. The delay characteristics of these protocols are analyzed and compared to those of the TTAS algorithm.","PeriodicalId":234566,"journal":{"name":"Proceedings of IEEE INFOCOM '96. Conference on Computer Communications","volume":"102 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":"133755448","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}