Search

In connection-oriented data transport services, data loss can occur when a service experiences a problem in its end to- end path. To resolve the problem promptly, the data transport systems providing the service must quickly modify their internal configurations, which are distributed among different locations within each system. The configurations are modified through a series of problem (event) handling procedures, which are carried out by multiple control processors in the system. This paper proposes a provisioning-to-signaling method for intercontrol-processor messaging to improve the time efficiency of event processing. This method simplifies the sharing of the runtime event, and minimizes the time variability caused by the amount of event data, which results in a decrease in the latency time and an increase in the time determinacy when processing global events. The proposed method was tested for an event that required 4,000 internal path changes, and was found to lessen the latency time of global event processing by about 50% compared with the time required for general methods to do the same; in addition, it reduced the impact of the event data on the event processing time to about 30%. [ABSTRACT FROM AUTHOR]

In connection-oriented data transport services, data loss can occur when the service experiences a problem on its end-to-end path. To promptly resolve the problem, data transport systems providing the service should quickly modify their internal configurations, which are distributed at different places within each system. This is conducted through a series of problem (event) handling procedures carried out by multiple control processors in the system. This paper proposes a provisioning-to-signaling method for inter-control-processor messaging to improve the time efficiency of the event processing. This method simplifies the runtime event sharing and minimizes the time variability caused by the event data, resulting in a decrease in the latency time and an increase in the time determinacy in processing global events. The proposed method lessens the latency time of global event processing by about 50% compared with general methods for 4,000 internal path changes, and reduces the impact of event data on the event processing time to about 30%. [ABSTRACT FROM AUTHOR]