{"title":"An optimal cache replacement algorithm for Internet systems","authors":"A. Yeung, K. Ng","doi":"10.1109/LCN.1997.630987","DOIUrl":"https://doi.org/10.1109/LCN.1997.630987","url":null,"abstract":"Cache replacement algorithms when applied in Internet systems are studied in this paper. The use of conventional replacement algorithms such as LRU and LFU is first discussed. We then present a new cache replacement algorithm called optimal cache replacement (OCR) algorithm for Internet systems. Analysis and simulation on OCR algorithm are performed. The results show that for small caches, OCR algorithm can outperform the conventional LFU algorithm by giving 50% improvement in cache hit rate. When the cache size is large, OCR algorithm still provides 18% improvement.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"20 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":"126769347","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 agent-based architecture for advance reservations","authors":"O. Schelén, S. Pink","doi":"10.1109/LCN.1997.631014","DOIUrl":"https://doi.org/10.1109/LCN.1997.631014","url":null,"abstract":"The authors propose an architecture where clients can make advance reservations through agents. For each routing domain in the network there will be an agent responsible for admission control on behalf of the routers in the domain. Requests involving several routing domains are forwarded for admission control with agents along the path for the requested service. Agents maintain hard reservation state using a reliable protocol for agent intercommunication. Agents start allocating resources for advance reservations in the routers by setting up forwarding state shortly before resources are needed for packet fop warding. Resources are made available for advance reservations by means of rejecting further immediate requests and ultimately by preempting some immediate reservations. They have shown that the risk of preemption can be kept very low. Thus, agents can set up packet classifiers and schedulers in their routers, allowing routers to get on with their main task, packet forwarding.","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":"130841181","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 monitoring of a wireless campus area network","authors":"A. Messier, J. Robinson, K. Pahlavan","doi":"10.1109/LCN.1997.630992","DOIUrl":"https://doi.org/10.1109/LCN.1997.630992","url":null,"abstract":"In the relatively new field of wireless local area networks there exist three methods for performance evaluation: (1) mathematical analysis; (2) computer simulation; and (3) performance monitoring of a testbed. The data obtained from mathematical analysis and computer simulation are purely speculative, there is simply no way these methods can address all of the complexities associated with network protocols and indoor radio propagation. For this reason, the most useful performance data on wireless LAN hardware is that which is obtained directly from a fully functional working testbed. The National Science Foundation has provided funding for such a testbed that has been installed at the Center for Wireless Information Network Studies (CWINS) at Worcester Polytechnic Institute, Worcester, MA. The authors present the data obtained from this testbed. Their findings show the feasibility and practicality of installing an indoor wireless local area network.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"113 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":"131897356","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 fast optimal slot reuse scheme for CRMA high speed networks","authors":"P. Sheu, Charng-Maw Lin","doi":"10.1109/LCN.1997.630991","DOIUrl":"https://doi.org/10.1109/LCN.1997.630991","url":null,"abstract":"Cyclic-reservation multiple-access (CRMA) is an access scheme for high-speed local and metropolitan area networks based on folded-bus or dual-bus configurations. CRMA provides high throughput and fairness independent of the network speed or distance. In CRMA, the headend generates reserve commands periodically. Each station may reserve a number of empty slots in each reserve command if necessary. Corresponding to every reserve command, the headend generates a cycle of length equal to the total number of empty slots reserved. Every cycle is used to serve the reservations made on its corresponding reserve command. Generally, a longer cycle length means a longer access delay and a lower throughput. Therefore, it is desirable to develop a scheme such that the cycle length is the shortest. The authors study the problem of reducing the total number of empty slots generated within every cycle. However, it has been shown that the problem is NP-complete under the constraint that all the empty slots used by a station in a cycle are required to be consecutive. They release the slot-contiguity constraint and propose a fast optimal slot reuse scheme with low time complexity O(M/sup 2/), where M is the number of stations. To evaluate the effectiveness of the slot reuse scheme, a large number of computer simulations are performed. They compare the slot reuse scheme with the original CRMA in terms of the following three important performance measurements: average cycle length, average throughput, and average MAC delay.","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":"116303852","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 numerical method for performance analysis of ATM multiplexers","authors":"Mehran Dowlatshahi, S. De","doi":"10.1109/LCN.1997.630899","DOIUrl":"https://doi.org/10.1109/LCN.1997.630899","url":null,"abstract":"This paper presents a numerical method for performance analysis of multiplexers in a wide variety of environments. Using this method, performance analysis of ATM multiplexers fed with two important classes of arrival processes, namely correlated on-off and periodic traffic, has been accomplished. Unlike generating function approaches, the proposed analysis method is in time domain and is appropriate for obtaining dynamic measures of ATM multiplexers. In this paper numerical results are found and displayed to show the effect of high priority periodic traffic on performance measures of low priority correlated streams.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"18 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":"122851311","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":"LAN-ATM internetworking over a priority-based slotted-ring network","authors":"H. Çam","doi":"10.1109/LCN.1997.630902","DOIUrl":"https://doi.org/10.1109/LCN.1997.630902","url":null,"abstract":"Bandwidth-intensive and delay-sensitive applications demand ATM technology to be brought into every desktop. However, it is very costly in terms of both hardware and software to replace a traditional LAN such as Ethernet and token ring by an ATM network. Therefore, internetworking LANs with an ATM backbone network is considered a cost-effective and most promising solution for bringing ATM into the mainstream. To sustain delay-sensitive applications (e.g., video or voice) and loss-sensitive applications (e.g., data transfer), this paper presents a slotted-ring network (SRN) with spatial reuse. A simple priority-based access protocol, called the check request before send (CRBS), for providing nonpreemptive multipriority services over SRN is described. SRN provides communication among an ATM switch, ATM stations, and internetworking units connected to legacy LANs. Any node of SRN in the CRBS protocol determines whether it can use a slot, without requiring any authorization or an exchange of message with the other nodes. The CRBS protocol reduces the unfairness features associated with any slotted-ring network. An analytical model is presented to analyze the CRBS protocol under Poisson input traffic and uniform output traffic. Extensive simulations are run to assess the performance of the CRBS protocol for two classes of cells with priorities 0 and 1. The analytical performance results are shown to be close to those obtained by simulations.","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":"130813822","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}
Richard Black, P. Barham, Austin Donnelly, Neil Stratford
{"title":"Protocol implementation in a vertically structured operating system","authors":"Richard Black, P. Barham, Austin Donnelly, Neil Stratford","doi":"10.1109/LCN.1997.630986","DOIUrl":"https://doi.org/10.1109/LCN.1997.630986","url":null,"abstract":"A vertically structured operating system is one in which neither the \"kernel\" nor \"servers\" perform work on behalf of applications-the former because it exists only to multiplex the CPU, and the latter in order to avoid Quality of Service interference between the applications. Instead, wherever possible, the applications perform all of their own processing. Such a vertical structure provides many advantages for applications but leads to some interesting problems and opportunities for protocol stack implementation. This paper describes the techniques we used in our protocol implementation and the benefits that the vertical structure provided.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"201 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":"115815120","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 efficient scheduling mechanism using multiple thresholds for multimedia traffic in ATM switching nodes","authors":"Tae Il Jeong, S. J. Kim, Jae Ho Jeong","doi":"10.1109/LCN.1997.631004","DOIUrl":"https://doi.org/10.1109/LCN.1997.631004","url":null,"abstract":"We propose QLT/MT (Queue Length Threshold with Multiple Thresholds) as a dynamic priority cell scheduling mechanism to serve efficiently the multimedia traffic in ATM networks. The multimedia traffic can be categorized into three classes based on its real time properties and loss tolerance. QLT/MT is designed to schedule the traffic so that first served can be the most urgent class in terms of the priority of its class and the state of its queue. In the QLT/MT model, the cell scheduling relies on the number of cells in the queue of each class and its state determined by multiple thresholds. In order to evaluate our mechanism, the cell loss rate and average delay of QLT/MT are compared with those of the conventional mechanisms such as SPS, QLT, DQLT and DHOL. The simulation result shows that both the cell loss rate and average delay of QLT/MT measured for each class are lower in most cases than those of the other schemes.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"45 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":"132368804","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":"DBP-M: a technique for meeting end-to-end (m, k)-firm guarantee requirement in point-to-point networks","authors":"W. Lindsay, P. Ramanathan","doi":"10.1109/LCN.1997.630999","DOIUrl":"https://doi.org/10.1109/LCN.1997.630999","url":null,"abstract":"A real time message stream is said to have an (m, k) firm guarantee requirement if at least m out of any k consecutive messages from the stream must meet their deadlines to ensure adequate quality of service. M. Hamdaoui and P. Ramanathan (1995) recently proposed a scheduling policy called Distance based Priority Assignment (DBP) to better service multiple real time streams, each with its own (m, k) firm guarantee requirement. The key assumption in the DBP technique is that all messages reach their destination in one hop. This assumption, however, is not valid in most networks because there is often no direct connection between the source and the destination nodes of a real time stream. The DBP scheme is extended to deal with streams in which the messages traverse more than one hop in reaching their destination. Through empirical evaluation, it is also shown that this extended DBP scheme, called DBP-M, performs better than existing policies in reducing the probability of not meeting the (m, k) firm guarantee requirement.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"6 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":"129443679","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 distribution to the home using advance reservation","authors":"J. Harms","doi":"10.1109/LCN.1997.630985","DOIUrl":"https://doi.org/10.1109/LCN.1997.630985","url":null,"abstract":"Through the Internet and service providers such as cable companies it will be possible to receive a wide range of services such as Internet access, video distribution and television in the home. However, a bottleneck in these systems is the bandwidth available to the home and over the cable tv network. In this paper, the use of advance reservation for non-interactive services is proposed to alleviate the problem of limited bandwidth and allow for more services to a wider range of customers. Simulation is used to study the performance of video distribution with advance reservation compared to on-demand service. It is shown that by merging requests, advance reservation significantly increases the amount of traffic the system can handle while still maintaining low delays. It is also shown that the demand system is more susceptible to load increases than the reservation traffic.","PeriodicalId":286255,"journal":{"name":"Proceedings of 22nd Annual Conference on Local Computer Networks","volume":"91 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":"130375851","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}