Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253246
M. Doar, I. Leslie
In previous approaches to routing multicast connections in networks, the emphasis has been on the source transmitting to a fixed set of destinations (the multicast group). There are some applications where destinations will join and leave the multicast group. Under these conditions, computing an 'optimal' spanning tree after each modification may not be the best way to proceed. An alternative is to make modest alterations to an existing spanning tree to derive a new one. An extreme, though nonoptimal, variation of this is to use minimal cost source to destination routing for each destination, effectively ignoring the existing multicast tree. The authors examine just how nonoptimal these trees are in random general topology networks and conclude that they are worse by only a small factor. The factor is reduced still further if a hierarchy is imposed on the random network to give a more realistic model.<>
{"title":"How bad is naive multicast routing?","authors":"M. Doar, I. Leslie","doi":"10.1109/INFCOM.1993.253246","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253246","url":null,"abstract":"In previous approaches to routing multicast connections in networks, the emphasis has been on the source transmitting to a fixed set of destinations (the multicast group). There are some applications where destinations will join and leave the multicast group. Under these conditions, computing an 'optimal' spanning tree after each modification may not be the best way to proceed. An alternative is to make modest alterations to an existing spanning tree to derive a new one. An extreme, though nonoptimal, variation of this is to use minimal cost source to destination routing for each destination, effectively ignoring the existing multicast tree. The authors examine just how nonoptimal these trees are in random general topology networks and conclude that they are worse by only a small factor. The factor is reduced still further if a hierarchy is imposed on the random network to give a more realistic model.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123535773","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253294
D. Desbiens, G. Bochmann, Anindya Das, J. Dargham
A model and a formal specification of the personal communication service obtained by the application of an object-oriented system design methodology is presented and described using the executable object-oriented specification language Mondel. The goal of developing a specification of PCS is primarily to introduce some structure and formalism in its description, which has so far been done informally, and also to provide a better understanding of its constituent elements and their interrelationships. As Mondel is an executable specification language, simulation is used to verify the basic functionality defined in this specification of PCs. Simulation using various scenarios also provides a means of presenting the different concepts of PCS.<>
{"title":"Modeling and formal specification of the personal communication service","authors":"D. Desbiens, G. Bochmann, Anindya Das, J. Dargham","doi":"10.1109/INFCOM.1993.253294","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253294","url":null,"abstract":"A model and a formal specification of the personal communication service obtained by the application of an object-oriented system design methodology is presented and described using the executable object-oriented specification language Mondel. The goal of developing a specification of PCS is primarily to introduce some structure and formalism in its description, which has so far been done informally, and also to provide a better understanding of its constituent elements and their interrelationships. As Mondel is an executable specification language, simulation is used to verify the basic functionality defined in this specification of PCs. Simulation using various scenarios also provides a means of presenting the different concepts of PCS.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122666208","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253372
M. Ali, Shaying Yang
A random packet selection policy for multicast switching is studied. An input packet generates a fixed number of primary copies plus a random number of secondary copies. Assuming a constant number of contending packets during a slot, the system is modeled as a discrete-time birth process. A difference equation describing the dynamics of this process is derived, the solution of which gives the distribution of the number of packets chosen. This result is extended to the steady-state distribution through an embedded Markov chain analysis. It is shown that the old packets have a larger number of copies than the fresh packets, and the copy distribution is derived. The packet and copy throughputs taking into account the old packets have been determined. The asymptotic distribution of the number of packets chosen is obtained for large switch sizes under saturation by applying results from renewal theory.<>
{"title":"The performance analysis of a random packet selection policy for multicast switching","authors":"M. Ali, Shaying Yang","doi":"10.1109/INFCOM.1993.253372","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253372","url":null,"abstract":"A random packet selection policy for multicast switching is studied. An input packet generates a fixed number of primary copies plus a random number of secondary copies. Assuming a constant number of contending packets during a slot, the system is modeled as a discrete-time birth process. A difference equation describing the dynamics of this process is derived, the solution of which gives the distribution of the number of packets chosen. This result is extended to the steady-state distribution through an embedded Markov chain analysis. It is shown that the old packets have a larger number of copies than the fresh packets, and the copy distribution is derived. The packet and copy throughputs taking into account the old packets have been determined. The asymptotic distribution of the number of packets chosen is obtained for large switch sizes under saturation by applying results from renewal theory.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126447059","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253382
J. Wieselthier, A. Ephremides
The authors present a performance analysis of the wireless integrated multiple access (WIMA) protocol, which is well suited to either satellite or terrestrial networks. A two-dimensional first-order Markov chain model for this scheme is presented, and techniques that exploit the structural properties of this chain to simplify the evaluation of the equilibrium state, without sacrificing accuracy, are described. Analytical models for the evaluation of data-packet delay for both fixed- and movable-boundary versions of this protocol and for voiceband blocking probability are presented. Performance results illustrate the dependence of performance on system parameters, and demonstrate the improved performance that can be achieved through the use of the movable-boundary version.<>
{"title":"Performance analysis of fixed- and movable-boundary channel-access schemes for integrated voice/data wireless networks","authors":"J. Wieselthier, A. Ephremides","doi":"10.1109/INFCOM.1993.253382","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253382","url":null,"abstract":"The authors present a performance analysis of the wireless integrated multiple access (WIMA) protocol, which is well suited to either satellite or terrestrial networks. A two-dimensional first-order Markov chain model for this scheme is presented, and techniques that exploit the structural properties of this chain to simplify the evaluation of the equilibrium state, without sacrificing accuracy, are described. Analytical models for the evaluation of data-packet delay for both fixed- and movable-boundary versions of this protocol and for voiceband blocking probability are presented. Performance results illustrate the dependence of performance on system parameters, and demonstrate the improved performance that can be achieved through the use of the movable-boundary version.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131783345","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253259
L. Tassiulas, Y. Hung, S. Panwar
The problem of optimal buffer space priority control in an asynchronous transfer mode (ATM) network node is studied. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceed the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriate selection of the classes of cells that are dropped in case of overflow, the more sensitive classes can be made to suffer smaller cell losses. Arriving cells might be blocked from entering the system or they may be dropped after they are already in the buffer. Depending on the control that is on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.<>
{"title":"Optimal buffer control during congestion in an ATM network node","authors":"L. Tassiulas, Y. Hung, S. Panwar","doi":"10.1109/INFCOM.1993.253259","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253259","url":null,"abstract":"The problem of optimal buffer space priority control in an asynchronous transfer mode (ATM) network node is studied. The buffer of a transmission link is shared among the cells of several traffic classes waiting for transmission through the link. When the number of cells to be stored in the buffer exceed the available buffer space, certain cells have to be dropped. Different traffic classes have different sensitivities to cell losses. By appropriate selection of the classes of cells that are dropped in case of overflow, the more sensitive classes can be made to suffer smaller cell losses. Arriving cells might be blocked from entering the system or they may be dropped after they are already in the buffer. Depending on the control that is on the system, three classes of policies are distinguished. In each one, policies that schedule the buffer allocation in some optimal manner are identified.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130432954","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253300
G. J. Miller, M. Paterakis
The p/sub i/-persistent protocol, a probabilistic scheduling that is suitable for multiple-access communication applications requiring large bandwidth over very long distances, is considered. A dynamic control algorithm for the multipriority p/sub i/-persistent protocol that makes it possible to adapt to changing network conditions in a fully distributed manner is presented. Through a simulation model, the performance of the dynamic algorithm under various changing network scenarios is studied, and the ability of the protocol to provide the desired quality of service to each priority class of traffic is demonstrated.<>
{"title":"Performance evaluation of a dynamic priority mechanism for the p/sub i/-persistent protocol for metropolitan area networks","authors":"G. J. Miller, M. Paterakis","doi":"10.1109/INFCOM.1993.253300","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253300","url":null,"abstract":"The p/sub i/-persistent protocol, a probabilistic scheduling that is suitable for multiple-access communication applications requiring large bandwidth over very long distances, is considered. A dynamic control algorithm for the multipriority p/sub i/-persistent protocol that makes it possible to adapt to changing network conditions in a fully distributed manner is presented. Through a simulation model, the performance of the dynamic algorithm under various changing network scenarios is studied, and the ability of the protocol to provide the desired quality of service to each priority class of traffic is demonstrated.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130540914","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253327
S. Sibal, Ji Zhang
The operating characteristics of a class of tandem banyan switching fabrics (TBSFs) built using bi-delta networks are examined. Functional equivalence between bi-delta networks induces an equivalence between TBSFs as well. A weaker form of equivalence guaranteeing identical performance under the conditions of symmetric traffic is studied, and sufficient conditions for weak equivalent between functionally distinct TBSFs is established. These results hold for a variety of conflict resolution policies (CRPs). Simulations indicate that a TBSF constructed by cascading omega networks (or in fact any other TBSF in its weak equivalence class) performs better than the two TBSFs studied by F.A. Tobagi et al. (1991) and converges rapidly to a theoretical lower bound on the loss rate in the region of interest.<>
{"title":"On a class of Banyan networks and tandem Banyan switching fabrics","authors":"S. Sibal, Ji Zhang","doi":"10.1109/INFCOM.1993.253327","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253327","url":null,"abstract":"The operating characteristics of a class of tandem banyan switching fabrics (TBSFs) built using bi-delta networks are examined. Functional equivalence between bi-delta networks induces an equivalence between TBSFs as well. A weaker form of equivalence guaranteeing identical performance under the conditions of symmetric traffic is studied, and sufficient conditions for weak equivalent between functionally distinct TBSFs is established. These results hold for a variety of conflict resolution policies (CRPs). Simulations indicate that a TBSF constructed by cascading omega networks (or in fact any other TBSF in its weak equivalence class) performs better than the two TBSFs studied by F.A. Tobagi et al. (1991) and converges rapidly to a theoretical lower bound on the loss rate in the region of interest.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133644752","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253375
Michael Sample, G. Neufeld
The task of encoding complex data structures for network transmission is more expensive is terms of processor time and memory usage than most other components of the protocol stack. This problem can be partially addressed by simplifying the network data encoding rules and streamlining their implementation. The authors examine the performance of four network data representation standards: ASN.1 Basic Encoding Rules (BER) and Packed Encoding Rules (PER), Sun Microsystems' External Data Representation (XDR), and Apollo Computer's Network Data Representation (NDR). It is found that the areas crucial to efficient encoder and decoder implementations are memory management, buffer management, and the overall simplicity of the encoding rules. It is shown that it is possible to implement ASN.1 BER and PER encoders and decoders that are as fast as their corresponding XDR versions.<>
{"title":"Implementing efficient encoders and decoders for network data representations","authors":"Michael Sample, G. Neufeld","doi":"10.1109/INFCOM.1993.253375","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253375","url":null,"abstract":"The task of encoding complex data structures for network transmission is more expensive is terms of processor time and memory usage than most other components of the protocol stack. This problem can be partially addressed by simplifying the network data encoding rules and streamlining their implementation. The authors examine the performance of four network data representation standards: ASN.1 Basic Encoding Rules (BER) and Packed Encoding Rules (PER), Sun Microsystems' External Data Representation (XDR), and Apollo Computer's Network Data Representation (NDR). It is found that the areas crucial to efficient encoder and decoder implementations are memory management, buffer management, and the overall simplicity of the encoding rules. It is shown that it is possible to implement ASN.1 BER and PER encoders and decoders that are as fast as their corresponding XDR versions.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114419891","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253280
Salvatore Torrente, S. Morgera, K. Lester
Results and observations gathered while implementing the ANSI T1M1.5 GNM-T1.214 standard within an object-oriented database management system (ODBMS) framework are discussed. The generic network model (GNM) proposes a dynamic network modeling methodology that encompasses a wide spectrum of managed telecommunication network resources. Within the GNM, managed telecommunication resources are modeled from building blocks of lower-level resource elements (logical or physical). The complex relationships between GNM resource elements are described either by specialization/generalization or user/containment; therefore, an ODBMS is well suited for implementation of the GNM as compared to conventional database management systems. The ODBMS framework described also allows the database model to evolve with the GNM. It is demonstrated that a proposed refinement of the GNM into subclasses results in a functional database design that can model a large variety of network resources in accord with a standardized network view.<>
{"title":"Implementation of the ANSI T1M1.5 GNM-T1.214 within an ODBMS framework","authors":"Salvatore Torrente, S. Morgera, K. Lester","doi":"10.1109/INFCOM.1993.253280","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253280","url":null,"abstract":"Results and observations gathered while implementing the ANSI T1M1.5 GNM-T1.214 standard within an object-oriented database management system (ODBMS) framework are discussed. The generic network model (GNM) proposes a dynamic network modeling methodology that encompasses a wide spectrum of managed telecommunication network resources. Within the GNM, managed telecommunication resources are modeled from building blocks of lower-level resource elements (logical or physical). The complex relationships between GNM resource elements are described either by specialization/generalization or user/containment; therefore, an ODBMS is well suited for implementation of the GNM as compared to conventional database management systems. The ODBMS framework described also allows the database model to evolve with the GNM. It is demonstrated that a proposed refinement of the GNM into subclasses results in a functional database design that can model a large variety of network resources in accord with a standardized network view.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116722175","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}
Pub Date : 1993-03-28DOI: 10.1109/INFCOM.1993.253376
C. Fan, T. Luckenbach, Xiangwen Xu
The Xpress Transfer Protocol (XTP), a full-featured lightweight protocol with mechanisms and functionality specifically design for high-speed network environments, is examined. XTP can provide the full range of services needed to support distributed processing systems. A software implementation of XTP has been completed to run over the BERKOM broadband ISDN network. The performances of XTP over the BERKOM network and an Ethernet are reported and compared to those of TCP/IP (Transmission Control Protocol/Internet Protocol). XTP has been found to perform about as well as and in some situations better than TCP/IP. A tentative conclusion is that as a full-featured protocol XTP does not gain its performance advantage at the cost of functionality or the other way round.<>
{"title":"Performance comparison and analysis of XTP and TCP/IP over the BERKOM broadband ISDN network","authors":"C. Fan, T. Luckenbach, Xiangwen Xu","doi":"10.1109/INFCOM.1993.253376","DOIUrl":"https://doi.org/10.1109/INFCOM.1993.253376","url":null,"abstract":"The Xpress Transfer Protocol (XTP), a full-featured lightweight protocol with mechanisms and functionality specifically design for high-speed network environments, is examined. XTP can provide the full range of services needed to support distributed processing systems. A software implementation of XTP has been completed to run over the BERKOM broadband ISDN network. The performances of XTP over the BERKOM network and an Ethernet are reported and compared to those of TCP/IP (Transmission Control Protocol/Internet Protocol). XTP has been found to perform about as well as and in some situations better than TCP/IP. A tentative conclusion is that as a full-featured protocol XTP does not gain its performance advantage at the cost of functionality or the other way round.<<ETX>>","PeriodicalId":166966,"journal":{"name":"IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114626395","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：