|
E-prints UPC >
Altres >
Enviament des de DRAC >
Empreu aquest identificador per citar o enllaçar aquest ítem:
http://hdl.handle.net/2117/12831
|
| Citació: | Albert Cabellos-Aparicio [et al.]. fP2P-HN: a P2P-based route optimization solution for mobile IP and NEMO clients. A: IEEE International Conference on Communications (ICC). "2009 IEEE International Conference on Communications (ICC 2009)". Dresden: IEEE Computer Society Publications, 2009, p. 1-6. |
| Títol: | fP2P-HN: a P2P-based route optimization solution for mobile IP and NEMO clients |
| Autor: | Cabellos Aparicio, Alberto ; Cuevas, Rubén; Domingo Pascual, Jordi ; Cuevas, Ángel; Guerrero, Carmen |
| Editorial: | IEEE Computer Society Publications |
| Data: | 11-jun-2009 |
| Tipus de document: | Conference report |
| Resum: | Wireless technologies are rapidly evolving and the users are demanding the possibility of changing its point of attachment to the Internet (i.e. default router) without breaking the IP communications. This can be achieved by using Mobile IP or NEMO, however mobile clients must forward its data packets
through its Home Agent (HA) in order to communicate with its peers. This sub-optimal route (lack of route optimization) reduces
considerably the communications performance, increases the delay and the infrastructure load. Additionally, since the HA must forward all the mobile clients’ data packets, it can become the bottleneck of such networks. In this paper we present the
fP2P-HN architecture, a P2P-based solution that allows deploying several HAes throughout the Internet. With this architecture a mobile client can select a closer HA to its topological position in order to reduce the delay of the paths
towards its peers. Furthermore it incorporates flexible HAes that, as we will see, reduce the load at these entities. The main challenge of our solution is signaling the location of the HAes in Internet. We provide an analytical model that evaluates the costs and the benefits of the fP2P-HN architecture. The model shows that the signaling grows logarithmically with the number of HAes and that the reduction is, at least, 20% (lower bound). |
| URI: | http://hdl.handle.net/2117/12831 |
| Versió de l'editor: | 10.1109/ICC.2009.5199036 |
| Versió de l'editor: | http://ieeexplore.ieee.org/Xplore/login.jsp?url=http%3A%2F%2Fieeexplore.ieee.org%2Fiel5%2F5198563%2F5198564%2F05199036.pdf%3Farnumber%3D5199036&authDecision=-203 |
| Apareix a les col·leccions: | Altres. Enviament des de DRAC Departament d'Arquitectura de Computadors. Ponències/Comunicacions de congressos CBA - Sistemes de Comunicacions de Banda Ampla. Ponències/Comunicacions de congressos
|
| Comparteix: |
|
Queda prohibida la reproducció, transformació, distribució i comunicació pública d'aquesta obra. Es permet, en tot cas, la reproducció per a ús privat sempre i quan la còpia que se'n faci no sigui objecte d'utilització col·lectiva ni lucrativa (art. 31.2 del Reial Decret Legislatiu 1/1996, de 12 d'abril, pel qual s'aprova el Text Refós de la Llei de Propietat Intel·lectual, http://bibliotecnica.upc.es/sepi/legislacio.asp).
Per a qualsevol ús que es vulgui fer diferent al permès, dirigiu-vos a: sepi@upc.edu
|