Real-time applications are sensitive to conditions such as transmission delay and jittering. To cut down on the influence generated by the WLAN handoff process, three parts of WLAN （wireless local area networks） han...
详细信息
Real-time applications are sensitive to conditions such as transmission delay and jittering. To cut down on the influence generated by the WLAN handoff process, three parts of WLAN （wireless local area networks） handoff： handoff triggering, access point selection and the fast handoff algorithm are investigated. A fast handoff solution totally based on the station is proposed and it is composed of three parts： a handoff triggering mechanism based on dynamic threshold adjustment; an AP selection criterion based on probe delay; a fast handoff algorithm with differentiated channel selection and a dynamic cache. The station based solution is independent with AP＇s collaboration and avoids any changes in the IEEE 802. l l protocol. It is robust and has very good extensibility. Through tests and evaluation in a hotspot WLAN, the solution effectively reduces handoff latency and user experience of real-time applications is enhanced.
Combining the characteristics of peer-to-peer （P2.） and grid, a super-peer selection algorithm--SSABC is presented in the distributed network merging P2. and grid. The algorithm computes nodes capacities using their...
详细信息
Combining the characteristics of peer-to-peer （P2.） and grid, a super-peer selection algorithm--SSABC is presented in the distributed network merging P2. and grid. The algorithm computes nodes capacities using their resource properties provided by a grid monitoring and discovery system, such as available bandwidth, free CPU and idle memory, as well as the number of current connections and online time. when a new node joins the network and the super-peers are all saturated, it should select a new super-peer from the new node or joined nodes with the highest capacity. By theoretical analyses and simulation experiments, it is shown that super-peers selected by capacity can achieve higher query success rates and shorten the average hop count when compared with super-peers selected randomly, and they can also balance the network load when all super-peers are saturated. When the number of total nodes changes, the conclusion is still valid, which explains that the algorithm SSABC is feasible and stable.
暂无评论