This paper details the initial development of a unique microcellular wireless network based on IEEE 802.11 compliant equipment. Cellular design considered a free space propagation model supplemented with results from field tested equipment. This model was then used to determine the signal strength that may be achieved in a variety of different environments by applying a classical propagation loss model. This work is funded by the EPSRC in the UK in association with NORWEB Communications, and is aimed at investigating the use of high bandwidth mobile communications, in support of field engineers in the utility industry.
{"title":"Determining the propagation range of IEEE 802.11 radio LANs for outdoor applications","authors":"M. Hope, N. Linge","doi":"10.1109/LCN.1999.801995","DOIUrl":"https://doi.org/10.1109/LCN.1999.801995","url":null,"abstract":"This paper details the initial development of a unique microcellular wireless network based on IEEE 802.11 compliant equipment. Cellular design considered a free space propagation model supplemented with results from field tested equipment. This model was then used to determine the signal strength that may be achieved in a variety of different environments by applying a classical propagation loss model. This work is funded by the EPSRC in the UK in association with NORWEB Communications, and is aimed at investigating the use of high bandwidth mobile communications, in support of field engineers in the utility industry.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130520559","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}
Sashi Lazar, D. Sidhu, S. B. Kodeswaran, Rekuram Varadharaj
With the proliferation of new networking technologies, and the demand for new services, it will become increasingly difficult, and nearly impossible, to manage large-scale networks without an intelligent, automated management system. Discovering and keeping track of the topology of a network is essential for effective network management. We introduce a distributed algorithm for discovering the connectivity graph of an ATM network using intelligent mobile agents. In the proposed scheme links are discovered in a distributed fashion, thereby making this approach significantly more scaleable than applications using the traditional client/server model and SNMP.
{"title":"ATM network discovery using mobile agents","authors":"Sashi Lazar, D. Sidhu, S. B. Kodeswaran, Rekuram Varadharaj","doi":"10.1109/LCN.1999.802003","DOIUrl":"https://doi.org/10.1109/LCN.1999.802003","url":null,"abstract":"With the proliferation of new networking technologies, and the demand for new services, it will become increasingly difficult, and nearly impossible, to manage large-scale networks without an intelligent, automated management system. Discovering and keeping track of the topology of a network is essential for effective network management. We introduce a distributed algorithm for discovering the connectivity graph of an ATM network using intelligent mobile agents. In the proposed scheme links are discovered in a distributed fashion, thereby making this approach significantly more scaleable than applications using the traditional client/server model and SNMP.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134030417","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}
Traditionally the routing in passive optical networks is based on an embedded regular virtual topology. However one important fact that has been neglected in the past is that the wavelength assignment to transceivers actually creates additional (logical) links not present in the virtual topology. Such side effect can be utilized to significantly reduce the number of hops between a pair of stations. This observation leads to the concept of super topology. This paper considers the hypercube as the embedded virtual topology. The ideas contained here are easily applicable to networks employing other virtual topologies as well. We present the structure of the super topology, the optimal routing algorithm, the distance between any pair of stations and the diameter in the super topology.
{"title":"Optimal routing based on super topology in hypercube WDM networks","authors":"P. Wan, Liwu Liu, Yuanyuan Yang","doi":"10.1109/LCN.1999.802009","DOIUrl":"https://doi.org/10.1109/LCN.1999.802009","url":null,"abstract":"Traditionally the routing in passive optical networks is based on an embedded regular virtual topology. However one important fact that has been neglected in the past is that the wavelength assignment to transceivers actually creates additional (logical) links not present in the virtual topology. Such side effect can be utilized to significantly reduce the number of hops between a pair of stations. This observation leads to the concept of super topology. This paper considers the hypercube as the embedded virtual topology. The ideas contained here are easily applicable to networks employing other virtual topologies as well. We present the structure of the super topology, the optimal routing algorithm, the distance between any pair of stations and the diameter in the super topology.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133005163","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}
B. V. Houdt, C. Blondia, O. Casals, J. García-Vidal
This paper determines packet level performance measures of a MAC protocol for a wireless ATM local area network. A key characteristic of the MAC protocol is the identifier splitting algorithm with polling, a contention resolution scheme used to inform the base station about the bandwidth needs of a mobile station when no piggybacking can be used. We consider higher layer packets that are generated at the mobile station and investigate the influence of the traffic characteristics of the packet arrival process on the efficiency of the protocol and on the delay that packets experience to access the shared medium.
{"title":"Packet level performance characteristics of a MAC protocol for wireless ATM LANs","authors":"B. V. Houdt, C. Blondia, O. Casals, J. García-Vidal","doi":"10.1109/LCN.1999.801991","DOIUrl":"https://doi.org/10.1109/LCN.1999.801991","url":null,"abstract":"This paper determines packet level performance measures of a MAC protocol for a wireless ATM local area network. A key characteristic of the MAC protocol is the identifier splitting algorithm with polling, a contention resolution scheme used to inform the base station about the bandwidth needs of a mobile station when no piggybacking can be used. We consider higher layer packets that are generated at the mobile station and investigate the influence of the traffic characteristics of the packet arrival process on the efficiency of the protocol and on the delay that packets experience to access the shared medium.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131767771","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}
This paper presents a protocol for packet switched optical LANs using a star topology. The key element in this network is the use of an intelligent hub, which controls the traffic flow and which provides controls for adding and removing new stations from the network. The intelligent hub allows this network design to be scalable, easy to administer and manage, and reduces the complexity and costs of the network interface devices that will be needed at each station. The network makes use of wavelength division multiplexing (WDM) as well as time division multiplexing (TDM) to fully exploit the fiber's bandwidth. Each station will have a tunable transmitter and a slow speed tunable receiver for data traffic and a fixed receiver and fixed transmitter for use on the control channel.
{"title":"An intelligent hub protocol for local area lightwave networks","authors":"D. Callahan, G. Grimes","doi":"10.1109/LCN.1999.802074","DOIUrl":"https://doi.org/10.1109/LCN.1999.802074","url":null,"abstract":"This paper presents a protocol for packet switched optical LANs using a star topology. The key element in this network is the use of an intelligent hub, which controls the traffic flow and which provides controls for adding and removing new stations from the network. The intelligent hub allows this network design to be scalable, easy to administer and manage, and reduces the complexity and costs of the network interface devices that will be needed at each station. The network makes use of wavelength division multiplexing (WDM) as well as time division multiplexing (TDM) to fully exploit the fiber's bandwidth. Each station will have a tunable transmitter and a slow speed tunable receiver for data traffic and a fixed receiver and fixed transmitter for use on the control channel.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124928942","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}
M. Matijasevic, D. Gračanin, K. Valavanis, I. Lovrek
Specification of networking requirements for networked virtual reality applications and a way of propagating the user/application level requirements down to the communication level are open research issues. As a contribution to ongoing research, we propose a model, named interconnection model, that represents a network-oriented view of a distributed virtual environment. Within the model, bandwidth requirements are addressed in more detail for shared virtual objects that change as a result of user interactions. A prototype multi-user distributed virtual environment for teleoperation of a mobile robot has been used as a case study.
{"title":"Interconnection model for networked virtual reality applications","authors":"M. Matijasevic, D. Gračanin, K. Valavanis, I. Lovrek","doi":"10.1109/LCN.1999.801996","DOIUrl":"https://doi.org/10.1109/LCN.1999.801996","url":null,"abstract":"Specification of networking requirements for networked virtual reality applications and a way of propagating the user/application level requirements down to the communication level are open research issues. As a contribution to ongoing research, we propose a model, named interconnection model, that represents a network-oriented view of a distributed virtual environment. Within the model, bandwidth requirements are addressed in more detail for shared virtual objects that change as a result of user interactions. A prototype multi-user distributed virtual environment for teleoperation of a mobile robot has been used as a case study.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122545112","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}
A statistical analysis of Internet traffic measurements from a campus site is carried out to examine the influence of the constituent protocols and applications on the characteristics of the aggregate stream and on packet loss statistics. While TCP remains the dominant traffic protocol through all hours of the day, a mixture of both well-known (HTTP, FTP, NNTP and SMTP) and less known applications contribute significant portions to the TCP traffic mix. Statistical tests show that the aggregate TCP packet arrival process exhibits both nonstationary and nonlinear features. By filtering a subset of the applications found to exhibit nonstationary features from the aggregate process, a stationary traffic stream is derived. This filtered traffic process is modeled using nonlinear threshold autoregressive processes. The traffic model is shown to provide good agreement with the measurement trace in the packet loss statistics. The proposed parametric model allows the design of traffic shapers and provides a simple and accurate approach for simulating Internet data traffic patterns.
{"title":"Time series models for Internet data traffic","authors":"Chun You, K. Chandra","doi":"10.1109/LCN.1999.802013","DOIUrl":"https://doi.org/10.1109/LCN.1999.802013","url":null,"abstract":"A statistical analysis of Internet traffic measurements from a campus site is carried out to examine the influence of the constituent protocols and applications on the characteristics of the aggregate stream and on packet loss statistics. While TCP remains the dominant traffic protocol through all hours of the day, a mixture of both well-known (HTTP, FTP, NNTP and SMTP) and less known applications contribute significant portions to the TCP traffic mix. Statistical tests show that the aggregate TCP packet arrival process exhibits both nonstationary and nonlinear features. By filtering a subset of the applications found to exhibit nonstationary features from the aggregate process, a stationary traffic stream is derived. This filtered traffic process is modeled using nonlinear threshold autoregressive processes. The traffic model is shown to provide good agreement with the measurement trace in the packet loss statistics. The proposed parametric model allows the design of traffic shapers and provides a simple and accurate approach for simulating Internet data traffic patterns.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116120995","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}
In wireless ATM networks, user connections need to be rerouted during handoff as mobile users move among base stations. The rerouting of connections must be done quickly with minimal disruption to traffic. In addition, the resulting routes must be optimal. A reasonable approach is to implement handoff in two phases. In the first phase connections are rapidly rerouted and in the second phase a periodic route optimization procedure is executed. The route optimization should impose minimal signaling and processing load on the ATM switches. In this paper, we propose and study a periodic execution of route optimization for a two-phase handoff scheme. We study two types of execution: non-adaptive and adaptive. For the adaptive optimization, we consider two adaptation schemes that are dependent on network conditions. A simulation model is developed to study system performance. The adaptive route optimization is shown to minimize signaling and processing load while maximizing utilization of reserved resources.
{"title":"Periodic route optimization for handed-off connections in wireless ATM networks","authors":"K. Salah, E. Drakopoulos, T. Elrad","doi":"10.1109/LCN.1999.802001","DOIUrl":"https://doi.org/10.1109/LCN.1999.802001","url":null,"abstract":"In wireless ATM networks, user connections need to be rerouted during handoff as mobile users move among base stations. The rerouting of connections must be done quickly with minimal disruption to traffic. In addition, the resulting routes must be optimal. A reasonable approach is to implement handoff in two phases. In the first phase connections are rapidly rerouted and in the second phase a periodic route optimization procedure is executed. The route optimization should impose minimal signaling and processing load on the ATM switches. In this paper, we propose and study a periodic execution of route optimization for a two-phase handoff scheme. We study two types of execution: non-adaptive and adaptive. For the adaptive optimization, we consider two adaptation schemes that are dependent on network conditions. A simulation model is developed to study system performance. The adaptive route optimization is shown to minimize signaling and processing load while maximizing utilization of reserved resources.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130067830","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}
A. Takahara, S. Tani, S. Ishihara, T. Miyazaki, M. Teramoto, T. Fukazawa, K. Matsuhiro
This paper discusses how a distributed environment providing effortless networking can be efficiently implemented in a network system. To formalize the distributed environment, we introduce the concept of "Virtual BUS". It is similar to the concept of the computer system's bus architecture. We define user behavior as accessing the resources in a network through his/her own bus. Based on this simple formalization, we discuss the key issues in implementing distributed environments to support different requirements for realizing the quality of service desired. We implement an experimental effortless networking environment based on the Virtual BUS concept and show that the concept realizes effortless networking while guaranteeing QoS.
{"title":"Virtual BUS: an easy-to-use environment for distributed resources","authors":"A. Takahara, S. Tani, S. Ishihara, T. Miyazaki, M. Teramoto, T. Fukazawa, K. Matsuhiro","doi":"10.1109/LCN.1999.801997","DOIUrl":"https://doi.org/10.1109/LCN.1999.801997","url":null,"abstract":"This paper discusses how a distributed environment providing effortless networking can be efficiently implemented in a network system. To formalize the distributed environment, we introduce the concept of \"Virtual BUS\". It is similar to the concept of the computer system's bus architecture. We define user behavior as accessing the resources in a network through his/her own bus. Based on this simple formalization, we discuss the key issues in implementing distributed environments to support different requirements for realizing the quality of service desired. We implement an experimental effortless networking environment based on the Virtual BUS concept and show that the concept realizes effortless networking while guaranteeing QoS.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129199199","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}
Delay and bandwidth are important QoS parameters for connections sharing the output link. PFQ algorithms address various issues for handling those parameters. For a leaky bucket constraint traffic, burstiness is also an important characteristic. In this research, we propose a scheme on decoupling delay, bandwidth and burstiness. By doing that, those QoS parameters are guaranteed in a satisfactory degree.
{"title":"Decoupling bandwidth, delay and burstiness of PFQ algorithm for QoS guarantee of a leaky bucket constraint traffic","authors":"WoongChul Choi","doi":"10.1109/LCN.1999.802069","DOIUrl":"https://doi.org/10.1109/LCN.1999.802069","url":null,"abstract":"Delay and bandwidth are important QoS parameters for connections sharing the output link. PFQ algorithms address various issues for handling those parameters. For a leaky bucket constraint traffic, burstiness is also an important characteristic. In this research, we propose a scheme on decoupling delay, bandwidth and burstiness. By doing that, those QoS parameters are guaranteed in a satisfactory degree.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"502 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123414590","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：