A Decentralized Traffic Management Approach for Ambient Networks Environments

  • María Ángeles Callejo-Rodríguez
  • Jorge Andrés-Colás
  • Gerardo García-de-Blas
  • Francisco Javier Ramón-Salguero
  • José Enríquez-Gabeiras
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3775)


This paper presents a decentralized traffic management solution suitable for Ambient Networks environments, where heterogeneous networks will have to cooperate with a high degree of dynamicity, both in traffic patterns and network topologies. Considering IP as the base inter-network technology in these environments, the proposed mechanism autonomously interacts with existing intra-domain routing protocols to improve traffic performance. The proposal has been evaluated by simulation and has been shown how it significantly improves the traffic performance with respect to the solutions currently deployed in networks. For the two simulated scenarios, the proposed solution is able to manage 38% and 15% more traffic than current solutions when the network starts to be congested. Anyway, the behavior of the proposed solution is currently being analyzed in more dynamic scenarios in order to check its goodness for different Ambient Networks environments.


Optimal Path Loss Ratio Node Check Primary Loop Internet Engineer Task 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Niebert, N., Schieder, A., Abramovicz, H., Malmgren, G., Sachs, J., Horn, U., Prehofer, C., Karl, H.: Ambient Networks: An Architecture for Communication Networks Beyond 3G. IEEE Wireless Communications (April 2004)Google Scholar
  2. 2.
    Awduche, D., Malcolm, J., Agogbua, J., O’Dell, M., McManus, J.: Requirements for Traffic Engineering Over MPLS, Request for Comments 2702. Internet Engineering Task Force (1999)Google Scholar
  3. 3.
    Ramón-Salguero, F.J., Enríquez-Gabeiras, J., Andrés-Colás, J., Molíns-Jiménez, A.: Multipath Routing with Dynamic Variance, COST 279 Technical Report TD02043 (2002)Google Scholar
  4. 4.
    Hopps, C.: Analysis of an equal-cost multi-path algorithm, Request for Comments 2992, Internet Engineering Task Force (2000)Google Scholar
  5. 5.
    Moy, J.: OSPF Version 2, STD 54, Request for Comments 2328, Internet Engineering Task Force (1998)Google Scholar
  6. 6.
    Callon, R.: Use of OSI IS-IS for Routing in TCP/IP and Dual Environments, Request for Comments 1195, Internet Engineering Task Force (1990)Google Scholar
  7. 7.
    Villamizar, C.: OSPF optimized multipath (OSPF-OMP), Internet Draft, draft-ietf-ospf-omp-03 (1999)Google Scholar
  8. 8.
    Gojmerac, I., Ziegler, T., Ricciato, F., Reichl, P.: Adaptive Multipath Routing for Dynamic Traffic Engineering. IEEE Globecom (2003)Google Scholar
  9. 9.
    The Network Simulator - ns-2,
  10. 10.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)zbMATHGoogle Scholar
  11. 11.
    Reference Transport Network Scenarios, IST COST/COST 266,

Copyright information

© IFIP International Federation for Information Processing 2005

Authors and Affiliations

  • María Ángeles Callejo-Rodríguez
    • 1
  • Jorge Andrés-Colás
    • 1
  • Gerardo García-de-Blas
    • 1
  • Francisco Javier Ramón-Salguero
    • 1
  • José Enríquez-Gabeiras
    • 1
  1. 1.Advanced Networks Planning DepartmentTelefónica I+DMadridSpain

Personalised recommendations