The Methods Based on Graph Transformation

  • Admela Jukan
Part of the Progress in Communication Networks book series (PROGRCOMM, volume 1)


As previously stated, a network model which is based on methodology “B” will allow us to make a service-specific level of abstractions of the network state information, with the ultimate scope of accurate routing and resource allocation. A graph- theoretical approach is a natural candidate for this task, because of its intrinsic analogy to the network topology and states. Therefore, in this chapter, our particular focus will be put on the service-specific methods for routing and resource allocation, which will make use of graphs in special structures. For this purpose, we will firstly focus on a model which is more detailed than the one presented in Figure 3-10.


Directed Edge Graph Transformation Network Element Feasible Path Composition Rule 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • Admela Jukan
    • 1
  1. 1.Institute of Communication NetworksVienna University of TechnologyViennaAustria

Personalised recommendations