| 1. |
- Brännström, Robert, et al.
(author)
-
Maintaining gateway connectivity in multi-hop ad hoc networks
- 2005
-
In: Proceedings. - Los Alamitos, Calif : IEEE Computer Society Press. - 0769524214 ; , s. 682-689
-
Conference paper (peer-reviewed)abstract
- The need for maintaining gateway connectivity in an ad hoc access network is vital considering the 80/20 ratio of Internet traffic. There are several proposals of how to integrate gateway forwarding strategies but they all rely on the route discovery procedure of reactive routing protocols. We propose a proactive approach to avoid the delay of the route discovery process. Mobile IP is often suggested to handle macro mobility and we use the advertisements periodically sent by the gateway to update routing tables in the ad hoc network. Since advertisements may arrive to a mobile host through multiple paths, it is important to keep track of the best path to each gateway. We demonstrate the use of a proposed dynamic metric and how to handle location of correspondent hosts. A simulation study demonstrates the usefulness and efficiency of our approach.
|
|
| 2. |
- Fan, Xing, 1975-, et al.
(author)
-
Guaranteed real-time services over standard switched Ethernet
- 2005
-
In: The IEEE Conference on Local Computer Networks, 30th Anniversary. - New York, NY : IEEE Computer Society. - 0769524214 ; , s. 490-492
-
Conference paper (peer-reviewed)abstract
- In this paper, we contribute with an approach to support guaranteed real-time services over standard switched Ethernet without additional hardware or software modification of the switch and the underlying standard. In our proposal, the traffic differentiation mechanism introduced by the IEEE 802.1D/Q standard and the standard hardware-implemented first come first served (FCFS) priority queuing are used in the switch and the source nodes. We have derived a feasibility analysis algorithm that can be used to ensure that the real-time requirements can be met. The algorithm also gives, as a sub-result, the needed buffer space in the end nodes and the switch. Moreover, our feasibility analysis supports variable-sized frames and switches with different bit-rates ports. The simulation analysis verifies our feasibility analysis.
|
|
| 3. |
- March, V., et al.
(author)
-
Collision detection and resolution in hierarchical peer-to-peer systems
- 2005
-
In: Proceedings - Conference on Local Computer Networks, LCN. - 0769524214 - 9780769524214 ; , s. 2-9
-
Conference paper (peer-reviewed)abstract
- Structured peer-to-peer systems can be organized hierarchically as two-level overlay networks. The top-level overlay consists of groups of nodes, where each group is identified by a group identifier. In each group, one or more nodes are designated as supernodes and act as gateways to the nodes at the second level. A collision occurs during join operations, when two or more groups with the same group identifier are created at the top-level overlay. Collisions increase the lookup path length and the stabilization overhead, and reduce the scalability of hierarchical peer-to-peer systems. We propose a new scheme to detect and resolve collisions, and we study the impact of the collision problem on the performance of peer-to-peer systems. Our simulation results show the effectiveness of our scheme in reducing collisions and maintaining the size of the top-level overlay close to the ideal size.
|
|
