{"title":"Scalability improvement of the real-time control protocol (RTCP) leading to management facilities in the Internet","authors":"R. El-Marakby, D. Hutchison","doi":"10.1109/ISCC.1998.702471","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702471","url":null,"abstract":"We address some of the problems concerning RTCP scalabilty in large multicast groups. The problems are summarised as the increased storage state maintained by every member about every other member in the group, the feedback delay, and the bandwidth usage problem especially for receivers that obtain incoming RTCP reports through low bandwidth links. We designed a scheme to tackle these problems and to improve the RTCP scalability. Our scheme is based on a hierarchical structure in which members are grouped dynamically, into local regions and receiver reports (RRs) are sent with limited scope. As a result, the load is distributed among members in the group. Each region has an aggregator (AG) that receives the RRs feedback, performs some aggregation statistics on this control data, then sends these statistics to a manager. The manager performs additional analysis to evaluate the network performance and to estimate regions which are suffering from significant congestion. Finally, we present the benefits of using our scheme.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114480563","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}
O. Cherkaoui, Y. S. Hillaire, H. Mili, A. Obaid, A. Serhrouchni
{"title":"The modularity of SNMPv3","authors":"O. Cherkaoui, Y. S. Hillaire, H. Mili, A. Obaid, A. Serhrouchni","doi":"10.1109/ISCC.1998.702470","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702470","url":null,"abstract":"The Simple Network Management Protocol (SNMP) was introduced in 1988 and is still widely implemented, deployed, and used. SNMPv3 is now in its final stages of standardization. From a practical perspective, we need to consider how telecommunication systems can be extended to consider different versions of SNMP, different applications and different security models. We present an object-oriented implementation of SNMPv3 to create a flexible product architecture. This architecture allows one to easily interface with other modules as required. We also describe network object models and relationships required for the architecture. The implementation uses Java to create modular reusable components. We explain how the architecture using a modular approach can allow interoperability with other SNMP applications. Also, the systems can possibly connect via an API bus to CORBA, JMAPI or WBEM.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123145708","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":"Improving traffic scheduling in wireless ATM networks","authors":"N. Passas, T. Korakis, E. Zervas, L. Merakos","doi":"10.1109/ISCC.1998.702560","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702560","url":null,"abstract":"The medium access control (MAC) protocol and the underlying traffic scheduling mechanism for the radio interface are critical components of a wireless ATM network, aiming to provide ATM-like quality of service (QoS) guarantees over the air. A traffic scheduling algorithm for a wireless ATM customer premises network is proposed. The algorithm operates in the mobile terminals, and complements a centralized scheduling mechanism operating in the base stations, for improved performance. The proposed algorithm is delay oriented to meet the requirements of the various traffic classes defined by the ATM architecture. The system performance improvement attained by the proposed algorithm is evaluated via simulations.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124429891","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":"Performance evaluation of IP controlled-load service over ATM CBR and VBR services","authors":"P. Giacomazzi, L. Musumeci, L. Fratta","doi":"10.1109/ISCC.1998.702531","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702531","url":null,"abstract":"The Internet Engineering Task Force (IETF) has defined the integrated IP services (IIS), with guaranteed quality of service (QoS): the guaranteed and the controlled load services. In particular, the controlled load service (CLS) offers a level of service close to that of the classic best-effort service also under a heavy load. The IETF is considering the ATM CBR, nrt-VBR, and ABR service classes for the transport of CLS over ATM. The first two classes are compared, in order to determine which is the most convenient.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116995178","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":"Narrowband interference suppression via nonlinear estimation","authors":"K. Plataniotis, A. Venetsanopoulos","doi":"10.1109/ISCC.1998.702428","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702428","url":null,"abstract":"The problem of narrowband interference suppression in impulsive noise environments is considered. To suppress the interference we introduce a new nonlinear estimator. The proposed estimator can be applied to any discrete time, linear system which is observed in additive non-Gaussian measurement noise. The new filter is recursive, computationally efficient and with significantly improved performance over other linear and nonlinear schemes which are currently used for interference suppression.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123771519","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":"Vicinity routing in large scale networks","authors":"I. Cidon, A. Levy","doi":"10.1109/ISCC.1998.702557","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702557","url":null,"abstract":"Efficient routing has been one of the most challenging topics in the communication networks field. Collecting the topology and network state information to every node has become a popular approach (termed a link state protocol). Applying this technique introduces a problem of a large amount of data and information updates. In large networks it leads to hierarchical division of the network into smaller clusters. Our solution takes a different direction. It defines a vicinity around each node that is updated with the local node and link information. Outside the vicinity an hierarchical yet flexible structure of the border node is defined. The route is calculated up to the nearest border and from this point a new calculation is made. This new architecture eliminates the need of dividing the network into clusters, in particular solving the inefficiency when such a partition is done manually.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126956706","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}
M. Sherif, A. Serhrouchni, A. Y. Gaid, F. Farazmandnia
{"title":"SET and SSL: electronic payments on the Internet","authors":"M. Sherif, A. Serhrouchni, A. Y. Gaid, F. Farazmandnia","doi":"10.1109/ISCC.1998.702546","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702546","url":null,"abstract":"This paper presents a service architecture that combines SET and SSL to provide a lightweight secure electronic commerce system. Although both protocols secure data over an open network like the Internet, they differ in their mode of operation. SET defines secure transaction-oriented exchanges for payment systems whereas SSL secures point-to-point communications. SET and SSL are complementary and the combined architecture permits a gradual introduction of SET services by reducing the need for cardholder certification.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121987351","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 cell burst scheduling for ATM networking. II. Implementation","authors":"C. Tang, Anthony T. Chronopoulos, E. Yaprak","doi":"10.1109/ISCC.1998.702565","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702565","url":null,"abstract":"For pt.I see ibid. p.445-61. The scheduling scheme of a switch affects the delay, throughput and fairness of a network and thus has a great impact on the quality of service (QoS). In part I, we present a theoretical analysis of a burst scheduling for ATM switches and proved QoS guarantees on throughput and fairness of the applications. Here, we use simulation to demonstrate the superiority of the burst based weighted fair queueing over the non-burst version. Our simulation study is based on backbone and access subnetworks, which are common in the real world.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128241489","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":"Analysis and simulation of multipath interference of FM subcarrier digital signals","authors":"L. Zeger, Pei Chen, Hisashi Kobayashi","doi":"10.1109/ISCC.1998.702430","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702430","url":null,"abstract":"We present analytical results characterizing the effects of multipath interference on an FM subcarrier data channel. A closed form expression for the FM discriminator output (or the instantaneous received frequency) is obtained when there are M reflected path signals in addition to the primary path signal. We derive the power spectral density when the multipath interference is weak, and determine the conditions under which multipath interference causes nonlinearities in the instantaneous frequency of the received signal. In order to verify our analytical results, we have built an SPW simulator of HSDS (the high speed data service) system, and we have observed close agreement between our analysis and simulations. The analytical techniques presented could potentially be applied to other FM subcarrier systems, as well as to digital wireless systems that adopt FSK or its variants. Hence, our results could be useful in understanding noncoherent reception of the GSM digital cellular system, for example.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128262602","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":"Functional considerations for development of SDH technology-based broadband digital cross-connect system","authors":"Sigion Kim, Ki-Shick Park","doi":"10.1109/ISCC.1998.702575","DOIUrl":"https://doi.org/10.1109/ISCC.1998.702575","url":null,"abstract":"It is necessary to enhance the telecommunication environments to support high speed and flexible networking. To meet this purpose, the paper describes the functional considerations for the development of a digital cross-connect system, named the BDCS (broadband DCS), that is based on the SDH (synchronous digital hierarchy) technology. These are the switching functions, network survivability functions, sub-network management functions and the test access functions. In examining the switching functions for the cross-connection of the individual AU (administrative unit) and TU (tributary unit), the paper describes the switching steps and discusses the system capacity. The network survivability functions are described with reference to their importance in the public network. A method for the total network management function with sub-network management capabilities is suggested. The test access functions are described in view of its capacity and test methods.","PeriodicalId":256339,"journal":{"name":"Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128565808","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}