M. Z. Santos, L. Kiatake, F. Meylan, S. Kofuji, J. Courtiat
{"title":"Simulation and analysis of IP/ATM switching and routing","authors":"M. Z. Santos, L. Kiatake, F. Meylan, S. Kofuji, J. Courtiat","doi":"10.1109/ICATM.1999.786812","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786812","url":null,"abstract":"This paper presents a comparative study of different techniques used for communicating among distinct IP subnetworks over an ATM infrastructure. The technologies dealt with are IP routing on an ATM infrastructure, ATM switching and IP switching. The study relies on simulators specially designed and implemented for each technology. These simulators take as input two real traffic traces that have been collected on the Internet, respectively on a campus and a corporate environment. For each traffic trace, important parameters have been identified and analyzed to verify how they do affect the performance of each technology. The comparison among the different approaches has taken into account such parameters like the VC space, the number of established flows, the average packet delay, the flow creation delay, the connection release delay, the routing delay, etc. The simulation results will permit us to tune some parameters of each technology, and to choose, depending on the traffic requirements, the solution that appears to be the most appropriate for communicating among different IP subnetworks over an ATM infrastructure.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127419322","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":"RCES: a replication/contention/elimination strategy for replication baseline ATM switch architectures","authors":"Shiann-Tsong Sheu, Yue-Ru Chuang","doi":"10.1109/ICATM.1999.786829","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786829","url":null,"abstract":"A baseline switch architecture with several independent network planes has been proposed to enhance the switching efficiency. This paper proposes a replication/competition/elimination strategy (RCES) for the dual-baseline switch architecture with two parallel network planes to increase the throughput and decrease the effect of the head of line (HOL). For each incoming cell, the RCES first duplicates it and forwards the copy cell into a different inlet in another plane to find another route to pass through the network plane. Based on this strategy, cells will have a better chance of being switched out successfully even when the head of line occurs or burst traffic crowds toward a hot spot. When congestion occurs in the buffers, the cell behind another identical cell will be dropped immediately to reduce the cell loss probability. The performance of the proposed strategy is evaluated by simulations. Simulation results show that the proposed method obtains a higher throughput and lower cell loss probability than the traditional baseline network does.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126278591","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 management system providing real distribution of management tasks with time and space independence","authors":"F. Fontes, T. de Miguel, A. Azcorra","doi":"10.1109/ICATM.1999.786820","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786820","url":null,"abstract":"Actual management systems do not fulfil a number of requirements identified as mandatory for an efficient and effective network management. The simple adoption of solutions like Java's RMI or OMG's CORBA, do not solve all problems and may originate others. This paper describes the architectural and functional model for the proposed management system, that satisfy a number of identified requirements. Special attention is devoted to the information model, proposing a new structure for it. Within the text some simple application examples of ATM networks are given. Finally, a brief analysis of two distinct ATM switches from different vendors is given referring to the possible added value that the proposed system can bring when managing those devices.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123808159","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":"Interaction of RSVP with ATM for the support of shortcut QoS virtual channels","authors":"R. Cocca, M. Listanti, S. Salsano","doi":"10.1109/ICATM.1999.786809","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786809","url":null,"abstract":"In principle, the interaction of RSVP and ATM should allow us to benefit at the IP level from some features coming from the ATM layer. The most interesting feature is the native support of end-to-end quality of service provided by the ATM. On the other hand, there are issues that must be clarified to define a working solution for the interworking. For example, the possible overlapping between the mechanisms used in the IP level and in the ATM level to support QoS or the needed IP/ATM address resolution mechanism. This paper proposes a solution to exploit ATM shortcut VC supporting the QoS in the Internet integrated service model. A straightforward enrichment to the RSVP protocol is defined, which only impact the devices involved in the shortcut procedure. A mechanism for IP/ATM address resolution is provided, avoiding the use of other mechanisms such as NHRP (next hop resolution protocol).","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124962166","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":"An approximate analysis of a shared buffer ATM switch using input process aggregation technique","authors":"Jisoo Kim, C. Jun, K. Jun","doi":"10.1109/ICATM.1999.786837","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786837","url":null,"abstract":"A discrete time queueing model of an N/spl times/d shared buffer ATM switch is considered, which is loaded with unbalanced and correlated bursty traffic. We first propose an efficient input process aggregation algorithm and then, the maximum entropy method is applied to obtain the steady-state probability distribution of the queueing system. From the steady-state probabilities, we can derive some performance measures such as cell loss probability in the switching system. Numerical examples of the proposed approximation method are given, which are compared with simulation results.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"352 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115163688","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 buffer management and scheduling in a combined IntServ and DiffServ architecture: a performance study","authors":"G. Mamais, M. Markaki, G. Politis, I. Venieris","doi":"10.1109/ICATM.1999.786808","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786808","url":null,"abstract":"The differentiated services (DiffServ) architecture promises the provision of QoS-enabled networks by following a simple approach that eliminates scalability concerns and which can be implemented and managed in large networks. However, for end-to-end QoS an appropriate signaling scheme, like the resource reservation protocol (RSVP), should be supported. In this combined approach, signaling messages, which are generated by hosts and interpreted by edge routers, are tunneled transparently through the DiffServ core network. The treatment of the signaling messages in the DiffServ cloud is a very important issue, since long delays in their delivery or a high percentage of drops could result in unpredictable and undesirable situations. In this paper, we define a DiffServ traffic class, herein called network control traffic class, that is used by all signaling messages travelling through the DiffServ network. We provide a simulation analysis which evaluates the key properties of the new DiffServ class including priority level, link-sharing bandwidth and link-sharing structure for an hierarchical class-based resource management mechanism referred to as class-based queuing (CBQ), employed by the DiffServ core routers.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131775140","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":"ABR rate control for multimedia traffic using microeconomics","authors":"E. Fulp, D. Reeves","doi":"10.1109/ICATM.1999.786785","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786785","url":null,"abstract":"Multimedia applications are expected to play a more prevalent role in integrated service networks. One method of efficiently transmitting such traffic uses the ABR service class. However, rate control for this class becomes more difficult due to the bursty and somewhat unpredictable behavior of multimedia traffic. This paper presents a microeconomic-based ABR rate control technique that models the network as competitive markets. Prices are affixed to ABR bandwidth based upon supply and demand, and users purchase bandwidth to maximize their individual QoS. This yields a state-less rate control method that provides Pareto-optimal and QoS-fair bandwidth distributions, as well as high utilization. Simulation results using actual MPEG-compressed video traffic show utilization over 95% and better QoS control than max-min or demand-based weighted max-min.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133049890","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":"Compound VC mechanism for native multicast in ATM networks","authors":"J. Mangues‐Bafalluy, J. Domingo-Pascual","doi":"10.1109/ICATM.1999.786793","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786793","url":null,"abstract":"The growth of new kinds of traffic, and particularly multimedia, leads to changes in the conception of the network. Multimedia group communications pose stringent requirements to the distributed system supporting them. Maybe the most important requirement is that they should allow the communication from a user in a group to the rest of the group in an efficient way. These communications are referred to as multicast communications. The most efficient way to offer them in terms of resource consumption is at the level where either routing or switching are carried out. ATM poses further challenges due to its connection-oriented nature. Some mechanisms have been proposed in the past either for integrating IP multicast with ATM or for providing native ATM multicast but they present some drawbacks, especially in terms of overhead, management, and scalability. This paper presents a new native ATM multicast proposal that solves some of the problems found in other mechanisms. The multicast group is associated to a group of adjacent VCs (compound VC). A unique entry in the switching table is needed to switch the traffic of the entire group by means of a mask. The variable part of the VCI is dynamically changed each time the first cell of a new PDU arrives to a switch.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115493316","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":"Flow service order: a computationally inexpensive packet scheduling algorithm to support QoS guarantees for real-time traffic","authors":"R. Sanjeev, K. Seal, D. Sitaram","doi":"10.1109/ICATM.1999.786814","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786814","url":null,"abstract":"A new strategy for scheduling packets which promises adherence to the quality of service requirements of real-time data (e.g., video) is proposed. We prove that this new algorithm bounds the interpacket delay between two packets. We also arrive at an expression that bounds the average waiting time of a packet. We then show empirical results regarding the performance of our algorithm that we obtained through simulation. A comparison is made between the performance of our algorithm vis-a-vis the previous algorithms.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114695994","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":"Bi-directional ABR mechanism (decreasing feedback delays)","authors":"P. Homan, J. Bester","doi":"10.1109/ICATM.1999.786773","DOIUrl":"https://doi.org/10.1109/ICATM.1999.786773","url":null,"abstract":"The ABR mechanism was designed for controlling the traffic flows in ATM networks. The key factor for efficient and stable controlling of traffic control loops is fast transfer of feedback control information from the network back to the traffic source. In ABR mechanism so-called resource management (RM) cells are used for this purpose. The limited number of these control cells is especially noticeable in local area networks with negligible round trip time delays, when lower bit rates (less than 1 Mbit/s) are in question. Bi-directional ABR connections are composed of two independent unidirectional ABR connections each having its own flow of RM cells. Our proposal is to modify existing RM cells in such a way that each RM cell will be able to transfer control information for both directions at the same time. With the use of such modified RM cells and some modifications in network elements, the ABR control loop response time can be substantially reduced for a relatively small price. The number of RM cells in the network and therefore the amount of overhead information remains unchanged.","PeriodicalId":370762,"journal":{"name":"1999 2nd International Conference on ATM. ICATM'99 (Cat. No.99EX284)","volume":"2015 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114599992","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}