CN114826820A - FC-AE-1553 network service scheduling method and equipment under centralized control - Google Patents
FC-AE-1553 network service scheduling method and equipment under centralized control Download PDFInfo
- Publication number
- CN114826820A CN114826820A CN202210345818.1A CN202210345818A CN114826820A CN 114826820 A CN114826820 A CN 114826820A CN 202210345818 A CN202210345818 A CN 202210345818A CN 114826820 A CN114826820 A CN 114826820A
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- service
- node
- request
- period
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 230000005540 biological transmission Effects 0.000 claims abstract description 46
- 230000000737 periodic effect Effects 0.000 claims abstract description 34
- 230000003044 adaptive effect Effects 0.000 claims abstract description 14
- 239000011159 matrix material Substances 0.000 claims description 81
- 239000013256 coordination polymer Substances 0.000 claims description 16
- 238000004891 communication Methods 0.000 claims description 14
- 238000004364 calculation method Methods 0.000 claims description 10
- 238000013468 resource allocation Methods 0.000 claims description 4
- 239000002699 waste material Substances 0.000 claims description 4
- 239000000126 substance Substances 0.000 claims 1
- 238000004422 calculation algorithm Methods 0.000 abstract description 5
- 230000003068 static effect Effects 0.000 abstract description 5
- 235000003642 hunger Nutrition 0.000 abstract description 4
- 230000010354 integration Effects 0.000 abstract description 4
- 230000037351 starvation Effects 0.000 abstract description 4
- 238000012856 packing Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 3
- 238000012163 sequencing technique Methods 0.000 description 3
- 230000007547 defect Effects 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000004590 computer program Methods 0.000 description 1
- 230000008094 contradictory effect Effects 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L12/403—Bus networks with centralised control, e.g. polling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L2012/40267—Bus for use in transportation systems
- H04L2012/4028—Bus for use in transportation systems the transportation system being an aircraft
Abstract
The invention provides a method and equipment for scheduling FC-AE-1553 network services under centralized control. The method comprises the following steps: step 1 to step 5: and the main control node MNC issues a scheduling table strategy and waits for next scheduling. The invention carries out request integration to ensure the parallel transmission of the service for the deterministic periodic service, and then adopts a static boxing algorithm to provide higher transmission quality for the bursty service; and for the burst service, the bandwidth resource is dynamically allocated by adopting a weighted first-time adaptive principle, so that the throughput of the network and the fairness of service transmission can be ensured, the starvation phenomenon can not be generated, and the low-delay transmission of the instant service is also ensured.
Description
Technical Field
The embodiment of the invention relates to the technical field of aerospace communication, in particular to a method and equipment for scheduling FC-AE-1553 network services under centralized control.
Background
With the development of the aerospace communication field, the requirements on the reliability, real-time performance and concurrency of service transmission are continuously improved, however, the bus technology in the traditional aerospace electronic field has the defects of low transmission rate, high error rate and few support nodes, so that the requirements on future aerospace communication cannot be met. The FC-AE-1553 network based on the fiber channel also adopts a command/response type communication mode aiming at the field of space communication, has the advantages of high transmission rate, low error rate, good concurrency, compatibility with the traditional bus protocol, support of more complex multi-level network topology and the like, and can better adapt to the complexity of the future aerospace communication to the network and the diverse development of service types. However, the FC-AE-1553 network also has the problems of small network throughput, delay in service transmission in the network and the like. Therefore, it is an urgent technical problem in the art to develop a method and device for scheduling FC-AE-1553 network services under centralized control, which can effectively overcome the above-mentioned drawbacks in the related art.
Disclosure of Invention
Aiming at the problems in the prior art, the embodiment of the invention provides a method and equipment for scheduling FC-AE-1553 network services under centralized control.
In a first aspect, an embodiment of the present invention provides a method for scheduling FC-AE-1553 network services under centralized control, including: step 1: initializing a time slot occupation matrix and a connection credit value matrix of a receiving and transmitting shaft of each link; and 2, step: integrating deterministic services which can be transmitted in parallel and can save bandwidth according to the source and destination addresses, the period and the frame length of the deterministic services, and performing bandwidth allocation on the integrated requests; and step 3: initializing a bandwidth request matrix of the bursty service, collecting the requests of the bursty service by a main control node MNC, updating the bandwidth request matrix, weighting a connection credit value of each request and the bandwidth request respectively to obtain a weighted credit value matrix, then carrying out bandwidth allocation on each request according to the sequence of calculation results from large to small by adopting a first-time adaptive principle, and updating the connection credit value weight matrix; and 4, step 4: each deterministic service and burst service reserves the transmission reservation time of one instant service during bandwidth allocation; and 5: and the main control node MNC issues a scheduling table strategy and waits for next scheduling.
On the basis of the content of the above method embodiment, the FC-AE-1553 network service scheduling method under centralized control provided in the embodiment of the present invention includes that the link transceiving axis time slot occupation matrix and the connection credit value matrix include:
wherein, B is a time slot occupation matrix of a link transceiving axis, C is a connection credit value matrix,
n denotes the number of full duplex links in the network, when b ij When the number of the terminal nodes is equal to 0, the j-th time slot of the transmission/reception axis of the ith link is not occupied, otherwise, the j-th time slot is occupied, N represents the number of the terminal nodes in the network, and c ij C is ≦ c ≦ 1} when c is present ij 0 means that the bandwidth requested from node i to node j is equal to the bandwidth actually allocated when c ij When not equal to 0, the request from the node i to the node j is representedIs different from the allocated bandwidth by Δ C ij With requested bandwidth r ij Length ratio.
On the basis of the content of the above method embodiment, in the FC-AE-1553 network service scheduling method under centralized control provided in the embodiment of the present invention, the step 2 specifically includes:
step 2.1: according to the period PT of each periodic service ij Period determines the size of the basic period FP and the cluster period CP, the cluster period CP is all the service PT ij The least common multiple of period, the basic period FP for all traffic PT ij The greatest common divisor of period, namely:
CP＝n*FP
ensuring that each periodic service is transmitted at most once in a basic period and at least once in a cluster period;
step 2.2: the deterministic services are periodic services, each terminal node NT does not need to make a bandwidth request to the control node NC, the main control node MNC records the information of all the periodic services, and the services are integrated when bandwidth allocation is carried out;
step 2.3: and performing bandwidth allocation on the integrated request. The method comprises the steps of abstracting periodic data frames into objects to be sorted in a packing problem, abstracting bandwidth resources on a receiving and transmitting shaft of each link into boxes to be filled in the packing problem, sequencing the objects to be sorted according to height and width in order to guarantee throughput of a network, and firstly packing large objects into the boxes, namely, distributing the bandwidth resources by adopting a principle of large flow priority, wherein the height and the width of the boxes can be calculated by using an equation (1) and an equation (2), and the height and the width of the objects can be calculated by using an equation (3) and an equation (4).
Object.width＝PT ij .length (4)
Wherein speed in the formula (2) represents the data transmission rate of the link, CP represents the cluster period, FP represents the fundamental period, PT ij Period denotes the period of periodic traffic, PT ij Length represents the length of the periodic traffic; PT ij In { id, source, destination, period, length, link }, subscripts i, j respectively denote a source node i and a destination node j, id denotes a request identifier, source denotes an address of the source node i, destination denotes an address of the destination node j, period denotes a number of cycles of a service, length denotes a requested bandwidth size, and link { l ═ l ik ，l km ，…，l rj Denotes the set of traversed links from source node i to destination node j, where l ik ，l km ，…，l rj Each representing a link.
On the basis of the content of the above method embodiment, in the FC-AE-1553 network service scheduling method under centralized control provided in the embodiment of the present invention, the step 3 specifically includes:
step 3.1: initializing a bandwidth request matrix of the bursty service:
wherein r is ij The { id, source, destination, length, link } represents a bursty bandwidth request from a source node i to a destination node j;
step 3.2: after the bandwidth resource allocation of the deterministic service is finished, the main control node MNC broadcasts in each switching domain in sequence, collects the burst service requests of each switching domain and updates a bandwidth request matrix;
step 3.3: the weighted credit value matrix is updated. The specific calculation formula is as shown in formula (5), and the connection credit value and the requested bandwidth are normalized, wherein W is C And W R Representing the weight, r, of the connection credit and the requested bandwidth size, respectively ij Length represents the size of the bandwidth requested by node i to node j;
wherein, W C And W R Respectively representing connection credit values c ij With bandwidth request r ij The weight occupied by length;
step 3.4: will burst the service request r ij According to a weighted credit value matrix W ij The values of (C) are arranged from large to small in sequence, bandwidth allocation is carried out according to the first-time adaptive principle, and a connection credit value matrix C is updated ij Firstly, allocating bandwidth to the bursty service request with the highest weight, judging whether the bandwidth left by each link in a certain period of time is larger than the requested bandwidth, if so, meeting the total requested bandwidth, if not, continuing the next requested bandwidth allocation until completing the bandwidth allocation of all the requests, and meanwhile, completing the bandwidth request allocation and needing to update the link transceiving axis time slot occupation matrix B and the connection credit value matrix C.
On the basis of the content of the above method embodiment, in the FC-AE-1553 network service scheduling method under centralized control provided in the embodiment of the present invention, the step 4 specifically includes: each deterministic service and bursty service reserves the transmission reserved time of one-time instant service for 0.3 microsecond during bandwidth allocation, so that the bandwidth allocated by the deterministic service and the bursty service is ensured, and excessive waste of resources caused by no instant service in a certain deterministic service and bursty service to seize the bandwidth is avoided.
In a second aspect, an embodiment of the present invention provides an FC-AE-1553 network service scheduling apparatus under centralized control, including: the first main module is used for initializing a time slot occupation matrix and a connection credit value matrix of each link transceiving axis; the second main module is used for integrating the deterministic services which can be transmitted in parallel and save bandwidth according to the source and destination addresses, the period and the frame length of the deterministic services and distributing the bandwidth of the integrated request; the third main module is used for initializing a bandwidth request matrix of the bursty service, the main control node MNC collects requests of the bursty service, updates the bandwidth request matrix, weights a connection credit value of each request and the bandwidth request size respectively to obtain a weighted credit value matrix, then distributes the bandwidth of each request according to the sequence of calculation results from large to small by adopting a first-time adaptive principle, and updates the connection credit value weight matrix; a fourth main module, configured to reserve a sending reservation time of one-time instant traffic when bandwidth allocation is performed on each deterministic traffic and bursty traffic; and the fifth master module is used for the master control node MNC to issue a scheduling table strategy and wait for next scheduling.
In a third aspect, an embodiment of the present invention provides an electronic device, including:
at least one processor; and
at least one memory communicatively coupled to the processor, wherein:
the memory stores program instructions executable by the processor, and the processor calls the program instructions to execute the FC-AE-1553 network service scheduling method under centralized control provided by any one of the various implementations of the first aspect.
In a fourth aspect, an embodiment of the present invention provides a non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the method for scheduling FC-AE-1553 network services under centralized control provided in any one of the various implementations of the first aspect.
According to the FC-AE-1553 network service scheduling method and device under centralized control, the request integration is carried out on the deterministic periodic service to ensure the parallel transmission of the service, and then a static boxing algorithm is adopted to provide higher transmission quality for the bursty service; and for the burst service, the bandwidth resource is dynamically allocated by adopting a weighted first-time adaptive principle, so that the throughput of the network and the fairness of service transmission can be ensured, the starvation phenomenon can not be generated, and the low-delay transmission of the instant service is also ensured.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, a brief description will be given below to the drawings required for the description of the embodiments or the prior art, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a flowchart of a method for scheduling FC-AE-1553 network services under centralized control according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an FC-AE-1553 network service scheduling apparatus under centralized control according to an embodiment of the present invention;
fig. 3 is a schematic physical structure diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention. In addition, technical features of various embodiments or individual embodiments provided by the present invention may be arbitrarily combined with each other to form a feasible technical solution, and such combination is not limited by the sequence of steps and/or the structural composition mode, but must be realized by a person skilled in the art, and when the technical solution combination is contradictory or cannot be realized, such a technical solution combination should not be considered to exist and is not within the protection scope of the present invention.
The embodiment of the invention provides a method for scheduling FC-AE-1553 network services under centralized control, and referring to FIG. 1, the method comprises the following steps: step 1: initializing a time slot occupation matrix and a connection credit value matrix of a receiving and transmitting shaft of each link; step 2: integrating deterministic services which can be transmitted in parallel and can save bandwidth according to the source and destination addresses, the period and the frame length of the deterministic services, and performing bandwidth allocation on the integrated requests; and step 3: initializing a bandwidth request matrix of the bursty service, collecting the requests of the bursty service by a main control node MNC, updating the bandwidth request matrix, weighting a connection credit value of each request and the bandwidth request respectively to obtain a weighted credit value matrix, then carrying out bandwidth allocation on each request according to the sequence of calculation results from large to small by adopting a first-time adaptive principle, and updating the connection credit value weight matrix; and 4, step 4: each deterministic service and burst service reserves the transmission reservation time of one instant service during bandwidth allocation; and 5: and the main control node MNC issues a scheduling table strategy and waits for next scheduling.
It should be noted that FC-AE-1553 is a subset of FC-AE protocol, and besides the characteristics of FC-AE technology, it is also seamlessly compatible with MIL-STD-1553 bus system devices, and it implements smooth upgrade of MIL-STD-1553 bus system, and has the advantages of high reliability, high stability, high bandwidth, strong electromagnetic interference resistance, simple and fast engineering application, and is mainly used in the fields of communication interconnection, data transmission, command control, and the like among electronic devices in severe environments (aviation, aerospace, military).
The FC-AE-1553 network has three topological structures, wherein the first topological structure is a point-to-point structure, the second topological structure is an arbitration ring structure, and the third topological structure is a switching type structure. The first two topological structures have the defects of limited use scenes and weak expansion capability, and when the number of terminals exceeds 127, the first two network structures cannot be used. The exchange type network has the advantages of flexible and changeable structure and strong expansion capability, and can adopt a multi-stage exchange network structure along with the continuous increase of the network scale, and the parallel transmission can further reduce the transmission delay and save the transmission bandwidth.
The FC-AE-1553 network has three scheduling mechanisms: centralized, distributed, and cached. The centralized scheduling mechanism has higher global controllability, can flexibly use a uniform dynamic bandwidth allocation algorithm with high reliability, and when a control node NC of a certain switching domain in a distributed or cache-type controlled FC-AE-1553 multi-stage switching network fails, the network needs to be changed into the centralized control scheduling mechanism to ensure the normal operation of the network.
Two major types of services are mainly transmitted in the FC-AE-1553 network, one is transmission of deterministic services, which are periodic services, and parameters such as source and destination addresses, frame lengths, periods and the like of the services are generally known, and a static scheduling method can be adopted to reasonably and efficiently schedule the periodic services and provide higher service quality for transmission of other services. The other is the transmission of non-deterministic traffic, which is divided into bursty traffic and instantaneous traffic. The occurrence time of the bursty service and the source and destination addresses are uncertain, the data volume is large, a mechanism of multi-service parallel transmission needs to be utilized, and a dynamic bandwidth scheduling mode is adopted to ensure the low delay and fairness of service transmission. The priority of the instant service is highest, the data volume is small, and the instant service is sent as soon as the instant service is generated.
The overall performance of the FC-AE-1553 network can be improved, the throughput of the network can be increased, the time delay of service transmission in the network can be reduced, and the fairness of service transmission can be guaranteed by researching the multi-service scheduling strategy in the FC-AE-1553 multi-stage switching network.
Based on the content of the above method embodiment, as an optional embodiment, the FC-AE-1553 network service scheduling method under centralized control provided in the embodiment of the present invention, where the link transceiving axis time slot occupation matrix and the connection credit value matrix include:
wherein, B is a time slot occupation matrix of a link transceiving axis, C is a connection credit value matrix,
n denotes the number of full duplex links in the network, when b ij When the number of the terminal nodes is equal to 0, the j-th time slot of the transmission/reception axis of the ith link is not occupied, otherwise, the j-th time slot is occupied, N represents the number of the terminal nodes in the network, and c ij C is ≦ c ≦ 1} when c is present ij 0 means that the bandwidth requested from node i to node j is equal to the bandwidth actually allocated when c ij When the bandwidth is not equal to 0, the difference value delta C between the bandwidth requested by the node i to the node j and the allocated bandwidth is shown ij With requested bandwidth r ij Length ratio.
Based on the content of the foregoing method embodiment, as an optional embodiment, in the FC-AE-1553 network service scheduling method under centralized control provided in the embodiment of the present invention, the step 2 specifically includes:
step 2.1: according to the period PT of each periodic service ij Period determines the size of the basic period FP and the cluster period CP, the cluster period CP is all the service PT ij The least common multiple of period, the basic period FP for all traffic PT ij The greatest common divisor of period, namely:
CP＝n*FP
ensuring that each periodic service is transmitted at most once in a basic period and at least once in a cluster period;
step 2.2: the deterministic services are periodic services, each terminal node NT does not need to make a bandwidth request to the control node NC, the main control node MNC records the information of all the periodic services, and the services are integrated when bandwidth allocation is carried out;
step 2.3: and performing bandwidth allocation on the integrated request. The method comprises the steps of abstracting periodic data frames into objects to be sorted in a packing problem, abstracting bandwidth resources on a receiving and transmitting shaft of each link into boxes to be filled in the packing problem, sequencing the objects to be sorted according to height and width in order to guarantee throughput of a network, and firstly packing large objects into the boxes, namely, distributing the bandwidth resources by adopting a principle of large flow priority, wherein the height and the width of the boxes can be calculated by using an equation (1) and an equation (2), and the height and the width of the objects can be calculated by using an equation (3) and an equation (4).
Object.width＝PT ij .length (4)
Wherein speed in the formula (2) represents the data transmission rate of the link, CP represents the cluster period, FP represents the fundamental period, PT ij Period denotes the period of periodic traffic, PT ij Length represents the length of the periodic traffic; PT ij In { id, source, destination, period, length, link }, subscripts i, j respectively denote a source node i and a destination node j, id denotes a request identifier, source denotes an address of the source node i, destination denotes an address of the destination node j, period denotes a number of cycles of a service, length denotes a requested bandwidth size, and link { l ═ l ik ，l km ，…，l rj Denotes the set of traversed links from source node i to destination node j, where l ik ，l km ，…，l rj Each representing a link. In particular, for example,/ ik Representing a link from node i to node k, it is noted that a physical link from node i to node j is considered to be different from a physical link from node j to node i.
Based on the content of the foregoing method embodiment, as an optional embodiment, in the FC-AE-1553 network service scheduling method under centralized control provided in the embodiment of the present invention, the step 3 specifically includes:
step 3.1: initializing a bandwidth request matrix of the bursty service:
wherein r is ij The { id, source, destination, length, link } represents a bursty bandwidth request from a source node i to a destination node j;
step 3.2: after the bandwidth resource allocation of the deterministic service is finished, the main control node MNC broadcasts in each switching domain in sequence, collects the burst service requests of each switching domain and updates a bandwidth request matrix;
step 3.3: the weighted credit value matrix is updated.
The weighted credit matrix in step 3 is:
wherein N represents the number of terminal nodes in the network; w is a ij Indicating the ith to jth node based on the connection credit value c ij With bandwidth request r ij Length weighted result.
The specific calculation formula is as shown in formula (5), and the connection credit value and the requested bandwidth are normalized, wherein W is C And W R Representing the weight, r, of the connection credit and the requested bandwidth size, respectively ij Length represents the size of the bandwidth requested by node i to node j;
wherein, W C And W R Respectively representing connection credit values c ij With bandwidth request r ij The weight occupied by length;
step 3.4: will burst the service request r ij According to a weighted credit value matrix W ij The values of (C) are arranged from large to small in sequence, bandwidth allocation is carried out according to the first-time adaptive principle, and a connection credit value matrix C is updated ij Firstly, the bandwidth is allocated to the burst service request with the highest weight, and whether each chain exists in a certain time period or not is judgedAnd if the residual bandwidth of the link is larger than the requested bandwidth, the bandwidth is full, if the residual bandwidth of the link exists, the requested bandwidth is met, if the residual bandwidth of the link does not exist, the next requested bandwidth allocation is continued until the bandwidth allocation of all the requests is completed, meanwhile, one bandwidth request allocation is completed, and the time slot occupation matrix B of the receiving and transmitting axis of the link and the connection credit value matrix C need to be updated.
Based on the content of the foregoing method embodiment, as an optional embodiment, in the FC-AE-1553 network service scheduling method under centralized control provided in the embodiment of the present invention, the step 4 specifically includes: each deterministic service and bursty service reserves the transmission reserved time of one-time instant service for 0.3 microsecond during bandwidth allocation, so that the bandwidth allocated by the deterministic service and the bursty service is ensured, and excessive waste of resources caused by no instant service in a certain deterministic service and bursty service to seize the bandwidth is avoided.
According to the FC-AE-1553 network service scheduling method under centralized control provided by the embodiment of the invention, for deterministic periodic services, request integration is carried out to ensure parallel transmission of the services, and then a static boxing algorithm is adopted to provide higher transmission quality for bursty services; and for the burst service, the bandwidth resource is dynamically allocated by adopting a weighted first-time adaptive principle, so that the throughput of the network and the fairness of service transmission can be ensured, the starvation phenomenon can not be generated, and the low-delay transmission of the instant service is also ensured.
The implementation basis of the various embodiments of the present invention is realized by programmed processing performed by a device having a processor function. Therefore, in engineering practice, the technical solutions and functions thereof of the embodiments of the present invention can be packaged into various modules. Based on the above practical situation, on the basis of the foregoing embodiments, embodiments of the present invention provide a device for scheduling FC-AE-1553 network services under centralized control, where the device is configured to execute a method for scheduling FC-AE-1553 network services under centralized control in the foregoing method embodiments. Referring to fig. 2, the apparatus includes: the first main module is used for initializing a time slot occupation matrix and a connection credit value matrix of each link transceiving axis; the second main module is used for integrating the deterministic services which can be transmitted in parallel and save bandwidth according to the source and destination addresses, the period and the frame length of the deterministic services and distributing the bandwidth of the integrated request; the third main module is used for initializing a bandwidth request matrix of the bursty service, the main control node MNC collects requests of the bursty service, updates the bandwidth request matrix, weights a connection credit value of each request and the bandwidth request size respectively to obtain a weighted credit value matrix, then distributes the bandwidth of each request according to the sequence of calculation results from large to small by adopting a first-time adaptive principle, and updates the connection credit value weight matrix; a fourth main module, configured to reserve a sending reservation time of the one-time instant service when bandwidth allocation is performed on each deterministic service and each bursty service; and the fifth master module is used for the master control node MNC to issue a scheduling table strategy and wait for next scheduling.
The FC-AE-1553 network service scheduling device under centralized control provided by the embodiment of the invention adopts a plurality of modules in FIG. 2, carries out request integration on deterministic periodic services to ensure parallel transmission of the services, and then adopts a static boxing algorithm to provide higher transmission quality for bursty services; and for the burst service, the bandwidth resource is dynamically allocated by adopting a weighted first-time adaptive principle, so that the throughput of the network and the fairness of service transmission can be ensured, the starvation phenomenon can not be generated, and the low-delay transmission of the instant service is also ensured.
It should be noted that, the apparatus in the apparatus embodiment provided by the present invention may be used for implementing methods in other method embodiments provided by the present invention, except that corresponding function modules are provided, and the principle of the apparatus embodiment provided by the present invention is basically the same as that of the apparatus embodiment provided by the present invention, so long as a person skilled in the art obtains corresponding technical means by combining technical features on the basis of the apparatus embodiment described above, and obtains a technical solution formed by these technical means, on the premise of ensuring that the technical solution has practicability, the apparatus in the apparatus embodiment described above may be modified, so as to obtain a corresponding apparatus class embodiment, which is used for implementing methods in other method class embodiments. For example:
based on the content of the foregoing device embodiment, as an optional embodiment, the FC-AE-1553 network service scheduling device under centralized control provided in the embodiment of the present invention further includes: the first submodule is used for realizing the time slot occupation matrix and the connection credit value matrix of the link transceiving axis and comprises:
wherein, B is a time slot occupation matrix of a link transceiving axis, C is a connection credit value matrix,
n denotes the number of full duplex links in the network, when b ij When the number of the terminal nodes is equal to 0, the j-th time slot of the transmission/reception axis of the ith link is not occupied, otherwise, the j-th time slot is occupied, N represents the number of the terminal nodes in the network, and c ij C is ≦ c ≦ 1} when c is present ij 0 means that the bandwidth requested from node i to node j is equal to the bandwidth actually allocated when c ij When the value is not equal to 0, the difference value delta C between the bandwidth requested by the node i to the node j and the allocated bandwidth is shown ij With requested bandwidth r ij Length ratio.
Based on the content of the foregoing device embodiment, as an optional embodiment, the FC-AE-1553 network service scheduling device under centralized control provided in the embodiment of the present invention further includes: the second sub-module, configured to implement step 2 specifically includes:
step 2.1: according to the period PT of each periodic service ij Period determines the size of the basic period FP and the cluster period CP, the cluster period CP is all the service PT ij The least common multiple of period, the basic period FP for all traffic PT ij The greatest common divisor of period, namely:
CP＝n*FP
ensuring that each periodic service is transmitted at most once in a basic period and at least once in a cluster period;
step 2.2: the deterministic services are periodic services, each terminal node NT does not need to make a bandwidth request to the control node NC, the main control node MNC records the information of all the periodic services, and the services are integrated when the bandwidth allocation is carried out;
step 2.3: and performing bandwidth allocation on the integrated request. The method comprises the steps of abstracting periodic data frames into objects to be sorted in a packing problem, abstracting bandwidth resources on a receiving and transmitting shaft of each link into boxes to be filled in the packing problem, sequencing the objects to be sorted according to height and width in order to guarantee throughput of a network, and firstly packing large objects into the boxes, namely, distributing the bandwidth resources by adopting a principle of large flow priority, wherein the height and the width of the boxes can be calculated by using an equation (1) and an equation (2), and the height and the width of the objects can be calculated by using an equation (3) and an equation (4).
Object.width＝PT ij .length (4)
Where speed in equation (2) represents the data transmission rate of the link, CP represents the cluster period, FP represents the fundamental period, PT ij Period denotes the period of periodic traffic, PT ij Length represents the length of the periodic traffic; PT ij In { id, source, destination, period, length, link }, subscripts i, j denote a source node i and a destination node j, respectively, and id denotes an identifier of a requestSource represents the address of source node i, destination represents the address of destination node j, period represents the number of cycles of the service, length represents the requested bandwidth size, and link is { l } ik ，l km ，…，l rj Denotes the set of traversed links from source node i to destination node j, where l ik ，l km ，…，l rj Each representing a link.
Based on the content of the foregoing device embodiment, as an optional embodiment, the FC-AE-1553 network service scheduling device under centralized control provided in the embodiment of the present invention further includes: the third sub-module, configured to implement step 3 specifically includes:
step 3.1: initializing a bandwidth request matrix of the bursty service:
wherein r is ij The { id, source, destination, length, link } represents a bursty bandwidth request from a source node i to a destination node j;
step 3.2: after the bandwidth resource allocation of the deterministic service is finished, the main control node MNC broadcasts in each switching domain in sequence, collects the burst service requests of each switching domain and updates a bandwidth request matrix;
step 3.3: the weighted credit value matrix is updated. The specific calculation formula is as shown in formula (5), and the connection credit value and the requested bandwidth are normalized, wherein W is C And W R Representing the weight, r, of the connection credit and the requested bandwidth size, respectively ij Length represents the size of the bandwidth requested by node i to node j;
wherein, W C And W R Respectively representing connection credit values c ij With bandwidth request r ij The weight occupied by length;
step 3.4: will burst service request r ij According to a weighted credit value matrix W ij The values of (C) are arranged from large to small in sequence, bandwidth allocation is carried out according to the first-time adaptive principle, and a connection credit value matrix C is updated ij Firstly, allocating bandwidth to the bursty service request with the highest weight, judging whether the bandwidth left by each link in a certain period of time is larger than the requested bandwidth, if so, meeting the total requested bandwidth, if not, continuing the next requested bandwidth allocation until completing the bandwidth allocation of all the requests, and meanwhile, completing the bandwidth request allocation and needing to update the link transceiving axis time slot occupation matrix B and the connection credit value matrix C.
Based on the content of the foregoing device embodiment, as an optional embodiment, the FC-AE-1553 network service scheduling device under centralized control provided in the embodiment of the present invention further includes: a fourth sub-module, configured to implement step 4 specifically including: each deterministic service and bursty service reserves the transmission reserved time of one-time instant service for 0.3 microsecond during bandwidth allocation, so that the bandwidth allocated by the deterministic service and the bursty service is ensured, and excessive waste of resources caused by no instant service in a certain deterministic service and bursty service to seize the bandwidth is avoided.
The method of the embodiment of the invention is realized by depending on the electronic equipment, so that the related electronic equipment is necessarily introduced. To this end, an embodiment of the present invention provides an electronic apparatus, as shown in fig. 3, including: the system comprises at least one processor (processor), a communication Interface (communication Interface), at least one memory (memory) and a communication bus, wherein the at least one processor, the communication Interface and the at least one memory are communicated with each other through the communication bus. The at least one processor may invoke logic instructions in the at least one memory to perform all or a portion of the steps of the methods provided by the various method embodiments described above.
In addition, the logic instructions in the at least one memory may be implemented in software functional units and stored in a computer readable storage medium when sold or used as a stand-alone product. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the method embodiments of the present invention. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. Based on this recognition, each block in the flowchart or block diagrams may represent a module, a program segment, or a portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
In this patent, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising … …" does not exclude the presence of additional identical elements in the process, method, article, or apparatus that comprises the element.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (8)
1. A method for scheduling FC-AE-1553 network services under centralized control is characterized by comprising the following steps: step 1: initializing a time slot occupation matrix and a connection credit value matrix of a receiving and transmitting shaft of each link; step 2: integrating deterministic services which can be transmitted in parallel and can save bandwidth according to the source and destination addresses, the period and the frame length of the deterministic services, and performing bandwidth allocation on the integrated requests; and step 3: initializing a bandwidth request matrix of the bursty service, collecting the requests of the bursty service by a main control node MNC, updating the bandwidth request matrix, weighting a connection credit value of each request and the bandwidth request respectively to obtain a weighted credit value matrix, then carrying out bandwidth allocation on each request according to the sequence of calculation results from large to small by adopting a first-time adaptive principle, and updating the connection credit value weight matrix; and 4, step 4: each deterministic service and burst service reserves the transmission reservation time of one instant service during bandwidth allocation; and 5: and the main control node MNC issues a scheduling table strategy and waits for next scheduling.
2. The FC-AE-1553 network service scheduling method under the centralized control of claim 1, wherein the link transceiving axis time slot occupancy matrix and the connection credit value matrix comprise:
wherein, B is a time slot occupation matrix of a link transceiving axis, C is a connection credit value matrix,
n denotes the number of full duplex links in the network, when b ij When the number of the terminal nodes is equal to 0, the j-th time slot of the transmission/reception axis of the ith link is not occupied, otherwise, the j-th time slot is occupied, N represents the number of the terminal nodes in the network, and c ij ＝{c|0≤c≦ 1}, when c is present ij 0 means that the bandwidth requested from node i to node j is equal to the bandwidth actually allocated when c ij When the bandwidth is not equal to 0, the difference value delta C between the bandwidth requested by the node i to the node j and the allocated bandwidth is shown ij With requested bandwidth r ij The ratio of length.
3. The method for scheduling FC-AE-1553 network services under centralized control according to claim 2, wherein the step 2 specifically comprises:
step 2.1: according to the period PT of each periodic service ij Period determines the size of the basic period FP and the cluster period CP, the cluster period CP is all the service PT ij The least common multiple of period, the basic period FP for all traffic PT ij The greatest common divisor of period, namely:
CP＝n*FP
ensuring that each periodic service is transmitted at most once in a basic period and at least once in a cluster period;
step 2.2: the deterministic services are periodic services, each terminal node NT does not need to make a bandwidth request to the control node NC, the main control node MNC records the information of all the periodic services, and the services are integrated when bandwidth allocation is carried out;
step 2.3: bandwidth allocation is carried out on the integrated request, a periodic data frame is abstracted into an article to be sorted in a boxing problem, bandwidth resources on a receiving and transmitting shaft of each link are abstracted into boxes to be filled in the boxing problem, meanwhile, in order to guarantee the throughput of a network, the article to be sorted is sequenced according to the height and the width, large articles are firstly loaded into the boxes, namely, the bandwidth resources are allocated by adopting the principle of large flow priority, wherein the height and the width of the boxes can be calculated by using an equation (1) and an equation (2), and the height and the width of the article can be calculated by using an equation (3) and an equation (4),
Object.width＝PT ij .length (4)
wherein speed in the formula (2) represents the data transmission rate of the link, CP represents the cluster period, FP represents the fundamental period, PT ij Period denotes the period of periodic traffic, PT ij Length represents the length of the periodic traffic; PT ij In { id, source, destination, period, length, link }, subscripts i, j respectively denote a source node i and a destination node j, id denotes a request identifier, source denotes an address of the source node i, destination denotes an address of the destination node j, period denotes a number of cycles of a service, length denotes a requested bandwidth size, and link { l ═ l ik ,l km ,…,l rj Denotes the set of traversed links from source node i to destination node j, where l ik ,l km ,…,l rj Each representing a link.
4. The method for scheduling FC-AE-1553 network services under centralized control according to claim 3, wherein the step 3 specifically comprises:
step 3.1: initializing a bandwidth request matrix of the bursty service:
wherein r is ij The { id, source, destination, length, link } represents a bursty bandwidth request from a source node i to a destination node j;
step 3.2: after the bandwidth resource allocation of the deterministic service is finished, the main control node MNC broadcasts in each switching domain in sequence, collects the burst service requests of each switching domain and updates a bandwidth request matrix;
step 3.3: updating the weighted credit value matrix, wherein the specific calculation formula is shown as formula (5), and the connection credit value and the requested bandwidth are normalized, wherein W C And W R Respectively representing the connection credit and the weight occupied by the requested bandwidth, r ij Length represents the size of the bandwidth requested by node i to node j;
wherein, W C And W R Respectively representing connection credit values c ij And a bandwidth request r ij The weight occupied by length;
step 3.4: will burst the service request r ij According to a weighted credit value matrix W ij The values of (C) are arranged from large to small in sequence, bandwidth allocation is carried out according to the first-time adaptive principle, and a connection credit value matrix C is updated ij Firstly, allocating bandwidth to the bursty service request with the highest weight, judging whether the bandwidth left by each link in a certain period of time is larger than the requested bandwidth, if so, meeting the total requested bandwidth, if not, continuing the next requested bandwidth allocation until completing the bandwidth allocation of all the requests, and meanwhile, completing the bandwidth request allocation and needing to update the link transceiving axis time slot occupation matrix B and the connection credit value matrix C.
5. The method for scheduling FC-AE-1553 network services under centralized control according to claim 4, wherein the step 4 specifically comprises: each deterministic service and bursty service reserves the transmission reserved time of one-time instant service for 0.3 microsecond during bandwidth allocation, so that the bandwidth allocated by the deterministic service and the bursty service is ensured, and excessive waste of resources caused by no instant service in a certain deterministic service and bursty service to seize the bandwidth is avoided.
6. An FC-AE-1553 network service scheduling device under centralized control is characterized by comprising: the first main module is used for initializing a time slot occupation matrix and a connection credit value matrix of each link transceiving axis; the second main module is used for integrating the deterministic services which can be transmitted in parallel and save bandwidth according to the source and destination addresses, the period and the frame length of the deterministic services and distributing the bandwidth of the integrated request; the third main module is used for initializing a bandwidth request matrix of the bursty service, the main control node MNC collects requests of the bursty service, updates the bandwidth request matrix, weights a connection credit value of each request and the bandwidth request size respectively to obtain a weighted credit value matrix, then distributes the bandwidth of each request according to the sequence of calculation results from large to small by adopting a first-time adaptive principle, and updates the connection credit value weight matrix; a fourth main module, configured to reserve a sending reservation time of one-time instant traffic when bandwidth allocation is performed on each deterministic traffic and bursty traffic; and the fifth master module is used for the master control node MNC to issue a scheduling table strategy and wait for next scheduling.
7. An electronic device, comprising:
at least one processor, at least one memory, and a communication interface; wherein the content of the first and second substances,
the processor, the memory and the communication interface are communicated with each other;
the memory stores program instructions executable by the processor, the processor invoking the program instructions to perform the method of any of claims 1 to 5.
8. A non-transitory computer-readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210345818.1A CN114826820A (en) | 2022-03-31 | 2022-03-31 | FC-AE-1553 network service scheduling method and equipment under centralized control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210345818.1A CN114826820A (en) | 2022-03-31 | 2022-03-31 | FC-AE-1553 network service scheduling method and equipment under centralized control |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114826820A true CN114826820A (en) | 2022-07-29 |
Family
ID=82531809
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210345818.1A Pending CN114826820A (en) | 2022-03-31 | 2022-03-31 | FC-AE-1553 network service scheduling method and equipment under centralized control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114826820A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100074274A1 (en) * | 2006-12-06 | 2010-03-25 | Bertrand Huguies | System for reserving a pass band for different classes of traffic |
| CN206498408U (en) * | 2017-01-24 | 2017-09-15 | 北京国科天迅科技有限公司 | For the net mate device in the networks of bus-type FC AE 1553 |
| CN111934916A (en) * | 2020-07-23 | 2020-11-13 | 中国科学院空间应用工程与技术中心 | Network scheduling method and system based on mixed service transmission |
| CN112130543A (en) * | 2020-07-21 | 2020-12-25 | 上海宇航系统工程研究所 | Carrier rocket electrical system based on FC-AE-1553 high-speed bus |
-
2022
- 2022-03-31 CN CN202210345818.1A patent/CN114826820A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100074274A1 (en) * | 2006-12-06 | 2010-03-25 | Bertrand Huguies | System for reserving a pass band for different classes of traffic |
| CN206498408U (en) * | 2017-01-24 | 2017-09-15 | 北京国科天迅科技有限公司 | For the net mate device in the networks of bus-type FC AE 1553 |
| CN112130543A (en) * | 2020-07-21 | 2020-12-25 | 上海宇航系统工程研究所 | Carrier rocket electrical system based on FC-AE-1553 high-speed bus |
| CN111934916A (en) * | 2020-07-23 | 2020-11-13 | 中国科学院空间应用工程与技术中心 | Network scheduling method and system based on mixed service transmission |
Non-Patent Citations (1)
| Title |
|---|
| 何玥: "FC-AE-1553多级网络多业务调度机制研究", CNKI硕士论文库, 15 September 2019 (2019-09-15), pages 6 - 42 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108243044B (en) | Service deployment method and device | |
| CN108897606B (en) | Self-adaptive scheduling method and system for virtual network resources of multi-tenant container cloud platform | |
| CN108965014A (en) | The service chaining backup method and system of QoS perception | |
| CN113938435B (en) | Data transmission method, device, electronic equipment, storage medium and program product | |
| CN112543151B (en) | SDN controller deployment method and device, electronic equipment and storage medium | |
| CN106533871A (en) | Release subscription method and system based on AFDX bus | |
| CN113938930B (en) | Construction method of virtual network function forwarding graph adapting to 5G network multi-service scene | |
| CN109041236B (en) | Wireless resource allocation method and device for services with different weights | |
| JP2000502855A (en) | Non-fragmentation method and device in dynamic synchronous transfer mode network | |
| CN116896511B (en) | Special line cloud service speed limiting method, device, equipment and storage medium | |
| CN113259266A (en) | Message pushing method and device of message queue, server and storage medium | |
| CN114826820A (en) | FC-AE-1553 network service scheduling method and equipment under centralized control | |
| CN117119043A (en) | Micro-service deployment method for edge network topology perception | |
| CN113852554B (en) | Data transmission method, device and equipment | |
| US20080259867A1 (en) | Method and system for scheduling packets from different flows to provide fair bandwidth sharing | |
| CN113115139B (en) | Optical network virtualization system based on network container and service mapping method | |
| JPH0818576A (en) | Communication system | |
| CN115033355A (en) | Task scheduling method, electronic device and storage medium | |
| CN113949666A (en) | Flow control method, device, equipment and system | |
| CN109582242B (en) | Address determination method and device for cascade memory array system and electronic equipment | |
| CN114285693B (en) | Implementation method and system for automatic sar network flexray hardware buffer multiplexing | |
| CN116800620B (en) | Block chain simulation system and method | |
| CN111526596B (en) | Joint resource scheduling method and device for WLAN (Wireless local area network) and mobile network | |
| Hanczewski et al. | Simulation of queuing systems with non-full-availability server | |
| CN114145003B (en) | Enabling data exchange between first and second communication networks having different data communication capabilities |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |