Service duration based scheduling method in hybrid switching network

Abstract

The invention relates to a service duration based scheduling method in a hybrid switching network, which comprises the steps of: 1, acquiring a network physical topology G which needs to be subjectedto path resource allocation, wherein a hybrid network corresponding to the network physical topology G comprises N nodes; 2, collecting resource state information of the hybrid network corresponding to the network physical topology G, and constructing a heterogeneous link state table; 3, according to different characteristics of a heterogeneous link, constructing a layered graph model; 4, carryingout numbering on each service in a service request matrix D in the network, and according to service characteristics of each service in the service request matrix D, carrying out classification; and5, according to different types of services, shortening a path inquiry range, and carrying out resource scheduling based on a service duration.

Description

technical field [0001] The invention relates to a scheduling method based on service duration in a hybrid switching network, which belongs to data communication transmission technology. Background technique [0002] Currently, commonly used network scheduling methods include scheduling algorithms for assigning fixed time slots and scheduling algorithms based on priority queues. The scheduling algorithm for allocating time slots allocates fixed time slots for each service by establishing a time slot table, which has problems such as complex synchronization control of the entire network and weak adaptability to burst services; the scheduling algorithm based on priority queues is based on a certain According to the priority rules, different input service flows are temporarily stored in the corresponding queues for scheduling and service, which can quickly solve the scheduling problem of electrical services, but it is difficult to apply to optical services with difficult bufferi...

AI Technical Summary

Problems solved by technology

The scheduling algorithm for allocating time slots allocates fixed time slots for each service by establishing a time slot table, which has problems such as complex synchronization control of the entire network and weak adaptability to burst services; the scheduling algorithm based on priority queues is based on a certain According to the priority rules, different input service flows are temporarily stored in the corresponding queues for scheduling and service, which can quickly solve the scheduling problem of electrical services, but it is difficult to apply to optical services with difficult buffering and large granularity

However, the existing hybrid switching network resource scheduling method adopts a cascaded / separated scheduling method and a joint scheduling method. The cascaded / separated resource scheduling method adopts different scheduling methods for multi-layer and multi-domain link resources, and does not separate the resources between layers. The grooming link resources between domains are considered uniformly, and the link resources between layers and domains lack necessary coordination

The core idea of ​​the joint scheduling method is that each layer and each domain in the switching network is not designed independently. By comprehensively considering the resource parameters between adjacent layers or adjacent domains, each link resource is integrated through a cross-layer and cross-domain decision-making module. Resource allocation, through the coordination and fusion of resource parameters scattered in each layer, but the variety of link resources makes this method complex in technology and complex in resource scheduling methods.

Images