Abstract: A server of a communication network provides a service to a plurality of users. In the server, a service logic execution environment is stored. The service logic execution environment includes an event router and a service application, which service application includes at least a first component and a second component. The first component is provided with an event handler and the second component is provided with an action handler. The service logic execution environment further includes a flow descriptor which includes a relation between the event handler and the action handler. The event router is adapted to receive an event from the first component and to forward such an event to the second component according to the relation.

Abstract: A server of a communication network provides a service to a plurality of users. In the server, a service logic execution environment is stored. The service logic execution environment includes an event router and a service application, which service application includes at least a first component and a second component. The first component is provided with an event handler and the second component is provided with an action handler. The service logic execution environment further includes a flow descriptor which includes a relation between the event handler and the action handler. The event router is adapted to receive an event from the first component and to forward such an event to the second component according to the relation.

Abstract: A procedure for sorting a plurality of circuit data flows (7, 8, . . . ) located, according to an initial configuration, in a plurality of sets of slots (space, time, frequency or wavelength) in a transport sub-network, comprising the following steps:—calculating a theoretical configuration in which flows are optimised in terms of occupied band by applying a theoretical flow routing algorithm; on the basis of the theoretical configuration defined above, exchanging the position of the flows in the sub-network slots to obtain an optimal arrangement which minimises the occupied slots; flows whose position corresponds to the position assumed by the flows in the initial position are identified to reduce the number of exchanges; defining and implementing a minimum shift sequence of single flows needed to shift each single flow from an initial position occupied in the initial flow configuration to a final position corresponding to the position assumed by the flow in the optimal slot set arrangement.

Abstract: A procedure for sorting a plurality of circuit data flows (7, 8, . . . ) located, according to an initial configuration, in a plurality of sets of slots (space, time, frequency or wavelength) in a transport sub-network, comprising the following steps:—calculating a theoretical configuration in which flows are optimised in terms of occupied band by applying a theoretical flow routing algorithm; on the basis of the theoretical configuration defined above, exchanging the position of the flows in the sub-network slots to obtain an optimal arrangement which minimises the occupied slots; flows whose position corresponds to the position assumed by the flows in the initial position are identified to reduce the number of exchanges; defining and implementing a minimum shift sequence of single flows needed to shift each single flow from an initial position occupied in the initial flow configuration to a final position corresponding to the position assumed by the flow in the optimal slot set arrangement.