{"title":"Improving communication network topologies using tabu search","authors":"S. Pierre, A. Elgibaoui","doi":"10.1109/LCN.1997.630901","DOIUrl":"https://doi.org/10.1109/LCN.1997.630901","url":null,"abstract":"This paper proposes a tabu search approach for improving communication network topologies. The problem consists of finding, for a given set of nodes and traffic requirements, a network topology that minimizes the communication cost taking into account some performance and reliability constraints. For this purpose, some moves or focal transformations called perturbations are applied to a starting topology in order to reduce the communication cost or the average packet delay. Preliminary results demonstrate the capability of such an approach to improve the communication cost as well as some performance attributes of network topologies.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121358689","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":"On the number of fiber connections and star couplers in multi-star single-hop networks","authors":"P. Wan","doi":"10.1109/LCN.1997.631017","DOIUrl":"https://doi.org/10.1109/LCN.1997.631017","url":null,"abstract":"The single star optical network is limited in size by the available power budget. When the network size exceeds the number of connections a star coupler can support, it becomes necessary to use multiple passive star couplers to implement the network. The cost of a multi star optical network is determined by the number of fiber connections per station and the number of star couplers in the network. To reduce the cost of the network, it is desirable to use as least amount of fiber connections per station and star couplers as possible. We consider two multi star implementations of single hop networks, and discuss how to implement them with least cost.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127445717","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}
H. Fujii, S. Tanimoto, Takeo Hariu, Hirohisa Miyasiro, Linda Galasso
{"title":"An experimental study of logical office service over international ATM networks","authors":"H. Fujii, S. Tanimoto, Takeo Hariu, Hirohisa Miyasiro, Linda Galasso","doi":"10.1109/LCN.1997.631023","DOIUrl":"https://doi.org/10.1109/LCN.1997.631023","url":null,"abstract":"Recently, demand for mobile computing environments has been increasing greatly, and easy access from remote sites has become desirable. To meet this requirement, NTT has proposed a \"Logical Office\" service, which enables terminal plug & play, multiprotocol, and ubiquitous communication. NTT has already done some Logical Office service experiments, in LAN and Internet environments, which focused on the service offered in the early stages. The paper investigates our proposed Logical Office service over international ATM networks, which focuses on the future stage international ATM test beds between Japan and the US, provided by AT&T, KDD, and NTT, are used for this experiment. It was verified that the Logical Office service worked correctly in the international ATM environments, and that it provided sufficiently practical performance even there.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"23 19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133204791","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 of a symmetric robust WDM network when the channel access pattern at nodes is known","authors":"S. Abd-Elmalak, C. Vaishnav, A. Jayasumana","doi":"10.1109/LCN.1997.631018","DOIUrl":"https://doi.org/10.1109/LCN.1997.631018","url":null,"abstract":"Many WDM architectures are based on fixed wavelength channels which require the lasers to be tuned to their channels accurately. Achieving this task is difficult and costly especially in the distributed environments. Robust WDM is an approach that tolerates large laser wavelength variations, due to temperature drifts and manufacturing tolerances. A reservation based medium access protocol is used to dynamically select the laser for communication. A token passing based control channel assigns a reservation interval to one of the waiting stations. The performance of a circuit switched robust WDM network is considered when each node has only a limited number of lasers. The model evaluates the performance of a network for a given access pattern, specifying the channels accessible to each station. Simulation results are used to verify the analytic results.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123044675","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 estimation of cell loss and cell delay of nonblocking ATM switches","authors":"Junjie Wang, K. Letaief, M. Hamdi, Xi-Ren Cao","doi":"10.1109/LCN.1997.630976","DOIUrl":"https://doi.org/10.1109/LCN.1997.630976","url":null,"abstract":"The performance evaluation of ATM switches is of paramount importance in the design and analysis of ATM networks. In this paper, we focus on the evaluation of the cell loss rate (CLR) and cell delay probability (CDP) in nonblocking ATM switches using computer simulations. In particular, we investigate the potential of using importance sampling techniques as an \"superfast\" alternative to conventional Monte Carlo simulation in finding the CLR and CDP in nonblocking ATM switches. We propose a \"split switch\" method to decouple the input and output queue behaviors, along with the notion of regenerative cycles. Numerical results will demonstrate that considerable computation cost can be saved using the proposed importance sampling techniques while maintaining a high degree of accuracy.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123877958","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}
R. Ramanujan, James A. Newhouse, M. Kaddoura, Atiq Ahamad, Eric R. Chartier, K. Thurber
{"title":"Adaptive streaming of MPEG video over IP networks","authors":"R. Ramanujan, James A. Newhouse, M. Kaddoura, Atiq Ahamad, Eric R. Chartier, K. Thurber","doi":"10.1109/LCN.1997.631009","DOIUrl":"https://doi.org/10.1109/LCN.1997.631009","url":null,"abstract":"The authors present the design of an adaptive service for streaming MPEG video over a best-effort IP network environment. The adaptive video streaming service exploits the inherent adaptiveness of video applications to perform controlled and graceful adjustments to the perceptual quality of the displayed MPEG video stream in response to fluctuations in the QoS delivered by the three primary components in the end-to-end path of a video stream, i.e., the video server, the network, and the receiver. The design supports multiple video adaptation techniques that can be applied individually or in combination to adapt the transmitted video stream in response to fluctuations in the QoS provided by the underlying system. A novel aspect of the design is a video adaptation algorithm that selects the adaptation delivering the best perceptual quality for the video playback for a given QoS delivered by the underlying infrastructure. They describe a prototype implementation of the adaptive video streaming service and present the results of a performance evaluation of this prototype system.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130545431","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}
Kentaro Fukuda, N. Wakamiya, M. Murata, H. Miyahara
{"title":"Rate control of real-time MPEG-2 over ATM DBR service with bandwidth re-negotiation","authors":"Kentaro Fukuda, N. Wakamiya, M. Murata, H. Miyahara","doi":"10.1109/LCN.1997.631008","DOIUrl":"https://doi.org/10.1109/LCN.1997.631008","url":null,"abstract":"The rate control method of MPEG-2 over the ATM DBR service class is proposed. It is intended to guarantee the quality of service required by video applications. The disadvantages of MPEG-2 Test Model 5 are resolved by introducing the bandwidth re-negotiation with the network. And user-oriented high quality video transfer can be guaranteed with the method.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133343370","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":"Algorithm-based error detection in ATM cell schedulers","authors":"Yoon-Hwa Choi","doi":"10.1109/LCN.1997.631020","DOIUrl":"https://doi.org/10.1109/LCN.1997.631020","url":null,"abstract":"We present an algorithm based error detection technique for a real time cell scheduler in ATM switches. The scheduler is designed to realize EDF (earliest deadline first) scheduling to guarantee the end to end delay bounds of real time messages. The algorithm invariants of the scheduler are identified to detect erroneous or out of order cell transmissions due to a malfunctioning scheduler. Since a malfunctioning scheduler is unlikely to produce errors detectable at the host level, an immediate detection and recovery at each switch is highly desirable in order to achieve reliable communication in ATM networks. The hardware overhead for realizing error detection is manageably small. Moreover, error detection can be done locally with negligible time overhead.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133217909","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":"Reduction of self-similarity by application-level traffic shaping","authors":"Kenneth J. Christensen, Varaprasad Ballingam","doi":"10.1109/LCN.1997.631021","DOIUrl":"https://doi.org/10.1109/LCN.1997.631021","url":null,"abstract":"Recent work has demonstrated that network traffic has self similar properties. These properties make short term control of traffic very difficult. Heavy tailed distributions of burst sizes contribute to traffic self similarity. The effects of heavy tailed file transfer traffic on queueing behavior are demonstrated using a simulated traffic source based on empirical Unix file size data. A method of application level traffic shaping, whereby selected large traffic bursts are shaped, is developed. This shaping method is shown to dramatically decrease ATM cell loss at a bottleneck queue. At the expense of a few large file transfers being increased in time duration, many smaller file transfers are decreased in time duration and cell loss is decreased for all file transfers.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116063151","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":"Design of a network shared memory based workstation cluster","authors":"J. Bonney, R. Ramanujan, K. Thurber","doi":"10.1109/LCN.1997.631013","DOIUrl":"https://doi.org/10.1109/LCN.1997.631013","url":null,"abstract":"Network shared memory (NSM) is a low-cost approach for clustering the processing elements of commodity workstations into a single, shared-memory, mid-range parallel computer. This approach is based upon a new way of looking at the role of communication networks in multi-computer systems. The simulation results indicate that the NSM approach has the potential to outperform existing approaches for workstation clustering. In the NSM approach, each workstation has an add-on interface card, called the Network Memory Interface (NMI) card, that is used to interconnect workstations processing elements into a parallel computer. Collectively, the NMIs implement network shared memory, i.e., the coherent, shared address space of all the processors in the cluster. The authors focus on the protocol that is used by the NMIs to communicate with one another.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117305730","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}