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}
Markus Albrecht, M. Frank, P. Martini, Markus Schetelig, Asko Vilavaara, A. Wenzel
We present protocol concepts for an extension of IP for mobility issues in Bluetooth networks. The protocol is called BLUEPAC IP, where BLUEPAC stands for "BLUEtooth Public ACcess". "Public access" means access to various kinds of information in public areas, e.g. airplane, train, hotel room, department store, museum. Bluetooth will reside in low-cost chips that provide wireless communication up to OSI Layer 2. By the end of this year many mobile devices, e.g. notebooks, PDAs, cell phones, will contain Bluetooth chips as a cable replacement. But Bluetooth is move powerful: with a suitable network protocol that inherits all aspects of IP, it will be possible to provide IP services over Bluetooth. BLUEPAC IP takes IP as a basis and additionally includes functionalities of mobile IP and cellular IP for local IP address assignment, routing issues and handoff support.
{"title":"IP services over Bluetooth: leading the way to a new mobility","authors":"Markus Albrecht, M. Frank, P. Martini, Markus Schetelig, Asko Vilavaara, A. Wenzel","doi":"10.1109/LCN.1999.801990","DOIUrl":"https://doi.org/10.1109/LCN.1999.801990","url":null,"abstract":"We present protocol concepts for an extension of IP for mobility issues in Bluetooth networks. The protocol is called BLUEPAC IP, where BLUEPAC stands for \"BLUEtooth Public ACcess\". \"Public access\" means access to various kinds of information in public areas, e.g. airplane, train, hotel room, department store, museum. Bluetooth will reside in low-cost chips that provide wireless communication up to OSI Layer 2. By the end of this year many mobile devices, e.g. notebooks, PDAs, cell phones, will contain Bluetooth chips as a cable replacement. But Bluetooth is move powerful: with a suitable network protocol that inherits all aspects of IP, it will be possible to provide IP services over Bluetooth. BLUEPAC IP takes IP as a basis and additionally includes functionalities of mobile IP and cellular IP for local IP address assignment, routing issues and handoff support.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"2 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":"131405394","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}
The practical network performances of two commercial IEEE 802.11 compliant wireless local area networks (WLANs) are measured at the medium access control sublayer. A number of tests conducted on the WLANs yielded important characteristics such as throughput and response time under various network loads. The results reveal that the buffering and fragmentation of data frames can seriously influence the performance of an IEEE 802.11 WLAN. Although the length of a data frame and the bit rate of the wireless transceiver also affect the WLANs transmission capabilities, its performance is generally unaffected by the type of frame addressing and the use of reservation frames such as request-to-send (RTS) and clear-to-send (CTS). These observations have not been reported in the analytical, simulation or measurement studies carried out so far. Thus, the detailed empirical results presented in this paper will be useful for administrators of IEEE 802.11 WLAN systems.
{"title":"Measured performance of the IEEE 802.11 wireless LAN","authors":"B. Bing","doi":"10.1109/LCN.1999.801993","DOIUrl":"https://doi.org/10.1109/LCN.1999.801993","url":null,"abstract":"The practical network performances of two commercial IEEE 802.11 compliant wireless local area networks (WLANs) are measured at the medium access control sublayer. A number of tests conducted on the WLANs yielded important characteristics such as throughput and response time under various network loads. The results reveal that the buffering and fragmentation of data frames can seriously influence the performance of an IEEE 802.11 WLAN. Although the length of a data frame and the bit rate of the wireless transceiver also affect the WLANs transmission capabilities, its performance is generally unaffected by the type of frame addressing and the use of reservation frames such as request-to-send (RTS) and clear-to-send (CTS). These observations have not been reported in the analytical, simulation or measurement studies carried out so far. Thus, the detailed empirical results presented in this paper will be useful for administrators of IEEE 802.11 WLAN systems.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"09 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":"124643173","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 a typical real-time voice application, voice packets are produced at deterministically-spaced time intervals. In the network they encounter a variable amount of delay that changes the deterministic time intervals. A receiving host can employ a buffer to delay the playout of the voice packets in order to reconstruct the original timing. Adaptive techniques can perform continuous estimations of the network delays and dynamically adjust the buffering delay at the beginning of each talkspurt. Such adjustments are usually undetectable by the human listener. This research develops a new, adaptive "gap-based" algorithm that can be tuned for both end-to-end delay and packet loss to satisfy a user-desired tolerance. This new gap based algorithm adapts the buffering delay based on historical information of arrival and playout times of received voice packers in the previous talkspurt. A simulation study shows that the new gap based algorithm can reduce delay by 10% when compared with existing methods.
{"title":"An algorithm for playout of packet voice based on adaptive adjustment of talkspurt silence periods","authors":"Jesus Pinto, Kenneth J. Christensen","doi":"10.1109/LCN.1999.802033","DOIUrl":"https://doi.org/10.1109/LCN.1999.802033","url":null,"abstract":"In a typical real-time voice application, voice packets are produced at deterministically-spaced time intervals. In the network they encounter a variable amount of delay that changes the deterministic time intervals. A receiving host can employ a buffer to delay the playout of the voice packets in order to reconstruct the original timing. Adaptive techniques can perform continuous estimations of the network delays and dynamically adjust the buffering delay at the beginning of each talkspurt. Such adjustments are usually undetectable by the human listener. This research develops a new, adaptive \"gap-based\" algorithm that can be tuned for both end-to-end delay and packet loss to satisfy a user-desired tolerance. This new gap based algorithm adapts the buffering delay based on historical information of arrival and playout times of received voice packers in the previous talkspurt. A simulation study shows that the new gap based algorithm can reduce delay by 10% when compared with existing methods.","PeriodicalId":265611,"journal":{"name":"Proceedings 24th Conference on Local Computer Networks. LCN'99","volume":"4 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":"127825510","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
扫码关注我们
求助内容：
应助结果提醒方式：