Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in us...Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in user demand for latency-sensitive tasks has inevitably led to offloading bottlenecks and insufficient computational capacity on individual satellite edge servers,making it necessary to implement effective task offloading scheduling to enhance user experience.In this paper,we propose a priority-based task scheduling strategy based on a Software-Defined Network(SDN)framework for satellite-terrestrial integrated networks,which clarifies the execution order of tasks based on their priority.Subsequently,we apply a Dueling-Double Deep Q-Network(DDQN)algorithm enhanced with prioritized experience replay to derive a computation offloading strategy,improving the experience replay mechanism within the Dueling-DDQN framework.Next,we utilize the Deep Deterministic Policy Gradient(DDPG)algorithm to determine the optimal resource allocation strategy to reduce the processing latency of sub-tasks.Simulation results demonstrate that the proposed d3-DDPG algorithm outperforms other approaches,effectively reducing task processing latency and thus improving user experience and system efficiency.展开更多
Most existing knowledge graph relationship prediction methods are unable to capture the complex information of multi-relational knowledge graphs,thus overlooking key details contained in different entity pairs and mak...Most existing knowledge graph relationship prediction methods are unable to capture the complex information of multi-relational knowledge graphs,thus overlooking key details contained in different entity pairs and making it difficult to aggregate more complex relational features.Moreover,the insufficient capture of multi-hop relational information limits the processing capability of the global structure of the graph and reduces the accuracy of the knowledge graph completion task.This paper uses graph neural networks to construct new message functions for different relations,which can be defined as the rotation from the source entity to the target entity in the complex vector space for each relation,thereby improving the relation perception.To further enrich the relational diversity of different entities,we capture themulti-hop structural information in complex graph structure relations by incorporating two-hop relations for each entity and adding auxiliary edges to various relation combinations in the knowledge graph,thereby aggregating more complex relations and improving the reasoning ability of complex relational information.To verify the effectiveness of the proposed method,we conducted experiments on the WN18RR and FB15k-237 standard datasets.The results show that the method proposed in this study outperforms most existing methods.展开更多
Satellite networks have many inherent advantages over terrestrial networks and have become an important part of the global network infrastructure.Routing aimed at satellite networks has become a hot and challenging re...Satellite networks have many inherent advantages over terrestrial networks and have become an important part of the global network infrastructure.Routing aimed at satellite networks has become a hot and challenging research topic.Satellite networks,which are special kind of Delay Tolerant Networks(DTN),can also adopt the routing solutions of DTN.Among the many routing proposals,Contact Graph Routing(CGR) is an excellent candidate,since it is designed particularly for use in highly deterministic space networks.The applicability of CGR in satellite networks is evaluated by utilizing the space oriented DTN gateway model based on OPNET(Optimized Network Engineering Tool).Link failures are solved with neighbor discovery mechanism and route recomputation.Earth observation scenario is used in the simulations to investigate CGR's performance.The results show that the CGR performances are better in terms of effectively utilizing satellite networks resources to calculate continuous route path and alternative route can be successfully calculated under link failures by utilizing fault tolerance scheme.展开更多
Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links,satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-int...Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links,satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-intensive applications for satellite communication networks(SCNs).By deploying edge computing servers in satellite and gateway stations,SCNs can achieve significant performance gains of the computing capacities at the expense of extending the dimensions and complexity of resource management.Therefore,in this paper,we investigate the joint computing and communication resource management problem for SCNs to minimize the execution latency of the computation-intensive applications,while two different satellite edge computing scenarios and local execution are considered.Furthermore,the joint computing and communication resource allocation problem for the computation-intensive services is formulated as a mixed-integer programming problem.A game-theoretic and many-to-one matching theorybased scheme(JCCRA-GM)is proposed to achieve an approximate optimal solution.Numerical results show that the proposed method with low complexity can achieve almost the same weight-sum latency as the Brute-force method.展开更多
The Open Flow implementations(SDNs) have been deployed increasingly on varieties of networks in research institutions as well as commercial institutions. To develop an Open Flow implementation, it is required to under...The Open Flow implementations(SDNs) have been deployed increasingly on varieties of networks in research institutions as well as commercial institutions. To develop an Open Flow implementation, it is required to understand the performance of the network. A few benchmark tools(e.g., Cbench and OFlops) can be used to measure the network performance, while these tools take considerable time to simulate traffic behaviors and generate the required results,therefore extending the development time. In this paper, we present an analytical model, which is based on stochastic network calculus theory, for evaluating the performance of switch to controller.The previous studies show that stochastic network calculus can provide realistic emulation of real network traffic behaviors. Our model is evaluated by using both simulation tool and realistic testbed.The results show the stochastic network calculus based analysis model can realistically measure the network performance of the end-to-end properties between controller and switch.展开更多
The wide variety of smart embedded computing devices and their increasing number of applications in our daily life have created new op- portunities to acquire knowledge from the physical world anytime and anywhere, wh...The wide variety of smart embedded computing devices and their increasing number of applications in our daily life have created new op- portunities to acquire knowledge from the physical world anytime and anywhere, which is envisioned as the＂Internet of Things＂ （IoT）. Since a huge number of heterogeneous resources are brought in- to IoT, one of the main challenges is how to effi- ciently manage the increasing complexity of IoT in a scalable, flexNle, and autonomic way. Further- more, the emerging IoT applications will require collaborations among loosely coupled devices, which may reside in various locations of the Inter- net. In this paper, we propose a new IoT network management architecture based on cognitive net- work management technology and Service-Orien- ted Architecture to provide effective and efficient network management of loT.展开更多
As a viable component of 6G wireless communication architecture,satellite-terrestrial networks support efficient file delivery by leveraging the innate broadcast ability of satellite and the enhanced powerful file tra...As a viable component of 6G wireless communication architecture,satellite-terrestrial networks support efficient file delivery by leveraging the innate broadcast ability of satellite and the enhanced powerful file transmission approaches of multi-tier terrestrial networks.In the paper,we introduce edge computing technology into the satellite-terrestrial network and propose a partition-based cache and delivery strategy to make full use of the integrated resources and reducing the backhaul load.Focusing on the interference effect from varied nodes in different geographical distances,we derive the file successful transmission probability of the typical user and by utilizing the tool of stochastic geometry.Considering the constraint of nodes cache space and file sets parameters,we propose a near-optimal partition-based cache and delivery strategy by optimizing the asymptotic successful transmission probability of the typical user.The complex nonlinear programming problem is settled by jointly utilizing standard particle-based swarm optimization(PSO)method and greedy based multiple knapsack choice problem(MKCP)optimization method.Numerical results show that compared with the terrestrial only cache strategy,Ground Popular Strategy,Satellite Popular Strategy,and Independent and identically distributed popularity strategy,the performance of the proposed scheme improve by 30.5%,9.3%,12.5%and 13.7%.展开更多
This paper develops a QKD （quantum key distribution）-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of...This paper develops a QKD （quantum key distribution）-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of the QKD system. Furthermore, it proposes a key buffering policy which could effectively improve the delay performance in practice. The results will be helpful for quality of service in practical QKD systems.展开更多
In the upcoming 5 G heterogeneous networks, leveraging multiple radio access technologies(RATs) shows to be a crucial issue in achieving RAT multiplexing gain to meet the explosive traffic demand. For always best conn...In the upcoming 5 G heterogeneous networks, leveraging multiple radio access technologies(RATs) shows to be a crucial issue in achieving RAT multiplexing gain to meet the explosive traffic demand. For always best connection(ABC), users tend to activate parallel transmission across all available RATs. However from a system-wide perspective, this might not be optimal given the context of network load, interference and diverse service requirements. To intelligently determine how to use these multi-RAT access resources concurrently, this paper proposes a joint multi-RAT user association and resource allocation strategy with triple decision and integrated context awareness of users and networks. A dynamic game based ant colony algorithm(GACA) is designed to simultaneously maximize the system utility and the fairness of resource allocation. Simulation results show that it's more reasonable to make multi-RAT association decision from a system-wide viewpoint than from an individual one. Compared to max-SNR based and ABC based strategies, the proposed method alleviates network congestion and optimizes resource allocation. It obtains 39%~70% performance improvement.展开更多
The effective radio resource allocation al-gorithms, which satisfy diversiform requirements of mobile naltimedia services in wireless cellular net-works, have recently attracted more and more at-tention. This paper pr...The effective radio resource allocation al-gorithms, which satisfy diversiform requirements of mobile naltimedia services in wireless cellular net-works, have recently attracted more and more at-tention. This paper proposes a service-aware scheduling algorithm, in which the Mean Opinion Score （MOS） is chosen as the unified metric of the Quality of Experience （QoE）. As the network needs to provide satisfactory services to all the users, the fairness of QoE should be considered. The Propor- tional Fair （PF） principle is adopted to achieve the trade-off between the network perfonmnce and us- er fairness. Then, an integer progranming problem is formed and the QoE-aware PF scheduling princi-ple is derived by solving the relaxed problem. Simu-lation results show that the proposed scheduling principle can perform better in terms of user fair-ness than the previous principle maximizing the sum of MOS. It also outperfoms the max-rain scheduling principle in terms of average MOS.展开更多
The conservative Additive Increase Multiplicative Decrease mechanism of traditional TCP causes the link under-utilization in the Wide Area Networks(WANs) due to the WANs' intrinsic nature of high latency and high ...The conservative Additive Increase Multiplicative Decrease mechanism of traditional TCP causes the link under-utilization in the Wide Area Networks(WANs) due to the WANs' intrinsic nature of high latency and high packet loss.To alleviate the problem,we present the design and implantation of STAG,an Acceleration Gateway with Split-TCP in the paper.STAG is built on embedded network equipment and acts as a transparent proxy.In STAG,a new improved congestion control method named Rapid TCP is adopted,which determines whether or not to decrease the congestion window based on the packet loss trend.In particular,in the fast recovery phase,it chooses different window adjustment strategies based on the current size of congestion window to achieve higher utilization.The performance validation of STAG is done on both our emulation testbed and the real wide area network.The results show that STAG with Rapid TCP effectively adapts to the high loss network environment and significantly speeds up the applications without loss of fairness.展开更多
This work proposes a Field Programmable Gate Array(FPGA)-oriented architecture for the IEEE 8o2.11 Distributed Coordination Function(DCF)transceiver.Ⅵdescribe the functional blocks carrying out the Carrier Sense M ul...This work proposes a Field Programmable Gate Array(FPGA)-oriented architecture for the IEEE 8o2.11 Distributed Coordination Function(DCF)transceiver.Ⅵdescribe the functional blocks carrying out the Carrier Sense M ultip le Accesses with Collision Avoidance(CSMA/CA),develop the interfaces to the application lay er and the physical layer,and implement it on FPGA devices by utilizing Very-·high·-speed·-integrated_。circuit Hardware Description Language(VHDL).The novelty of our proposal is twofold.Firstly,all MAC parameters(i.e.,M ax/M in Contention Window,Data Unit I_ength,Fragmentation Threshold,Retry Limit,etc.)can be directly acessed and programmed from the application lay er interface,which is necessary to achieve better network performance in dynamic environ—ments.Secondly。the character based on FPGA makes the proposal more flexible and risk—reduced for the development of DCF—based wireless networks.such as M ANETs and sol'ware-defined-ra-dio-based cognitive ad hoc networks.展开更多
Software-defined networks （SDN） have attracted much attention recently because of their flexibility in terms of network management. Increasingly, SDN is being introduced into wireless networks to form wireless SDN. ...Software-defined networks （SDN） have attracted much attention recently because of their flexibility in terms of network management. Increasingly, SDN is being introduced into wireless networks to form wireless SDN. One enabling technology for wireless SDN is network virtualization, which logically divides one wireless network element, such as a base station, into multiple slices, and each slice serving as a standalone virtual BS. In this way, one physical mobile wireless network can be partitioned into multiple virtual networks in a software-defined manner. Wireless virtual networks comprising virtual base stations also need to provide QoS to mobile end-user services in the same context as their physical hosting networks. One key QoS parameter is delay. This paper presents a delay model for software-defined wireless virtual networks. Network calculus is used in the modelling. In particular, stochastic network calculus, which describes more realistic models than deterministic network calculus, is used. The model enables theoretical investigation of wireless SDN, which is largely dominated by either algorithms or prototype implementations.展开更多
This paper introduces the concept of linear-control-based synchronization of coexisting attractor networks with time delays. Within the new framework, closed loop control for each dynamic node is realized through line...This paper introduces the concept of linear-control-based synchronization of coexisting attractor networks with time delays. Within the new framework, closed loop control for each dynamic node is realized through linear state feedback around its own arena in a decentralized way, where the feedback matrix is determined through consideration of the coordination of the node dynamics, the inner connected matrix and the outer connected matrix. Unlike previously existing results, the feedback gain matrix here is decoupled from the inner matrix; this not only guarantees the flexible choice of the gain matrix, hut also leaves much space for inner matrix configuration. Synchronization of coexisting attractor networks with time delays is made possible in virtue of local interaction, which works in a distributed way between individual neighbours, and the linear feedback control for each node. Provided that the network is connected and balanced, synchronization will come true naturally, where theoretical proof is given via a Lyapunov function. For completeness, several illustrative examples are presented to further elucidate the novelty and efficacy of the proposed scheme.展开更多
Providing services on demand is a major contributing factor to drive the increasingly development of the software defined network. However, it should supply all the current popular applications before it really attain...Providing services on demand is a major contributing factor to drive the increasingly development of the software defined network. However, it should supply all the current popular applications before it really attains widespread development. Multiple Description Coding(MDC) video applications, as a popular application in the current network, should be reasonably supported in this novel network virtualization environment. In this paper, we address this issue to assign MDC video application into virtual networks with an efficient centralized algorithm(CAMDV). Since this problem is an NP-hard problem, we design an algorithm that can effectively balance the user satisfaction and network resource cost. Previous work just builds a global multicast tree for each description to connect all the destination nodes by breadth-first search strategy or shortest path tree algorithm. But those methods could not achieve an optimal balance or a high-level user satisfaction. By introducing the hierarchical clustering scheme, our algorithm decomposes the whole mapping procedure into multicast tree construction and multipath description distribution. A serial of simulation experiments show that our centralized algorithm could achieve a better performance in balancing the user satisfaction and average mapping cost in comparison with its rivals.展开更多
This paper introduces the concept of hierarchical-control-based output synchronization of coexisting attractor networks. Within the new framework, each dynamic node is made passive at first utilizing intra-control aro...This paper introduces the concept of hierarchical-control-based output synchronization of coexisting attractor networks. Within the new framework, each dynamic node is made passive at first utilizing intra-control around its own arena. Then each dynamic node is viewed as one agent, and on account of that, the solution of output synchronization of coexisting attractor networks is transformed into a multi-agent consensus problem, which is made possible by virtue of local interaction between individual neighbours; this distributed working way of coordination is coined as inter-control, which is only specified by the topological structure of the network. Provided that the network is connected and balanced, the output synchronization would come true naturally via synergy between intra and inter-control actions, where the rightness is proved theoretically via convex composite Lyapunov functions. For completeness, several illustrative examples are presented to further elucidate the novelty and efficacy of the proposed scheme.展开更多
In this paper, we propose a practical design and implementation of network-adaptive high definition (HD) MPEG-2 video streaming combined with cross-layered channel monitoring (CLM) over the IEEE 802.11a wireless local...In this paper, we propose a practical design and implementation of network-adaptive high definition (HD) MPEG-2 video streaming combined with cross-layered channel monitoring (CLM) over the IEEE 802.11a wireless local area network (WLAN). For wireless channel monitoring, we adopt a cross-layered approach, where an access point (AP) periodically measures lower layers such as medium access control (MAC) and physical (PHY) transmission information (e.g., MAC layer loss rate) and then sends the monitored information to the streaming server application. The adaptive streaming server with the CLM scheme reacts more quickly and efficiently to the fluctuating wireless channel than the end-to-end application-layer monitoring (E2EM) scheme. The streaming server dynamically performs priority-based frame dropping to adjust the sending rate according to the measured wireless channel condition. For this purpose, the proposed streaming system nicely provides frame-based prioritized packetization by using a real-time stream parsing module. Various evaluation results over an IEEE 802.11a WLAN testbed are provided to verify the intended Quality of Service (QoS) adaptation capability. Experimental results showed that the proposed system can mitigate the quality degradation of video streaming due to the fluctuations of time-varying channel.展开更多
We analyze the performance of a twoway satellite-terrestrial decode-and-forward(DF) relay network over non-identical fading channels.In particular,selective physical-layer network coding(SPNC) is employed in the propo...We analyze the performance of a twoway satellite-terrestrial decode-and-forward(DF) relay network over non-identical fading channels.In particular,selective physical-layer network coding(SPNC) is employed in the proposed network to improve the average end-to-end throughput performance.More specifically,by assuming that the DF relay performs instantaneous throughput comparisons before performing corresponding protocols,we derive the expressions of system instantaneous bit-error-rate(BER),instantaneous end-to-end throughput,average end-to-end throughput,single node detection(SND)occurrence probability and average end-to-end BER over non-identical fading channels.Finally,theoretical analyses and Monte Carlo simulation results are presented.Evaluations show that:1) SPNC protocol outperforms the conventional physical-layer network coding(PNC) protocol in infrequent light shadowing(ILS),average shadowing(AS) and frequent heavy shadowing(FHS) Shadowed-Rician fading channels.2) As the satellite-relay channel fading gets more sewere,SPNC protocol can achieve more performance improvement than PNC protocol and the occurrence probability of SND protocol increases progressively.3) The occurrence probability increase of SND has a beneficial effect on the average end-to-end throughput in low signal-to-noise ratio(SNR) regime,while the occurrence probability decrease of SND has a beneficial effect on the average end-to-end BER in highSNR regime.展开更多
A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational ...A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational simulation have shown that (1) there is a group of finite length of generalized inverse signals for any given finite signal, which forms the GIG; (2) each inverse group has different leaking coefficients, thus different abnormal states; (3) each GIG can be implemented by a grouped and improved single-layer perceptron which appears with fast convergence. When used in deconvolution, the proposed GIG can form a new parallel finite length of filtering deconvolution method. On off-line processing, the computational time is reduced to O(N) from O(N2). And the less the leaking coefficient is, the more reliable the deconvolution will be.展开更多
In traditional cognitive radio (CR) network, most existing graph-based spectrum allocation schemes don't take on-off behavior of primary users (PUs) into consideration. In this paper, a novel spectrum allocation a...In traditional cognitive radio (CR) network, most existing graph-based spectrum allocation schemes don't take on-off behavior of primary users (PUs) into consideration. In this paper, a novel spectrum allocation algorithm based on the activities of the PUs is proposed. The proposed algorithm mainly focuses on the vacant probability of licensed spectrums. And it allocates the vacant spectrums considering the interference to the neighbor cognitive nodes and the probability fairness of different cognitive nodes during the allocation. Based on the definition of the obtained benefit of cognitive node, new utility functions are formulated to characterize the system total spectrum utilization and fairness performance from the perspective of available probability. The simulation results validate that the proposed algorithm with low system communication cost is more effective than the traditional schemes when the available licensed spectrums are not sufficient, which is effective and meaningful to a real CR system with bad network condition.展开更多
文摘Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in user demand for latency-sensitive tasks has inevitably led to offloading bottlenecks and insufficient computational capacity on individual satellite edge servers,making it necessary to implement effective task offloading scheduling to enhance user experience.In this paper,we propose a priority-based task scheduling strategy based on a Software-Defined Network(SDN)framework for satellite-terrestrial integrated networks,which clarifies the execution order of tasks based on their priority.Subsequently,we apply a Dueling-Double Deep Q-Network(DDQN)algorithm enhanced with prioritized experience replay to derive a computation offloading strategy,improving the experience replay mechanism within the Dueling-DDQN framework.Next,we utilize the Deep Deterministic Policy Gradient(DDPG)algorithm to determine the optimal resource allocation strategy to reduce the processing latency of sub-tasks.Simulation results demonstrate that the proposed d3-DDPG algorithm outperforms other approaches,effectively reducing task processing latency and thus improving user experience and system efficiency.
文摘Most existing knowledge graph relationship prediction methods are unable to capture the complex information of multi-relational knowledge graphs,thus overlooking key details contained in different entity pairs and making it difficult to aggregate more complex relational features.Moreover,the insufficient capture of multi-hop relational information limits the processing capability of the global structure of the graph and reduces the accuracy of the knowledge graph completion task.This paper uses graph neural networks to construct new message functions for different relations,which can be defined as the rotation from the source entity to the target entity in the complex vector space for each relation,thereby improving the relation perception.To further enrich the relational diversity of different entities,we capture themulti-hop structural information in complex graph structure relations by incorporating two-hop relations for each entity and adding auxiliary edges to various relation combinations in the knowledge graph,thereby aggregating more complex relations and improving the reasoning ability of complex relational information.To verify the effectiveness of the proposed method,we conducted experiments on the WN18RR and FB15k-237 standard datasets.The results show that the method proposed in this study outperforms most existing methods.
基金Supported by the open project of Communication network transmission and distribution technologies Key Laboratory(ITD-12005/K1260011)the National Natural Science Foundation of China(61371126) and the National Natural Science Foundation of China(60903195)
文摘Satellite networks have many inherent advantages over terrestrial networks and have become an important part of the global network infrastructure.Routing aimed at satellite networks has become a hot and challenging research topic.Satellite networks,which are special kind of Delay Tolerant Networks(DTN),can also adopt the routing solutions of DTN.Among the many routing proposals,Contact Graph Routing(CGR) is an excellent candidate,since it is designed particularly for use in highly deterministic space networks.The applicability of CGR in satellite networks is evaluated by utilizing the space oriented DTN gateway model based on OPNET(Optimized Network Engineering Tool).Link failures are solved with neighbor discovery mechanism and route recomputation.Earth observation scenario is used in the simulations to investigate CGR's performance.The results show that the CGR performances are better in terms of effectively utilizing satellite networks resources to calculate continuous route path and alternative route can be successfully calculated under link failures by utilizing fault tolerance scheme.
基金This work was supported by the National Natural Science Foundation of China(Grants 61971054 and 61601045)Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory Foundation(HHX21641X002 and HHX20641X003).
文摘Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links,satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-intensive applications for satellite communication networks(SCNs).By deploying edge computing servers in satellite and gateway stations,SCNs can achieve significant performance gains of the computing capacities at the expense of extending the dimensions and complexity of resource management.Therefore,in this paper,we investigate the joint computing and communication resource management problem for SCNs to minimize the execution latency of the computation-intensive applications,while two different satellite edge computing scenarios and local execution are considered.Furthermore,the joint computing and communication resource allocation problem for the computation-intensive services is formulated as a mixed-integer programming problem.A game-theoretic and many-to-one matching theorybased scheme(JCCRA-GM)is proposed to achieve an approximate optimal solution.Numerical results show that the proposed method with low complexity can achieve almost the same weight-sum latency as the Brute-force method.
基金supported by the National Science and Technology Support Program (2014BAH24F01)the National Basic Research Program of China(2012CB3 15903)+3 种基金the Program for Key Science and Technology Innovation Team of Zhejiang Province (2011R50010-21,2013TD20)863 Program of China(2015AA015602,2015AA016103)the National Natural Science Foundation of China (61379118)the Fundamental Research Funds for the Central Universities
文摘The Open Flow implementations(SDNs) have been deployed increasingly on varieties of networks in research institutions as well as commercial institutions. To develop an Open Flow implementation, it is required to understand the performance of the network. A few benchmark tools(e.g., Cbench and OFlops) can be used to measure the network performance, while these tools take considerable time to simulate traffic behaviors and generate the required results,therefore extending the development time. In this paper, we present an analytical model, which is based on stochastic network calculus theory, for evaluating the performance of switch to controller.The previous studies show that stochastic network calculus can provide realistic emulation of real network traffic behaviors. Our model is evaluated by using both simulation tool and realistic testbed.The results show the stochastic network calculus based analysis model can realistically measure the network performance of the end-to-end properties between controller and switch.
基金supported by the National Sci.&Tech. Major Project of China(No.2010ZX03004-002)the National Natural Science Foundation of China(No.60972083)
文摘The wide variety of smart embedded computing devices and their increasing number of applications in our daily life have created new op- portunities to acquire knowledge from the physical world anytime and anywhere, which is envisioned as the＂Internet of Things＂ （IoT）. Since a huge number of heterogeneous resources are brought in- to IoT, one of the main challenges is how to effi- ciently manage the increasing complexity of IoT in a scalable, flexNle, and autonomic way. Further- more, the emerging IoT applications will require collaborations among loosely coupled devices, which may reside in various locations of the Inter- net. In this paper, we propose a new IoT network management architecture based on cognitive net- work management technology and Service-Orien- ted Architecture to provide effective and efficient network management of loT.
基金supported by the National Key Research and Development Program of China 2021YFB2900504,2020YFB1807900 and 2020YFB1807903by the National Science Foundation of China under Grant 62271062,62071063。
文摘As a viable component of 6G wireless communication architecture,satellite-terrestrial networks support efficient file delivery by leveraging the innate broadcast ability of satellite and the enhanced powerful file transmission approaches of multi-tier terrestrial networks.In the paper,we introduce edge computing technology into the satellite-terrestrial network and propose a partition-based cache and delivery strategy to make full use of the integrated resources and reducing the backhaul load.Focusing on the interference effect from varied nodes in different geographical distances,we derive the file successful transmission probability of the typical user and by utilizing the tool of stochastic geometry.Considering the constraint of nodes cache space and file sets parameters,we propose a near-optimal partition-based cache and delivery strategy by optimizing the asymptotic successful transmission probability of the typical user.The complex nonlinear programming problem is settled by jointly utilizing standard particle-based swarm optimization(PSO)method and greedy based multiple knapsack choice problem(MKCP)optimization method.Numerical results show that compared with the terrestrial only cache strategy,Ground Popular Strategy,Satellite Popular Strategy,and Independent and identically distributed popularity strategy,the performance of the proposed scheme improve by 30.5%,9.3%,12.5%and 13.7%.
基金Project supported by National Fundamental Research Program of China (Grant No 2006CB921900)National Natural Science Foundation of China (Grant Nos 60537020 and 60621064)Knowledge Innovation Project of Chinese Academy of Sciences
文摘This paper develops a QKD （quantum key distribution）-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of the QKD system. Furthermore, it proposes a key buffering policy which could effectively improve the delay performance in practice. The results will be helpful for quality of service in practical QKD systems.
基金supported by the National Natural Science Fund of China(Grant NO.61771065,Grant NO.61571054 and Grant NO.61631005)Beijing Nova Program(NO.Z151100000315077)
文摘In the upcoming 5 G heterogeneous networks, leveraging multiple radio access technologies(RATs) shows to be a crucial issue in achieving RAT multiplexing gain to meet the explosive traffic demand. For always best connection(ABC), users tend to activate parallel transmission across all available RATs. However from a system-wide perspective, this might not be optimal given the context of network load, interference and diverse service requirements. To intelligently determine how to use these multi-RAT access resources concurrently, this paper proposes a joint multi-RAT user association and resource allocation strategy with triple decision and integrated context awareness of users and networks. A dynamic game based ant colony algorithm(GACA) is designed to simultaneously maximize the system utility and the fairness of resource allocation. Simulation results show that it's more reasonable to make multi-RAT association decision from a system-wide viewpoint than from an individual one. Compared to max-SNR based and ABC based strategies, the proposed method alleviates network congestion and optimizes resource allocation. It obtains 39%~70% performance improvement.
基金This paper was supported partially by the Program for New Century Excellent Talents in University under Crant No. NCET-11-0600 the National Natural Science Foundation of China under Crant NN76022 and the France Telecom R ＆ D Beijing Co. Ltd.
文摘The effective radio resource allocation al-gorithms, which satisfy diversiform requirements of mobile naltimedia services in wireless cellular net-works, have recently attracted more and more at-tention. This paper proposes a service-aware scheduling algorithm, in which the Mean Opinion Score （MOS） is chosen as the unified metric of the Quality of Experience （QoE）. As the network needs to provide satisfactory services to all the users, the fairness of QoE should be considered. The Propor- tional Fair （PF） principle is adopted to achieve the trade-off between the network perfonmnce and us- er fairness. Then, an integer progranming problem is formed and the QoE-aware PF scheduling princi-ple is derived by solving the relaxed problem. Simu-lation results show that the proposed scheduling principle can perform better in terms of user fair-ness than the previous principle maximizing the sum of MOS. It also outperfoms the max-rain scheduling principle in terms of average MOS.
基金supported by the National Natural Science Foundation of China(Grant nos.61173169,61103204,and 61402542)the open funding of Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory(Grant no.ITDU14010/KX142600017)the Postgraduate Innovative Research Project of Hunan Province(No.CX2012B065)
文摘The conservative Additive Increase Multiplicative Decrease mechanism of traditional TCP causes the link under-utilization in the Wide Area Networks(WANs) due to the WANs' intrinsic nature of high latency and high packet loss.To alleviate the problem,we present the design and implantation of STAG,an Acceleration Gateway with Split-TCP in the paper.STAG is built on embedded network equipment and acts as a transparent proxy.In STAG,a new improved congestion control method named Rapid TCP is adopted,which determines whether or not to decrease the congestion window based on the packet loss trend.In particular,in the fast recovery phase,it chooses different window adjustment strategies based on the current size of congestion window to achieve higher utilization.The performance validation of STAG is done on both our emulation testbed and the real wide area network.The results show that STAG with Rapid TCP effectively adapts to the high loss network environment and significantly speeds up the applications without loss of fairness.
基金the National Natural Science Foundation of China
文摘This work proposes a Field Programmable Gate Array(FPGA)-oriented architecture for the IEEE 8o2.11 Distributed Coordination Function(DCF)transceiver.Ⅵdescribe the functional blocks carrying out the Carrier Sense M ultip le Accesses with Collision Avoidance(CSMA/CA),develop the interfaces to the application lay er and the physical layer,and implement it on FPGA devices by utilizing Very-·high·-speed·-integrated_。circuit Hardware Description Language(VHDL).The novelty of our proposal is twofold.Firstly,all MAC parameters(i.e.,M ax/M in Contention Window,Data Unit I_ength,Fragmentation Threshold,Retry Limit,etc.)can be directly acessed and programmed from the application lay er interface,which is necessary to achieve better network performance in dynamic environ—ments.Secondly。the character based on FPGA makes the proposal more flexible and risk—reduced for the development of DCF—based wireless networks.such as M ANETs and sol'ware-defined-ra-dio-based cognitive ad hoc networks.
基金supported in part by the grant from the National Natural Science Foundation of China (60973129)
文摘Software-defined networks （SDN） have attracted much attention recently because of their flexibility in terms of network management. Increasingly, SDN is being introduced into wireless networks to form wireless SDN. One enabling technology for wireless SDN is network virtualization, which logically divides one wireless network element, such as a base station, into multiple slices, and each slice serving as a standalone virtual BS. In this way, one physical mobile wireless network can be partitioned into multiple virtual networks in a software-defined manner. Wireless virtual networks comprising virtual base stations also need to provide QoS to mobile end-user services in the same context as their physical hosting networks. One key QoS parameter is delay. This paper presents a delay model for software-defined wireless virtual networks. Network calculus is used in the modelling. In particular, stochastic network calculus, which describes more realistic models than deterministic network calculus, is used. The model enables theoretical investigation of wireless SDN, which is largely dominated by either algorithms or prototype implementations.
基金Project supported by the National Natural Science Foundation of China (Grant No.60850004)the Funds for Creative Research Talents of Henan Education Bureau,China (Grant No.2009HASTIT021)+3 种基金the Natural Science Foundation of Henan Education Bureau,China (Grant No.2008A120005)Fundamental & Frontier Technology Research Planning Project of Henan Province,China (Grant No.072300460050)Doctorate Program of Henan Polytechnic University (Grant No.648606)Young Teacher Key Talents Program of Henan Polytechnic University (Grant No.649033)
文摘This paper introduces the concept of linear-control-based synchronization of coexisting attractor networks with time delays. Within the new framework, closed loop control for each dynamic node is realized through linear state feedback around its own arena in a decentralized way, where the feedback matrix is determined through consideration of the coordination of the node dynamics, the inner connected matrix and the outer connected matrix. Unlike previously existing results, the feedback gain matrix here is decoupled from the inner matrix; this not only guarantees the flexible choice of the gain matrix, hut also leaves much space for inner matrix configuration. Synchronization of coexisting attractor networks with time delays is made possible in virtue of local interaction, which works in a distributed way between individual neighbours, and the linear feedback control for each node. Provided that the network is connected and balanced, synchronization will come true naturally, where theoretical proof is given via a Lyapunov function. For completeness, several illustrative examples are presented to further elucidate the novelty and efficacy of the proposed scheme.
基金supported by the National Basic Research Program of China (2012CB315903)the National Science and Technology Support Program (2014BAH24F01)+3 种基金the Program for Key Science and Technology Innovation Team of Zhejiang Province (2011R50010-21, 2013TD20)863 Program of China (2015AA016103)the National Natural Science Foundation of China (61379118)the Fundamental Research Funds for the Central Universities
文摘Providing services on demand is a major contributing factor to drive the increasingly development of the software defined network. However, it should supply all the current popular applications before it really attains widespread development. Multiple Description Coding(MDC) video applications, as a popular application in the current network, should be reasonably supported in this novel network virtualization environment. In this paper, we address this issue to assign MDC video application into virtual networks with an efficient centralized algorithm(CAMDV). Since this problem is an NP-hard problem, we design an algorithm that can effectively balance the user satisfaction and network resource cost. Previous work just builds a global multicast tree for each description to connect all the destination nodes by breadth-first search strategy or shortest path tree algorithm. But those methods could not achieve an optimal balance or a high-level user satisfaction. By introducing the hierarchical clustering scheme, our algorithm decomposes the whole mapping procedure into multicast tree construction and multipath description distribution. A serial of simulation experiments show that our centralized algorithm could achieve a better performance in balancing the user satisfaction and average mapping cost in comparison with its rivals.
基金supported by the State Key Laboratory of Scientific&Engineering Computing, Chinese Academy of Sciencesthe National Natural Science Foundation of China (Grant No. 60850004)+4 种基金the Funds for Creative Research Talents of Henan Education Bureau, China (Grant No. 2009HASTIT021)the Natural Science Foundation of Henan Education Bureau, China(Grant No. 2008A120005)Fundamental&Frontier Technology Research Planning Project of Henan Province,China (Grant No.072300460050)Doctoral Program of Henan Polytechnic University (Grant No. 648606)Young Teacher Key Talents Program of Henan Polytechnic University (Grant No. 649033)
文摘This paper introduces the concept of hierarchical-control-based output synchronization of coexisting attractor networks. Within the new framework, each dynamic node is made passive at first utilizing intra-control around its own arena. Then each dynamic node is viewed as one agent, and on account of that, the solution of output synchronization of coexisting attractor networks is transformed into a multi-agent consensus problem, which is made possible by virtue of local interaction between individual neighbours; this distributed working way of coordination is coined as inter-control, which is only specified by the topological structure of the network. Provided that the network is connected and balanced, the output synchronization would come true naturally via synergy between intra and inter-control actions, where the rightness is proved theoretically via convex composite Lyapunov functions. For completeness, several illustrative examples are presented to further elucidate the novelty and efficacy of the proposed scheme.
基金Project (No. R05-2004-000-10987-0) partly supported by the Basic Research Program of the Korea Research Foundation
文摘In this paper, we propose a practical design and implementation of network-adaptive high definition (HD) MPEG-2 video streaming combined with cross-layered channel monitoring (CLM) over the IEEE 802.11a wireless local area network (WLAN). For wireless channel monitoring, we adopt a cross-layered approach, where an access point (AP) periodically measures lower layers such as medium access control (MAC) and physical (PHY) transmission information (e.g., MAC layer loss rate) and then sends the monitored information to the streaming server application. The adaptive streaming server with the CLM scheme reacts more quickly and efficiently to the fluctuating wireless channel than the end-to-end application-layer monitoring (E2EM) scheme. The streaming server dynamically performs priority-based frame dropping to adjust the sending rate according to the measured wireless channel condition. For this purpose, the proposed streaming system nicely provides frame-based prioritized packetization by using a real-time stream parsing module. Various evaluation results over an IEEE 802.11a WLAN testbed are provided to verify the intended Quality of Service (QoS) adaptation capability. Experimental results showed that the proposed system can mitigate the quality degradation of video streaming due to the fluctuations of time-varying channel.
基金National Natural Science Foundation of China(No.62071146).
文摘We analyze the performance of a twoway satellite-terrestrial decode-and-forward(DF) relay network over non-identical fading channels.In particular,selective physical-layer network coding(SPNC) is employed in the proposed network to improve the average end-to-end throughput performance.More specifically,by assuming that the DF relay performs instantaneous throughput comparisons before performing corresponding protocols,we derive the expressions of system instantaneous bit-error-rate(BER),instantaneous end-to-end throughput,average end-to-end throughput,single node detection(SND)occurrence probability and average end-to-end BER over non-identical fading channels.Finally,theoretical analyses and Monte Carlo simulation results are presented.Evaluations show that:1) SPNC protocol outperforms the conventional physical-layer network coding(PNC) protocol in infrequent light shadowing(ILS),average shadowing(AS) and frequent heavy shadowing(FHS) Shadowed-Rician fading channels.2) As the satellite-relay channel fading gets more sewere,SPNC protocol can achieve more performance improvement than PNC protocol and the occurrence probability of SND protocol increases progressively.3) The occurrence probability increase of SND has a beneficial effect on the average end-to-end throughput in low signal-to-noise ratio(SNR) regime,while the occurrence probability decrease of SND has a beneficial effect on the average end-to-end BER in highSNR regime.
基金Supported partly by Natural Science Foundation of ChinaAviation Science Grant of China
文摘A new concept, the generalized inverse group (GIG) of signal, is firstly proposed and its properties, leaking coefficients and implementation with neural networks are presented. Theoretical analysis and computational simulation have shown that (1) there is a group of finite length of generalized inverse signals for any given finite signal, which forms the GIG; (2) each inverse group has different leaking coefficients, thus different abnormal states; (3) each GIG can be implemented by a grouped and improved single-layer perceptron which appears with fast convergence. When used in deconvolution, the proposed GIG can form a new parallel finite length of filtering deconvolution method. On off-line processing, the computational time is reduced to O(N) from O(N2). And the less the leaking coefficient is, the more reliable the deconvolution will be.
基金Sponsored by the National Natural Science Foundation and Civil Aviation Administration of China(Grant No.61071104 and 61101122)Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory(Grant No.ITD-U12004/K1260010)the National Science and Technology Major Project of the Ministry of Science and Technology of China(Grant No.2012ZX03004-003)
文摘In traditional cognitive radio (CR) network, most existing graph-based spectrum allocation schemes don't take on-off behavior of primary users (PUs) into consideration. In this paper, a novel spectrum allocation algorithm based on the activities of the PUs is proposed. The proposed algorithm mainly focuses on the vacant probability of licensed spectrums. And it allocates the vacant spectrums considering the interference to the neighbor cognitive nodes and the probability fairness of different cognitive nodes during the allocation. Based on the definition of the obtained benefit of cognitive node, new utility functions are formulated to characterize the system total spectrum utilization and fairness performance from the perspective of available probability. The simulation results validate that the proposed algorithm with low system communication cost is more effective than the traditional schemes when the available licensed spectrums are not sufficient, which is effective and meaningful to a real CR system with bad network condition.
