{"title":"Simple and efficient pricing mechanisms for multi-service networks","authors":"R. Simon, B. Jukic, Woan Sun Chang","doi":"10.1109/LCN.2001.990807","DOIUrl":"https://doi.org/10.1109/LCN.2001.990807","url":null,"abstract":"This paper presents a fully distributed simple and efficient pricing mechanism that combines admission control for QoS traffic with pricing policies for both best-effort and QoS traffic. Using readily available network measurements, we show how near-optimal pricing policies can be obtained for resource allocation between QoS and best-effort traffic. One of the advantages of our scheme is that it is ex-ante, meaning that the price structure does not change after service has begun.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133252309","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":"Adaptive header compression for wireless networks","authors":"Changli Jiao, L. Schwiebert, G. Richard","doi":"10.1109/LCN.2001.990812","DOIUrl":"https://doi.org/10.1109/LCN.2001.990812","url":null,"abstract":"TCP/IP header compression has long been used to send information efficiently and to improve the response time of communication systems. It is also well known that errors on the link where header compression is used can deteriorate the performance. In addition, the previously noticed high frequency of some computer networking problems can make the performance of header compression even worse. These problems include packet reordering and packet errors that avoid link layer error detection. We analyze the influence of these problems on existing header compression algorithms. We also propose an adaptive header compression that gives better performance.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131707453","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 fluid-flow characterization of Internet1 and Internet2 traffic","authors":"Joe Rogers, Kenneth J. Christensen","doi":"10.1109/LCN.2001.990830","DOIUrl":"https://doi.org/10.1109/LCN.2001.990830","url":null,"abstract":"We study the characteristics of Internet1 and Internet2 traffic at a network access point at a major USA university. With the use of fluid-flow modeling, we show that Internet1 and Internet2 traffic have different queuing behavior and that a small percentage of traffic on both networks largely contributes to this overall queuing behavior. We also demonstrate that buffer sizing, as a method to reduce loss, is largely ineffective for Internet2 traffic. These finding have implications for quality of service of Internet applications.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131742338","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 causal-phase protocol to order soft real-time transactions in a distributed database","authors":"B. Sadeg, L. Amanton, S. Bouzefrane","doi":"10.1109/LCN.2001.990798","DOIUrl":"https://doi.org/10.1109/LCN.2001.990798","url":null,"abstract":"Real-time database applications are distributed in nature. Incorporating distributed data into a real-time database framework incurs complexity associated with transaction concurrency control and database recovery in a distributed context. This article presents an algorithm that manages soft real-time transactions in a distributed database. It uses a specific causal-ordering protocol to ensure the precedence relationships between transactions. Our algorithm is based on a technique which subdivides transactions into sets. Then the protocol virtually serializes the executions on distributed servers by using causal phase ordering properties. Causal phases are created according to transaction conflicts that may occur between transaction sets. Transactions of the same phase are scheduled according to their criticality and transactions of two successive phases are ensured to commit in a causal partial order This strategy permits us to reduce the execution time, allowing more transactions to meet their deadlines.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131791997","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 video quality using packet interleaving, randomisation and redundancy","authors":"S. K. Chin, R. Braun","doi":"10.1109/LCN.2001.990816","DOIUrl":"https://doi.org/10.1109/LCN.2001.990816","url":null,"abstract":"Careful examination of packet traces taken from the MBone reveals a significant number of multiple successive packet losses, even though losses are predominantly isolated. This paper presents a method for reducing the number of burst losses by transforming them into single isolated losses. In this method, the first step is to separate critical video information from noncritical video signals, assuming the availability of an efficient layered coder. Secondly, by, exploiting the unordered delivery, feature of UDP, packets are interleaved and randomized so as to spread out the loss of critical video information. Finally, in order to reduce the number of random losses, redundant packets of essential video data are included in the interleaved/randomized packet sequence. To prove the effectiveness of this method, experiments were conducted on packet traces collected from the MBone. Results indicate that interleaving/randomization alone, significantly reduces consecutive packet burst losses. Furthermore, results are even better with the inclusion of essential redundant video data, which dramatically reduces the number of disjoint losses.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131947483","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":"Application-to-application priority with STREAMS","authors":"D. Ford, S. Zeadally","doi":"10.1109/LCN.2001.990803","DOIUrl":"https://doi.org/10.1109/LCN.2001.990803","url":null,"abstract":"STREAMS-based protocol stacks have become integral components of many desktop operating systems. We explore the UNIX STREAMS architecture in providing priority to networked applications at the end system. We modified the underlying network device driver (a STREAMS-based Ethernet device driver) to enable demultiplexing of packets based on their priorities. We explored the benefits of our approach by conducting several performance tests. Using the modified Ethernet driver combined with the priority STREAMS offers, our test results yield a 550% improvement over the traditional approach where no priority is used in packet delivery to end user applications.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134453106","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":"CONRAD: a novel medium access control protocol for WDM local lightwave networks enabling efficient convergence of real-time and data services","authors":"K. Bengi, H. R. As","doi":"10.1109/LCN.2001.990824","DOIUrl":"https://doi.org/10.1109/LCN.2001.990824","url":null,"abstract":"This paper proposes a new medium access control (MAC) protocol named CONRAD (CONvergence of Real-time And Data services) for a passive-star based single-hop WDM local lightwave network which efficiently supports services with tight delay constraints, i.e. real-time traffic, and best-effort services, i.e. data traffic, directly in the optical layer. The integration of both service types in a packet-switched environment is primarily achieved by combining two different reservation schemes on the control channel, instead of applying conventional priority strategies or circuit-switched approaches. Thereby, a significant improvement of the access delay balance between real-time and data transmission may be obtained, while the system achieves high throughputs.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133852648","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":"Distributed remote LAN administration tool for Windows NT and 2000-based LANs: preliminary work","authors":"S. Muknahallipatna, J. Kane, J. Hamann","doi":"10.1109/LCN.2001.990768","DOIUrl":"https://doi.org/10.1109/LCN.2001.990768","url":null,"abstract":"In recent years, a large number of businesses and universities have installed local area networks (LAN) based on the Windows NT domain model as their primary computing environment. The system administrators of these new computing environments are finding that the simple remote administration capabilities available in UNIX based LAN are not available. The Windows NT operating system, out of the box, does not provide a simple solution to perform remote administration. The remote administration can be achieved, if an administrator has the expertise in writing Windows scripts using the Windows Resource Kit or writing commands in the Perl language. The majority of current system administrators do not have time to acquire such knowledge. In this paper, we present the preliminary work done in developing a distributed remote LAN administration tool for Windows NT and 2000 based LAN developed for the system administrators at the University of Wyoming. The distributed remote administration tool is being developed with an object-oriented architecture and a graphical user interface.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127952634","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}
Jing Wu, D. Y. Montuno, H. Mouftah, Guoqiang Wang, A. Dasylva
{"title":"Improving the reliability of the label distribution protocol","authors":"Jing Wu, D. Y. Montuno, H. Mouftah, Guoqiang Wang, A. Dasylva","doi":"10.1109/LCN.2001.990792","DOIUrl":"https://doi.org/10.1109/LCN.2001.990792","url":null,"abstract":"The LDP (label distribution protocol) is used in the control plane to control an optical network. The data plane and the control plane of an optical network could be physically separate. So a failure in the control plane does not necessarily imply a data plane failure and that user communications have to be interrupted. The standard LDP, however, does not provide any mechanism to recover the knowledge stored in LDP entities about the status of the data plane after the faults are fixed. This is a reliability problem of LDP and results in the unnecessary degradation of user communications. On the other hand, in MPLS-enabled IP networks, being able to recover LDP sessions would be potentially faster and more scalable than to re-establish all affected LSPs. The proposed recovery method of LDP for the control plane failures uses label information mirrors (LIMs) in upstream downstream label switching routers (LSRs). Each LIM is a copy of the label information database (LID) in the LSR of an LDP session. We propose a systematic approach to synchronize the contents of a LIM and the corresponding LID, and show how a LIM is used to handle a control plane failure. Detailed descriptions of the recovery procedure for both control channel failures and control node failures are presented. Some significant features of the proposal are outlined.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"2010 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121041108","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":"Measuring the reliability and survivability of infrastructure-oriented wireless networks","authors":"U. Varshney, A. Snow, A. D. Malloy","doi":"10.1109/LCN.2001.990842","DOIUrl":"https://doi.org/10.1109/LCN.2001.990842","url":null,"abstract":"The focus of research in wireless networking has been on increasing the capacity and users, reducing call blocking, improving mobility management techniques and optimizing individual wireless links. However, very little attention has been paid towards understanding and improving the reliability and survivability (RS) of wireless networks experiencing infrastructure failures. We present a scalable approach to model and simulate the reliability and survivability of infrastructure-oriented wireless networks. Simulation results include the expected number of failures for different component/link reliability levels, number of subscribers, network size and the total number of subscribers impacted by these failures. The specific simulation work presented here addresses infrastructure reliability and survivability, and is offered as a proof of concept to show that this approach has promise and can offer insights not otherwise gained. Key findings show that survivability characteristics vary widely for reasonable ranges of different component failure frequencies, and that the reliability of some components matter much more than others.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129762872","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}