Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks最新文献

筛选
英文 中文
A scalable location management scheme in mobile ad-hoc networks 移动自组织网络中可扩展的位置管理方案
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990775
Yuan Xue, Baochun Li, K. Nahrstedt
{"title":"A scalable location management scheme in mobile ad-hoc networks","authors":"Yuan Xue, Baochun Li, K. Nahrstedt","doi":"10.1109/LCN.2001.990775","DOIUrl":"https://doi.org/10.1109/LCN.2001.990775","url":null,"abstract":"In ad-hoc networks, geographical routing protocols take advantage of location information so that stateless and efficient routing is feasible. However such routing protocols are heavily dependent on the existence of scalable location management services. We present a novel scheme to perform scalable location management. With any location management schemes, a specific node, A, in the network trusts a small subset of nodes, namely its location servers, and periodically updates them with its location. Our approach adopts a similar strategy, but a different and original approach to select such location servers. First, we present a selection algorithm used to designate location servers of a node by its identifier. Second, we propose a hierarchical addressing model for mobile ad-hoc networks, where node locations could be represented at different accuracy levels. With this approach, different location servers may carry location information of different levels of accuracy and only a small set of location servers needs to be updated when the node moves. Through rigorous theoretical analysis, we are able to show that the control message overhead is bounded under our scheme. Finally, simulation results are presented to demonstrate the performance of our location management scheme.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"390 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":"115982693","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}
引用次数: 183
QoS based MAC protocol for the home network 基于QoS的家庭网络MAC协议
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990802
W. Hwang, H. Tode, K. Murakami
{"title":"QoS based MAC protocol for the home network","authors":"W. Hwang, H. Tode, K. Murakami","doi":"10.1109/LCN.2001.990802","DOIUrl":"https://doi.org/10.1109/LCN.2001.990802","url":null,"abstract":"The home network is one of the most important information infrastructures of the future. Among the home network solutions available, one promising technology is a HomePNA utilizing the phone line. However, it is not able to guarantee the QoS due to the adaptation of the mature IEEE802.3 CSMA/CD technology which is used for Ethernet. In light of this, we propose and evaluate a new MAC protocol for the home network called the HomeMAC that provides guaranteed QoS for appliances and PCs. HomeMAC features a hybrid CSMA/CD-timed token protocol which combines the CSMA/CD with timed token protocol and transmits real-tune traffic based on the QoS level table (QLT) for guaranteeing QoS. In the HomeMAC, there are two different transmission modes, namely, the CSMA/CD mode when there is no real-time traffic, and the timed token mode when there is real-time traffic taking place. By dynamically switching the transmission mode between CSMA/CD mode and timed token mode in accordance with the different kinds of traffic, the hybrid protocol provides low delay, low jitter, and low loss rate to multimedia appliances such as TVs, DVDs, and PCs. Moreover, by providing flexible bandwidth allocation based on QLT, the HomeMAC can serve high QoS whole covering entire offered load.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"83 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":"125489811","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}
引用次数: 7
Evaluation of quality of service schemes for IEEE 802.11 wireless LANs IEEE 802.11无线局域网服务质量方案评价
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990806
Andreas Almquist, Andreas Lindgren, O. Schelén
{"title":"Evaluation of quality of service schemes for IEEE 802.11 wireless LANs","authors":"Andreas Almquist, Andreas Lindgren, O. Schelén","doi":"10.1109/LCN.2001.990806","DOIUrl":"https://doi.org/10.1109/LCN.2001.990806","url":null,"abstract":"This paper evaluates four mechanisms for providing service differentiation in IEEE 802.11 wireless LANs, the point coordinator function (PCF) of IEEE 802.11, the enhanced distributed coordinator function (EDCF) of the proposed IEEE 802.11e extension to IEEE 802.11, distributed fair scheduling (DFS), and Blackburst using the ns-2 simulator. The metrics used in the evaluation are throughput, medium utilization, collision rate, average access delay, and delay distribution for a variable load of real time and background traffic. The PCF performance is comparably low, while the EDCF performs much better. The best performance is achieved by Blackburst. The DFS provides relative differentiation and consequently avoids starvation of low priority traffic.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"15 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":"129137367","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}
引用次数: 191
Analysis on adjustment-based TCP-friendly congestion control: fairness and stability 基于调整的tcp友好型拥塞控制分析:公平性和稳定性
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990779
Wei Wu, Yong Ren, X. Shan
{"title":"Analysis on adjustment-based TCP-friendly congestion control: fairness and stability","authors":"Wei Wu, Yong Ren, X. Shan","doi":"10.1109/LCN.2001.990779","DOIUrl":"https://doi.org/10.1109/LCN.2001.990779","url":null,"abstract":"In this paper, we focus on understanding the binomial congestion control algorithms (Bansal et al., 2001) and can generalize TCP-style additive-increase by increasing inversely proportional to a power k of the current window (for TCP, k=0) and generalize TCP-style multiplicative-decrease by decreasing proportional to a power l of the current window (for TCP, l=1). We discuss their global fairness and stability. We prove that such congestion control algorithms can achieve (p, k+l+1)-proportional fairness globally no matter what the network topology is and how many users there are. We also study their dynamical behavior through a control theoretical approach. The smoothness of the congestion control results in a less stable system and slower convergence to fair bandwidth allocation. The modeling and discussion in this paper are quite general and can be easily applied to equation-based TCP-friendly congestion control schemes, another category of TCP-friendly transport protocols.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"2014 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":"132365722","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}
引用次数: 0
Ns-based Bluetooth LAP simulator 基于nss的蓝牙LAP模拟器
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990832
Choonhwa Lee, A. Helal
{"title":"Ns-based Bluetooth LAP simulator","authors":"Choonhwa Lee, A. Helal","doi":"10.1109/LCN.2001.990832","DOIUrl":"https://doi.org/10.1109/LCN.2001.990832","url":null,"abstract":"We present a Bluetooth LAN access point (LAP) simulator that we have developed to study pervasive application behavior under Bluetooth local connectivity. Our goal is to explore the impact on IP applications caused by the underlying Bluetooth protocol. Our simulator implements detailed processing of upper layers of the Bluetooth LAP stack, including PPP, RFCOMM, and L2CAP. For lower layers, it tries to capture major characteristics by performing macro-simulation. We present simulation results of a simple network configuration in Bluelooth LAP environments. Our simulator is based on the popular Network Simulator (ns) and its components.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"1 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":"129091701","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}
引用次数: 2
On minimum-energy broadcasting in all-wireless networks 全无线网络中的最小能耗广播
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990787
Fulu Li, I. Nikolaidis
{"title":"On minimum-energy broadcasting in all-wireless networks","authors":"Fulu Li, I. Nikolaidis","doi":"10.1109/LCN.2001.990787","DOIUrl":"https://doi.org/10.1109/LCN.2001.990787","url":null,"abstract":"We study the construction of the source-initiated (one-to-all) wireless broadcast tree to minimize the total required power for a given source node, a group of intended destination nodes and a given propagation constant, ie, the power attenuation constant /spl lambda/. The minimum energy broadcasting (MEB) problem has received much attention recently due to the two main challenges of mobile communication: the limited bandwidth of wireless networks and the limited power supply of mobile units. In a limited-bandwidth environment, push-based techniques, ie, broadcast schemes, appear to be a very effective way to allow mobile units to share the broadcast data on air. In a limited-energy environment, energy- efficient communication architectures and techniques are essential. We first give an insight analysis on the MEB problem and prove the NP-hardness of this problem. We then present an efficient heuristic called iterative maximum-branch minimization (IMBM) to approximate the construction of the minimum-energy broadcast tree, which fully utilizes the wireless broadcast advantage and demonstrates better performance compared with the related approaches. Due to the power-efficient way of the construction of the broadcast tree, the lifetime of the networks can be maximized.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"27 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":"127147313","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}
引用次数: 134
A scalable and high capacity router on multi-dimension crossbar switch principle 基于多维交叉开关原理的可扩展高容量路由器
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990811
Tamaree Nalin, Isobe Takashi, H. Morino, H. Aida, Tadao Saito
{"title":"A scalable and high capacity router on multi-dimension crossbar switch principle","authors":"Tamaree Nalin, Isobe Takashi, H. Morino, H. Aida, Tadao Saito","doi":"10.1109/LCN.2001.990811","DOIUrl":"https://doi.org/10.1109/LCN.2001.990811","url":null,"abstract":"Eventhough conventional multistage switch architecture such as a Banyan switch can support a high speed capacity, but it still has a high latency and is not scalable. Moreover under non-uniform traffic, blocking occurs. Therefore, a new switch architecture based on multi-dimensional crossbar (MDXB) switch is introduced, as a better solution. The MDXB switch is an interconnection among crossbar switches into multi-dimension network. We also propose a new node configuration and routing algorithm used in the MDXB switch to achieve even lower packet loss rate. The simulation results shown that MDXB switch achieves much higher throughput under a non-uniform traffic pattern.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"20 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":"125928494","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}
引用次数: 0
A single system image server cluster using duplicated MAC and IP addresses 使用重复MAC和IP地址的单个系统映像服务器集群
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990789
Sujit Vaidya, Kenneth J. Christensen
{"title":"A single system image server cluster using duplicated MAC and IP addresses","authors":"Sujit Vaidya, Kenneth J. Christensen","doi":"10.1109/LCN.2001.990789","DOIUrl":"https://doi.org/10.1109/LCN.2001.990789","url":null,"abstract":"Clusters of PCs are increasingly being used to build high-capacity Web sites. We develop and evaluate a method of building a single system image (SSI) cluster that does not require a central dispatcher. In our clone cluster method, which builds on the existing ONE-IP method, a group of mirrored server machines with identical MAC and IP addresses are configured on a shared-medium LAN. Each machine filters incoming IP packets based on a hash of IP source addresses. Unlike ONE-IP, our method does not require router configuration changes. We build and evaluate a Linux-based, two-PC cluster that uses an odd/even filter. Simulation results show that the effect of server selection method on mean response time is less significant for heavy-tailed interarrival times than for exponential interarrival times. Simulation results show that response time performance from a Clone Cluster can be very close to that of a centrally dispatched least-loaded cluster.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"16 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":"121907790","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}
引用次数: 27
Using T.38 and SIP for real-time fax transmission over IP networks 使用T.38和SIP在IP网络上进行实时传真传输
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990771
Umang Choudhary, Edward Perl, D. Sidhu
{"title":"Using T.38 and SIP for real-time fax transmission over IP networks","authors":"Umang Choudhary, Edward Perl, D. Sidhu","doi":"10.1109/LCN.2001.990771","DOIUrl":"https://doi.org/10.1109/LCN.2001.990771","url":null,"abstract":"Facsimile (fax) transmission is very important to the world of business. In a world where a significant percentage of long distance public switched telephone network (PSTN) traffic is composed of fax, great savings in toll charges are possible by utilizing IP networks instead. We study the use of T.38 facsimile in conjunction with session initiation protocol (SIP) for transmission of fax traffic over IP networks. Since the interactions of these protocols are not completely standardized, we investigate and propose some practices for this transmission process. Through network simulations of both signaling and data traffic, we determine that real-time fax transmission using SIP is achievable and that it is important to utilize the SIP contact-header for reducing the load on SIP proxy servers and links associated with them.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"13 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":"123561366","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}
引用次数: 6
Using edge-to-edge feedback control to make assured service more assured in DiffServ networks 采用边缘到边缘反馈控制,使DiffServ网络中的服务更加可靠
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks Pub Date : 2001-11-14 DOI: 10.1109/LCN.2001.990781
K. R. Kumar, A. Ananda, L. Jacob
{"title":"Using edge-to-edge feedback control to make assured service more assured in DiffServ networks","authors":"K. R. Kumar, A. Ananda, L. Jacob","doi":"10.1109/LCN.2001.990781","DOIUrl":"https://doi.org/10.1109/LCN.2001.990781","url":null,"abstract":"Markers, one of the building blocks of traffic conditioners play a major role for resource allocation in a DiffServ network. Recently, there has been a considerable research interest in designing intelligent markers, tailored for TCP traffic. The transient congestion levels in the network can affect the TCP throughput adversely and have great impact on the effectiveness of the marker. To address this issue, we propose an intelligent marker, which relies on an ECN-like feedback control mechanism between ingress and egress traffic conditioners. We present the control architecture and the marker algorithm, and illustrate the benefits of the proposed marker in a DiffServ network. The marker was implemented in the NS simulator and extensive simulations were done to study its effectiveness in the assurance of throughput, especially under the case that AS flows require different target rates, and co-exist with the unruly UDP flows. The ECN-like feedback mechanism that we use for the marker is also suitable in an MPLS domain for providing signaling to the ingress router of a congested label switched path (LSP) to mitigate congestion via dynamic traffic engineering techniques.","PeriodicalId":213526,"journal":{"name":"Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks","volume":"24 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120899885","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}
引用次数: 9
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信