Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present so...Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present some sufficient conditions for the exponential stability of a particular category of switched systems.展开更多
A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packe...A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue mangement technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and thee solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server＇s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.展开更多
Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to r...Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to reduce the cost of nodes,fixed transmitters and receivers are used instead of tunable transmitters and receivers.Two fixed transmitters and many fixed receivers are used in each node in the scheme.The average waiting delay of this scheme is analyzed through mathematics and computer simulation.The result shows that the property of the scheme is almost the same as using tunable transmitter and receiver.Furthermore,if the tuning time of tunable transmitters is taken into account,the performance of the tunable transmitter scheme is poor than this scheme at the average waiting delay and throughput of the network.展开更多
A novel assembly control algorithm named burst-size feedback adaptive assembly period （BFAAP） is proposed. The major difference between BFAAP and other similar adaptive assembly algorithms is that the control curve ...A novel assembly control algorithm named burst-size feedback adaptive assembly period （BFAAP） is proposed. The major difference between BFAAP and other similar adaptive assembly algorithms is that the control curve of BFAAP is dynamically adjusted according to the feedback of outgoing burst size. BFAAP is compared with two typical algorithms fixed assembly period （FAP） and min-burst length max- assembly period （MBMAP） in simulation in terms of burst size distribution and assembly period. Moreover, the transmission control protocol （TCP） performance over BFAAP is also considered and simulated.展开更多
This letter proposes a new burst assembly technique for supporting QoS in optical burst switching (OBS) networks. It consists of the adaptive-threshold burst assembly mechanism and QoS-based random offset-time scheme....This letter proposes a new burst assembly technique for supporting QoS in optical burst switching (OBS) networks. It consists of the adaptive-threshold burst assembly mechanism and QoS-based random offset-time scheme. The assembly mechanism, which is fit well to multi-class burst assembly, not only matches with IP QoS mechanism based on packet classification, and also utilizes fairly and efficiently assembly capacity. Based on token-bucket model and burst segment selective discard (BSSD), the offset-time scheme can smooth the traffic to support OBS QoS. The simulation results show that the technique can improve the performance in terms of packet loss probability (PLP).展开更多
An optical burst switching （OBS） network platform is established with a ring topology of three nodes. A congestion Mleviated scheme using advanced token protocol and wavelength tunable receivers is demon- strated to...An optical burst switching （OBS） network platform is established with a ring topology of three nodes. A congestion Mleviated scheme using advanced token protocol and wavelength tunable receivers is demon- strated to optimize the network platform. Experimental results testify that this scheme can resist collision at the level of 0.1% congestion rate.展开更多
Large-scale strictly nonblocking （SNB） and wide-sense nonblocking （WSNB） networks may be infeasible due to their high cost. In contrast, rearrangeable nonblocking （RNB） networks are more scalable because of thei...Large-scale strictly nonblocking （SNB） and wide-sense nonblocking （WSNB） networks may be infeasible due to their high cost. In contrast, rearrangeable nonblocking （RNB） networks are more scalable because of their much lower cost. However, RNB networks are not suitable for circuit switching. In this paper, the concept of virtual nonblockingness is introduced. It is shown that a virtual nonblocking （VNB） network functions like an SNB or WSNB network, but it is constructed with the cost of an RNB network. The results indicate that for large-scale circuit switching applications, it is only needed to build VNB networks.展开更多
A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay requirement of services with different CoS (Class of Service) and provide lower burst loss ratio a...A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay requirement of services with different CoS (Class of Service) and provide lower burst loss ratio at the same time. The performance of edge nodes based on the proposed algorithm is presented.展开更多
To achieve lower assembly delay at optical burst switching edge node, this paper proposes an approach called current weight length prediction (CWLP) to improve existing estimate mechanism in burst assembly. CWLP metho...To achieve lower assembly delay at optical burst switching edge node, this paper proposes an approach called current weight length prediction (CWLP) to improve existing estimate mechanism in burst assembly. CWLP method takes into account the arrived traffic in prediction time adequately. A parameter 'weight' is introduced to make a dynamic tradeoff between the current and past traffic under different offset time. Simulation results show that CWLP can achieve a significant improvement in terms of traffic estimation in various offset time and offered load.展开更多
This paper proposes a novel scheme based on minimum delay at the edges (MDE) for optical burst switching (OBS) networks. This scheme is designed to overcome the long delay at the edge nodes of OBS networks. The MDE sc...This paper proposes a novel scheme based on minimum delay at the edges (MDE) for optical burst switching (OBS) networks. This scheme is designed to overcome the long delay at the edge nodes of OBS networks. The MDE scheme features simultaneous burst assembly, channel scheduling, and pre-transmission of control packet. It also features estimated setup and explicit release (ESXR) signaling protocol. The MDE scheme can minimize the delay at the edge nodes for data packets, and improve the end-to-end latency performance for OBS networks. In addition, comparing with the conventional scheme, the performances of the MDE scheme are analyzed in this paper.展开更多
An spatial division multiplexing/wavelength division multiplexing router is designed for applying in a fiber-optical wide area network. Our comparison shows various spans of the good SDM/WDM WAN using the SO A based r...An spatial division multiplexing/wavelength division multiplexing router is designed for applying in a fiber-optical wide area network. Our comparison shows various spans of the good SDM/WDM WAN using the SO A based router.展开更多
This paper proves that a synchronous demultiplexer has the same logic function as a synchronous multiplexer. A new approach is proposed to implement synchronous demultiplexers in high-speed ISDN switching networks. A ...This paper proves that a synchronous demultiplexer has the same logic function as a synchronous multiplexer. A new approach is proposed to implement synchronous demultiplexers in high-speed ISDN switching networks. A synchronous demultiplexer is designed utilizing the same structure as a synchronous shuffle multiplexer. Both the theoretical analysis and experimental results show that for the same capacity, the new method is more tolerant of signal delay variation, so a very high-speed synchronous demultiplexer can be designed with the larger capacity required in large capacity synchronous switching networks.展开更多
An improved adaptive-threshold burst assembly algorithm is proposed to alleviate the limitation of conventional assembly schemes on data loss and delay. The algorithm will adjust the values of assembly factors accordi...An improved adaptive-threshold burst assembly algorithm is proposed to alleviate the limitation of conventional assembly schemes on data loss and delay. The algorithm will adjust the values of assembly factors according to variant traffic regions. And the simulation results show that, by using the adaptive-factor adaptive assembly scheme, the performance of networks is extensively enhanced in terms of burst loss probability and average queuing delay.展开更多
This paper is concerned with the global stabilization of state-dependent switching neural networks(SDSNNs)viadiscontinuous event-triggered control with network-induced communication delay.Aiming at decreasing triggeri...This paper is concerned with the global stabilization of state-dependent switching neural networks(SDSNNs)viadiscontinuous event-triggered control with network-induced communication delay.Aiming at decreasing triggering times,a discontinuous event-trigger scheme is utilized to determine whether the sampling information is required to be sent outor not.Meanwhile,under the effect of communication delay,the trigger condition and SDSNNs are transformed into twotractable models by designing a fictitious delay function.Then,using the Lyapunov–Krasovskii stability theory,someinequality estimation techniques,and extended reciprocally convex combination method,two sufficient criteria are established for ensuring the global stabilization of the resulting closed-loop SDSNNs,respectively.A unified framework isderived that has the ability to handle the simultaneous existence of the communication delay,the properties of discontinuousevent-trigger scheme,as well as feedback controller design.Additionally,the developed results demonstrate a quantitativerelationship among the event trigger parameter,communication delay,and triggering times.Finally,two numerical examples are presented to illustrate the usefulness of the developed stabilization scheme.展开更多
Auditory sense is an important way for people to receive and interact with foreign information.In different environment,the auditory sense changes.Therefore,it is necessary to find a detection method that can detect h...Auditory sense is an important way for people to receive and interact with foreign information.In different environment,the auditory sense changes.Therefore,it is necessary to find a detection method that can detect hearing in a timely manner.In this paper,EEG experiments were used to construct and compare brain functional networks in different states,and auditory state models were constructed with different auditory input signals.Secondly,the cross-correlation method is used to slice the signal and construct the adjacency matrix.Louvain community detection algorithm is used to process the data and calculate the network conversion rate under different parameters.It is concluded that the network conversion rate can be used to analyze the temporal variation of auditory information under the condition of controlled parameters.This indicates that the network conversion rate can also be used as a method to analyze auditory signals in the future.展开更多
On state estimation problems of switched neural networks,most existing results with an event-triggered scheme(ETS)not only ignore the estimator information,but also just employ a fixed triggering threshold,and the est...On state estimation problems of switched neural networks,most existing results with an event-triggered scheme(ETS)not only ignore the estimator information,but also just employ a fixed triggering threshold,and the estimation error cannot be guaranteed to converge to zero.In addition,the state estimator of non-switched neural networks with integral and exponentially convergent terms cannot be used to improve the estimation performance of switched neural networks due to the difficulties caused by the nonsmoothness of the considered Lyapunov function at the switching instants.In this paper,we aim at overcoming such difficulties and filling in the gaps,by proposing a novel adaptive ETS(AETS)to design an event-based H_(∞)switched proportional-integral(PI)state estimator.A triggering-dependent exponential convergence term and an integral term are introduced into the switched PI state estimator.The relationship among the average dwell time,the AETS and the PI state estimator are established by the triggering-dependent exponential convergence term such that estimation error asymptotically converges to zero with H_(∞)performance level.It is shown that the convergence rate of the resultant error system can be adaptively adjusted according to triggering signals.Finally,the validity of the proposed theoretical results is verified through two illustrative examples.展开更多
In this article, the notion of pinning control for directed networks of dynamical systems is introduced, where the nodes could be either single-input single-output （SISO） or multi-input multi-output （MIMO） dynamic...In this article, the notion of pinning control for directed networks of dynamical systems is introduced, where the nodes could be either single-input single-output （SISO） or multi-input multi-output （MIMO） dynamical systems, and could be non-identical and nonlinear in general but will be specified to be identical linear time-invariant （LTI） systems here in the study of network controllability. Both state and structural controllability problems will be discussed, illustrating how the network topology, node-system dynamics, external control inputs and inner dynamical interactions altogether affect the controllability of a general complex network of LTI systems, with necessary and sufficient conditions presented for both SISO and MIMO settings. To that end, the controllability of a special temporally switching directed network of linear time-varying （LTV） node systems will be addressed, leaving some more general networks and challenging issues to the end for research outlook.展开更多
Minimum-energy formation achievement problems for networked multiagent systems are investigated,where information networks with leaderless and leader-follower structures are respectively addressed and information netw...Minimum-energy formation achievement problems for networked multiagent systems are investigated,where information networks with leaderless and leader-follower structures are respectively addressed and information networks are randomly switching.The critical feature of this work is that the energy constraint is minimum in the sense of the linear matrix inequality,but limited-budget control and guaranteed-cost control cannot realize a minimum-energy formation.Firstly,the leaderless minimum-energy formation control problem is converted into an asymp-totic stability one via a nonsingular transformation and state space decomposition,and based on linear matrix inequality techniques,sufficient conditions for analysis and design of leaderless minimum-energy formation achievement are proposed,respectively,which can be solved by the generalized eigenvalue method.Then,main results of minimum-energy formation achievement of leaderless networked multiagent systems are extended leader-follower networked multiagent systems,where the asymmetric property of the leader-follower information network is well dealt with by two nonsingular transformations.Finally,two simulation examples are shown to verify the main results for minimum-energy formation achievements of leaderless and leader-follower networked multiagent systems,respectively.展开更多
One of the key problems to hinder the realization of optical burst switching(OBS) technology in the core networks is the losses due to the contention among the bursts at the core nodes.Burst segmentation is an effecti...One of the key problems to hinder the realization of optical burst switching(OBS) technology in the core networks is the losses due to the contention among the bursts at the core nodes.Burst segmentation is an effective contention resolution technique used to reduce the number of packets lost due to the burst losses.In our work,a burst segmentation-deflection routing contention resolution mechanism in OBS networks is proposed.When the contention occurs,the bursts are segmented according to the lowest packet loss probability of networks firstly,and then the segmented burst is deflected on the optimum routing.An analytical model is proposed to evaluate the contention resolution mechanism.Simulation results show that high-priority bursts have significantly lower packet loss probability and transmission delay than the low-priority.And the performance of the burst lengths,in which the number of segments per burst distributes geometrically,is more effective than that of the deterministically distributed burst lengths.展开更多
Nowadays, distributed optimization algorithms are widely used in various complex networks. In order to expand the theory of distributed optimization algorithms in the direction of directed graph, the distributed conve...Nowadays, distributed optimization algorithms are widely used in various complex networks. In order to expand the theory of distributed optimization algorithms in the direction of directed graph, the distributed convex optimization problem with time-varying delays and switching topologies in the case of directed graph topology is studied. The event-triggered communication mechanism is adopted, that is, the communication between agents is determined by the trigger conditions, and the information exchange is carried out only when the conditions are met. Compared with continuous communication, this greatly saves network resources and reduces communication cost. Using Lyapunov-Krasovskii function method and inequality analysis, a new sufficient condition is proposed to ensure that the agent state finally reaches the optimal state. The upper bound of the maximum allowable delay is given. In addition, Zeno behavior will be proved not to exist during the operation of the algorithm. Finally, a simulation example is given to illustrate the correctness of the results in this paper.展开更多
基金supported in part by the National Natural Science Foundation of China(62273255,62350003,62088101)the Shanghai Science and Technology Cooperation Project(22510712000,21550760900)+1 种基金the Shanghai Municipal Science and Technology Major Project(2021SHZDZX0100)the Fundamental Research Funds for the Central Universities
文摘Dear Editor,This letter is concerned with the problem of time-varying formation tracking for heterogeneous multi-agent systems(MASs) under directed switching networks. For this purpose, our first step is to present some sufficient conditions for the exponential stability of a particular category of switched systems.
基金National Natural Science Foundation of China ( No.60572157)Sharp Corporation of Japanthe Hi-Tech Research and Development Program(863) of China (No.2003AA123310)
文摘A new weighted fair queueing algorithm is proposed, which uses the novel flow-based service ratio parameters to schedule flows. This solves the main drawback of traditional weighted fair queneing algorithms- the packet-based calculation of the weight parameters. In addition, this paper proposes a novel service ratio calculation method and a queue mangement technology. The former adjusts the service ratio parameters adaptively based on the dynamics of the packet lengths and thee solves the unfairness problem induced by the variable packet length. The latter improves the utilization of the server＇s queue buffer and reduces the delay jitter through restricting the buffer length for each flow.
文摘Based on a media access and control（MAC）protocol,an arrangement of channels and transceivers in optical packet switching dense wavelength division multiplexing（DWDM）networks is proposed in this paper.In order to reduce the cost of nodes,fixed transmitters and receivers are used instead of tunable transmitters and receivers.Two fixed transmitters and many fixed receivers are used in each node in the scheme.The average waiting delay of this scheme is analyzed through mathematics and computer simulation.The result shows that the property of the scheme is almost the same as using tunable transmitter and receiver.Furthermore,if the tuning time of tunable transmitters is taken into account,the performance of the tunable transmitter scheme is poor than this scheme at the average waiting delay and throughput of the network.
基金supported by the New Century 151 Foundation in Zhejiang Province,China
文摘A novel assembly control algorithm named burst-size feedback adaptive assembly period （BFAAP） is proposed. The major difference between BFAAP and other similar adaptive assembly algorithms is that the control curve of BFAAP is dynamically adjusted according to the feedback of outgoing burst size. BFAAP is compared with two typical algorithms fixed assembly period （FAP） and min-burst length max- assembly period （MBMAP） in simulation in terms of burst size distribution and assembly period. Moreover, the transmission control protocol （TCP） performance over BFAAP is also considered and simulated.
基金This work was supported by National Hi-Tech Research and Development Program of China (863 Program) under contract No. 2002AA122021.
文摘This letter proposes a new burst assembly technique for supporting QoS in optical burst switching (OBS) networks. It consists of the adaptive-threshold burst assembly mechanism and QoS-based random offset-time scheme. The assembly mechanism, which is fit well to multi-class burst assembly, not only matches with IP QoS mechanism based on packet classification, and also utilizes fairly and efficiently assembly capacity. Based on token-bucket model and burst segment selective discard (BSSD), the offset-time scheme can smooth the traffic to support OBS QoS. The simulation results show that the technique can improve the performance in terms of packet loss probability (PLP).
基金National Natural Science Foundation of China(No.90704006,60572021,and 60711140087)National"973"Program of China(No.2007CB310705)+3 种基金National"863"Project of China(No.2006AA01Z238)PCSIRT(No.IRT0609)ISTCP(No.2006DFAl1040)111 Project(No.B07005).
文摘An optical burst switching （OBS） network platform is established with a ring topology of three nodes. A congestion Mleviated scheme using advanced token protocol and wavelength tunable receivers is demon- strated to optimize the network platform. Experimental results testify that this scheme can resist collision at the level of 0.1% congestion rate.
文摘Large-scale strictly nonblocking （SNB） and wide-sense nonblocking （WSNB） networks may be infeasible due to their high cost. In contrast, rearrangeable nonblocking （RNB） networks are more scalable because of their much lower cost. However, RNB networks are not suitable for circuit switching. In this paper, the concept of virtual nonblockingness is introduced. It is shown that a virtual nonblocking （VNB） network functions like an SNB or WSNB network, but it is constructed with the cost of an RNB network. The results indicate that for large-scale circuit switching applications, it is only needed to build VNB networks.
文摘A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay requirement of services with different CoS (Class of Service) and provide lower burst loss ratio at the same time. The performance of edge nodes based on the proposed algorithm is presented.
基金This work was jointly supported by the National Natural Science Foundation of China (No. 69990540)the Optical Technology Plan of Shanghai.
文摘To achieve lower assembly delay at optical burst switching edge node, this paper proposes an approach called current weight length prediction (CWLP) to improve existing estimate mechanism in burst assembly. CWLP method takes into account the arrived traffic in prediction time adequately. A parameter 'weight' is introduced to make a dynamic tradeoff between the current and past traffic under different offset time. Simulation results show that CWLP can achieve a significant improvement in terms of traffic estimation in various offset time and offered load.
文摘This paper proposes a novel scheme based on minimum delay at the edges (MDE) for optical burst switching (OBS) networks. This scheme is designed to overcome the long delay at the edge nodes of OBS networks. The MDE scheme features simultaneous burst assembly, channel scheduling, and pre-transmission of control packet. It also features estimated setup and explicit release (ESXR) signaling protocol. The MDE scheme can minimize the delay at the edge nodes for data packets, and improve the end-to-end latency performance for OBS networks. In addition, comparing with the conventional scheme, the performances of the MDE scheme are analyzed in this paper.
文摘An spatial division multiplexing/wavelength division multiplexing router is designed for applying in a fiber-optical wide area network. Our comparison shows various spans of the good SDM/WDM WAN using the SO A based router.
文摘This paper proves that a synchronous demultiplexer has the same logic function as a synchronous multiplexer. A new approach is proposed to implement synchronous demultiplexers in high-speed ISDN switching networks. A synchronous demultiplexer is designed utilizing the same structure as a synchronous shuffle multiplexer. Both the theoretical analysis and experimental results show that for the same capacity, the new method is more tolerant of signal delay variation, so a very high-speed synchronous demultiplexer can be designed with the larger capacity required in large capacity synchronous switching networks.
基金This work was partially supported by the Space Flight Supporting Technology Foundation of China under Grant No.03-1.4.
文摘An improved adaptive-threshold burst assembly algorithm is proposed to alleviate the limitation of conventional assembly schemes on data loss and delay. The algorithm will adjust the values of assembly factors according to variant traffic regions. And the simulation results show that, by using the adaptive-factor adaptive assembly scheme, the performance of networks is extensively enhanced in terms of burst loss probability and average queuing delay.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.62003194,61973199,61573008,and 61973200).
文摘This paper is concerned with the global stabilization of state-dependent switching neural networks(SDSNNs)viadiscontinuous event-triggered control with network-induced communication delay.Aiming at decreasing triggering times,a discontinuous event-trigger scheme is utilized to determine whether the sampling information is required to be sent outor not.Meanwhile,under the effect of communication delay,the trigger condition and SDSNNs are transformed into twotractable models by designing a fictitious delay function.Then,using the Lyapunov–Krasovskii stability theory,someinequality estimation techniques,and extended reciprocally convex combination method,two sufficient criteria are established for ensuring the global stabilization of the resulting closed-loop SDSNNs,respectively.A unified framework isderived that has the ability to handle the simultaneous existence of the communication delay,the properties of discontinuousevent-trigger scheme,as well as feedback controller design.Additionally,the developed results demonstrate a quantitativerelationship among the event trigger parameter,communication delay,and triggering times.Finally,two numerical examples are presented to illustrate the usefulness of the developed stabilization scheme.
文摘Auditory sense is an important way for people to receive and interact with foreign information.In different environment,the auditory sense changes.Therefore,it is necessary to find a detection method that can detect hearing in a timely manner.In this paper,EEG experiments were used to construct and compare brain functional networks in different states,and auditory state models were constructed with different auditory input signals.Secondly,the cross-correlation method is used to slice the signal and construct the adjacency matrix.Louvain community detection algorithm is used to process the data and calculate the network conversion rate under different parameters.It is concluded that the network conversion rate can be used to analyze the temporal variation of auditory information under the condition of controlled parameters.This indicates that the network conversion rate can also be used as a method to analyze auditory signals in the future.
基金supported in part by the National Natural Science Foundation of China under Grants 62103352supported in part by Hebei Natural Science Foundation,China under Grant F2023203056the 8th batch of post-doctoral Innovative Talent Support Program BX20230150.
文摘On state estimation problems of switched neural networks,most existing results with an event-triggered scheme(ETS)not only ignore the estimator information,but also just employ a fixed triggering threshold,and the estimation error cannot be guaranteed to converge to zero.In addition,the state estimator of non-switched neural networks with integral and exponentially convergent terms cannot be used to improve the estimation performance of switched neural networks due to the difficulties caused by the nonsmoothness of the considered Lyapunov function at the switching instants.In this paper,we aim at overcoming such difficulties and filling in the gaps,by proposing a novel adaptive ETS(AETS)to design an event-based H_(∞)switched proportional-integral(PI)state estimator.A triggering-dependent exponential convergence term and an integral term are introduced into the switched PI state estimator.The relationship among the average dwell time,the AETS and the PI state estimator are established by the triggering-dependent exponential convergence term such that estimation error asymptotically converges to zero with H_(∞)performance level.It is shown that the convergence rate of the resultant error system can be adaptively adjusted according to triggering signals.Finally,the validity of the proposed theoretical results is verified through two illustrative examples.
文摘In this article, the notion of pinning control for directed networks of dynamical systems is introduced, where the nodes could be either single-input single-output （SISO） or multi-input multi-output （MIMO） dynamical systems, and could be non-identical and nonlinear in general but will be specified to be identical linear time-invariant （LTI） systems here in the study of network controllability. Both state and structural controllability problems will be discussed, illustrating how the network topology, node-system dynamics, external control inputs and inner dynamical interactions altogether affect the controllability of a general complex network of LTI systems, with necessary and sufficient conditions presented for both SISO and MIMO settings. To that end, the controllability of a special temporally switching directed network of linear time-varying （LTV） node systems will be addressed, leaving some more general networks and challenging issues to the end for research outlook.
基金supported by the National Natural Science Foundation of China(Nos.62176263,62103434,62003363,61703411)the Science Foundation for Distinguished Youth of Shaanxi Province,China(No.2021JC-35)+2 种基金the Youth Science Foundation of Shaanxi Province,China(No.2021JQ-375)the China Postdoctoral Science Special Foundation(No.2021T140790)the China Postdoctoral Science Foundation(No.271004).
文摘Minimum-energy formation achievement problems for networked multiagent systems are investigated,where information networks with leaderless and leader-follower structures are respectively addressed and information networks are randomly switching.The critical feature of this work is that the energy constraint is minimum in the sense of the linear matrix inequality,but limited-budget control and guaranteed-cost control cannot realize a minimum-energy formation.Firstly,the leaderless minimum-energy formation control problem is converted into an asymp-totic stability one via a nonsingular transformation and state space decomposition,and based on linear matrix inequality techniques,sufficient conditions for analysis and design of leaderless minimum-energy formation achievement are proposed,respectively,which can be solved by the generalized eigenvalue method.Then,main results of minimum-energy formation achievement of leaderless networked multiagent systems are extended leader-follower networked multiagent systems,where the asymmetric property of the leader-follower information network is well dealt with by two nonsingular transformations.Finally,two simulation examples are shown to verify the main results for minimum-energy formation achievements of leaderless and leader-follower networked multiagent systems,respectively.
基金supported by the National Natural Science Foundation of China(No.60940017)the Project in Natural Science Research Foundation of Education Department of Henan Province(No.2010A510002)
文摘One of the key problems to hinder the realization of optical burst switching(OBS) technology in the core networks is the losses due to the contention among the bursts at the core nodes.Burst segmentation is an effective contention resolution technique used to reduce the number of packets lost due to the burst losses.In our work,a burst segmentation-deflection routing contention resolution mechanism in OBS networks is proposed.When the contention occurs,the bursts are segmented according to the lowest packet loss probability of networks firstly,and then the segmented burst is deflected on the optimum routing.An analytical model is proposed to evaluate the contention resolution mechanism.Simulation results show that high-priority bursts have significantly lower packet loss probability and transmission delay than the low-priority.And the performance of the burst lengths,in which the number of segments per burst distributes geometrically,is more effective than that of the deterministically distributed burst lengths.
文摘Nowadays, distributed optimization algorithms are widely used in various complex networks. In order to expand the theory of distributed optimization algorithms in the direction of directed graph, the distributed convex optimization problem with time-varying delays and switching topologies in the case of directed graph topology is studied. The event-triggered communication mechanism is adopted, that is, the communication between agents is determined by the trigger conditions, and the information exchange is carried out only when the conditions are met. Compared with continuous communication, this greatly saves network resources and reduces communication cost. Using Lyapunov-Krasovskii function method and inequality analysis, a new sufficient condition is proposed to ensure that the agent state finally reaches the optimal state. The upper bound of the maximum allowable delay is given. In addition, Zeno behavior will be proved not to exist during the operation of the algorithm. Finally, a simulation example is given to illustrate the correctness of the results in this paper.
