{"title":"Automatic registration for dynamic and reconfigurable sensor networks","authors":"S. Balasubramanian, D. Aksoy","doi":"10.1109/LANMAN.2004.1338426","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338426","url":null,"abstract":"Sensors have a constrained lifetime for various reasons such as limited battery power, malfunctioning components, or deactivation due to natural incidents. Therefore, there is a continuous need to deploy new sensors or to change the current topology of the sensors to ensure the functionality of the network. In this paper, we study on-demand communication mechanisms between smart and reconfigurable sensors. We present an automatic registration protocol for publish/subscribe wireless sensor deployments which allows a sensor to register with neighboring sensors upon activation, creates a schedule online without any initial global knowledge of the topology, limits the amount of transmissions made by a sensor, and permits modification to subscription patterns. Our simulation results suggest that our protocol significantly decreases the energy consumption while providing a competitive scheduling in comparison to the offline greedy vertex-coloring algorithm.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"103 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133355996","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":"Admission control for probabilistic services with earliest deadline first scheduling","authors":"Z. Quan, Jong‐Moon Chung","doi":"10.1109/LANMAN.2004.1338433","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338433","url":null,"abstract":"Future high speed packet-switching networks deploying integrated service (IntServ) or differentiated service (DiffServ) architectures are expected to provide heterogeneous quality-of-service (QoS) guarantees for a variety of applications. Call admission control (CAC) plays a critical role in achieving this goal and is an integration of the traffic models, scheduling disciplines, and QoS specifications. Its major task is to decide whether a new connection should be granted while the QoS requirements of all the connections are to be satisfied. However, it is well known that developing an effective and efficient CAC algorithm for a stochastic system such as an EDF scheduler is generally very difficult due to the intractability of per-class QoS analysis. A robust control mechanism is necessary for the long-range dependent traffic with infinite variance. In this paper, we present an admission control algorithm for probabilistic services scheduled by an EDF scheduler. In deriving the admission condition, we consider all the connections with similar QoS constraints as an aggregate traffic class. A statistical framework is also developed to analyze the per-class QoS metrics.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128309672","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":"Memory-bandwidth performance of the sliding-window based routers/switches","authors":"Sanjeev Kumar, T. Doganer","doi":"10.1109/LANMAN.2004.1338432","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338432","url":null,"abstract":"The new class of sliding-window packet switch architecture can be used in Internet routers and gigabit Ethernet switches for internal movement of the packets from its input ports to the output ports. The class of sliding-window switch architecture allows port sharing of its entire memory resource that is comprised of physically separate and parallel memory-modules. However, there are instances where due to preoccupation of memory locations, the parallel storage of all packets belonging to an input cycle may not be possible in just one memory-cycle. This increases the memory-bandwidth requirement of the switching system. In this paper, we present two different memory assignment schemes and compare the performance in terms of memory-bandwidth requirement. It is observed that the parameter-i assignment schemes have direct impact on the memory-bandwidth requirement of the switch. For the parameter-i assignment, the assignment scheme-2 has improved the performance in terms of worst-case memory-bandwidth requirement compared to that of assignment scheme-1.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121532184","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":"Simulation model for an optical burst switched network","authors":"M. Schlosser, H. Woesner, A. Schroth","doi":"10.1109/LANMAN.2004.1338412","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338412","url":null,"abstract":"This paper shows simulation results with IP-traffic in a simple optical burst switched network with two core-nodes and Poisson and Pareto distributed traffic. We first describe a model for an OBS network. It was implemented using the OPNET modeler. The simulations were performed without pre-designing the network to a given traffic matrix. An analytic estimation confirms that flows on longer paths experience unfairness and higher collision rates than on shorter ones.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"313 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124448605","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}
Ming Chen, Rui Zhang, Lihua Song, Guomin Zhang, Jing Chen
{"title":"UNM: an architecture of the universal policy-based network measurement system","authors":"Ming Chen, Rui Zhang, Lihua Song, Guomin Zhang, Jing Chen","doi":"10.1109/LANMAN.2004.1338441","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338441","url":null,"abstract":"The concept of universal network measurement environment (UNME) is proposed, which includes three entities, i.e., the name server, the monitoring center and the probe. The architecture that the entities follow is called the universal network measurement (UNM), which consists of three layers. The key technologies such as component management protocol, network measurement policy protocol and the network measurement cooperative layer are explored and the construction of the probe and the method how to change measurement tools into the UNM probes are introduced. Finally, a real network monitoring & measurement system following UNM is illustrated, and several network measurement applications built on it are introduced.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133132108","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 micromobility environments for various TCP protocols","authors":"Djamel Tandjaoui, N. Badache","doi":"10.1109/LANMAN.2004.1338424","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338424","url":null,"abstract":"The proliferation of portable computing devices like laptops and PDAs within the past few years has led to an increase in the mobility of such devices and the consequent introduction of problems not encountered with static computing. However, the merging of mobile devices needs a new mechanism to handle the nodes mobility. In this paper, the author has studied and discussed the behavior of IP micromobility protocols for various TCP protocols (Tahoe, Reno, NewReno and Sack). The author chose to compare the most known micromobility protocol (CIP, HAWAII and HMIP) for some versions of the TCP protocols. It was shown that with the same hierarchical topology for the three IP micromobility and the same mobile node movement scenario, HAWAII performs better than HMIP and CIP for most TCP protocols. However, In TCP Tahoe and NewReno, HMIP performs quite similar to HAWAII. In addition, simulations have shown that CIP has the worst behavior with the various TCP protocols.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116256493","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":"Optimizing light-trail assignment to WDM networks for dynamic IP centric traffic","authors":"A. Gumaste, G. Kuper, I. Chlamtac","doi":"10.1109/LANMAN.2004.1338414","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338414","url":null,"abstract":"The rapid growth of IP centric communication in worldwide networks and the parallel mass deployment of fiber based WDM networks have propelled IP over WDM being considered as an eventual solution for bandwidth on demand to customers. Contemporary optical networks are, however, based on lightpath communication and a lightpath represents end-to-end optical circuits from source to destination. Light-trails are a generalization of lightpaths, such that multiple nodes along a trail can participate in time differentiated communication over the same established trail. Managing and setting up of light-trails in order to cater to IP centric traffic is a key to the success of IP centric communication at the optical layer. A light-trail represents an open optical path that allows multiple users to communicate without the need for switch reconfiguration at any user node, the light-trail itself being static. IP communication on the other hand represents a bursty traffic flow often characterized by spurts or bursts of data. The goal of this paper is to show how to create efficient light-trails based virtual topology for a given network traffic flow. We first describe a tree-shaped variant of light-trail, called the clustered light-trail (CLT) and then present optimization techniques for satisfying the given IP centric communication requirements, using the light-trails framework that is very flexible, despite being basically a static mechanism.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121023622","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":"Theoretical channel capacity in multi-hop ad hoc networks","authors":"Yue Fang, A. B. McDonald","doi":"10.1109/LANMAN.2004.1338428","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338428","url":null,"abstract":"A channel capacity analysis for multi-hop wireless networks is presented. The methodology is based on the novel concepts of \"deferral set\" and \"equivalent competitor\" which reflects the channel contention and routing characterizations of the multi-hop environment. Analysis is facilitated by applying these concepts to a parametric node model based on medium access specifications. The mean channel throughput and service delay during back-logged periods are studied using the above methodologies and are validated by simulations. This paper presents a new methodology with practical application with respect to effective network design in the areas of routing, admission-control, scheduling and topology control.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115681793","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":"Integrated survivable QoS routing in metro IP/WDM networks","authors":"Wei Wei, Qingji Zeng, Hongquan Wei, Hongtao Yu","doi":"10.1109/LANMAN.2004.1338405","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338405","url":null,"abstract":"It is well known that different telecommunications services have different requirements in term of survivability while different resilience schemes have different survivability performance. This paper focuses on the integrated resilience issues in GMPLS-based metro optical networks (MON) and proposed a new differentiated integrated survivable QoS routing that employs adaptive resilience strategies. For the illustration of the integrated resilience scheme, the paper firstly presents a simplified optical-router node model that has two levels of switching capability: wavelength switching and packet switching. To assess the resilience differentiation and effectiveness of the proposed integrated QoS survivable routing scheme, the paper analyzed the performance of the proposed scheme through simulation experiments.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117192395","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":"Metro mobile ring for high-speed and scalable micro-mobility management","authors":"H. Yokota, T. Kubo, A. Idoue, M. Inoue, K. Mahmud","doi":"10.1109/LANMAN.2004.1338423","DOIUrl":"https://doi.org/10.1109/LANMAN.2004.1338423","url":null,"abstract":"With the growing popularity of WiFi, more businesses and service providers are setting up wireless access points that allow people on the move to access broadband Internet access services as if they were at home or at the office. In this paper, we propose a new micro-mobility management that is designed to cover the size of a metropolitan area. This architecture connects multiple local mobility agents on a flat ring to decentralize the location information of the visiting mobile nodes. Unlike the existing L2 rings such as the token ring, the L3 address of an incoming packet is directly examined for delivery to the destination node. The author implements the proposed method and have shown each performance in various numbers of mobile nodes by measuring the throughput and latency. The author compared the proposed method with the hierarchical network and discussed its advantages in a large-scale network that accommodates tens of thousands of mobile users.","PeriodicalId":245218,"journal":{"name":"The 13th IEEE Workshop on Local and Metropolitan Area Networks, 2004. LANMAN 2004.","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126765427","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}