Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access （TDMA） mo...Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access （TDMA） mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution （NBS） derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions.展开更多
This paper presented a joint resource allocation(RA) and admission control(AC) mechanism in software defined mobile networks(SDMNs). In this mechanism, the joint RA and AC problem can be formulated as an optimization ...This paper presented a joint resource allocation(RA) and admission control(AC) mechanism in software defined mobile networks(SDMNs). In this mechanism, the joint RA and AC problem can be formulated as an optimization problem with the aim of maximizing the number of admitted users while simultaneously minimizing the number of allocated channels. Since the primal problem is modeled to be a mixed integer nonlinear problem(MINLP), we attain the suboptimal solutions to the primal MINLP by convex relaxation. Additionally, with the global information collected by the SDMNs controller, a centralized joint RA and AC(CJRA)algorithm is proposed by the Lagrange dual decomposition technique to obtain the global optimum. Meanwhile, we propose an OpenFlow rules placement strategy to realize CJRA in an efficient way. Moreover, a distributed algorithm is also developed to find the local optimum, showing a performance benchmark for the centralized one. Finally, simulation results show that the proposed centralized algorithm admits more users compared with the distributed.展开更多
In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly discussed especially the principle of dynamic bandwidth allocation. Then the fair share of the bandwidth among differen...In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly discussed especially the principle of dynamic bandwidth allocation. Then the fair share of the bandwidth among different traffic sources is analyzed based on cooperative game model. A CAC scheme is proposed using the genetic algorithm (GA) to optimize the bandwidth-delay-product formed utilization function that ensures the fair share and accuracy of accepting/rejecting the incoming calls. Simulation results show that the proposed scheme ensures fairness of the shared bandwidth to different traffic sources.展开更多
Admission control is an important strategy for Quality of Service (QoS) provisioning in Asynchro- nous Transfer Mode (ATM) networks. Based on a control-theory model of resources on-Demand Allocation (DA) protocol, the...Admission control is an important strategy for Quality of Service (QoS) provisioning in Asynchro- nous Transfer Mode (ATM) networks. Based on a control-theory model of resources on-Demand Allocation (DA) protocol, the paper studies the effect of the protocol on the statistical characteristics of network traffic, and proposes a combined connection admission control algorithm with the DA protocol to achieve full utiliza- tion of link resources in satellite communication systems. The proposed algorithm is based on the cross-layer-design approach. Theoretical analysis and system simulation results show that the proposed algo- rithm can admit more connections within certain admission thresholds than one that does not take into account the DA protocol. Thus, the proposed algorithm can increase admission ratio of traffic sources for satellite ATM networks and improve satellite link utilization.展开更多
Networked robots can perceive their surroundings, interact with each other or humans,and make decisions to accomplish specified tasks in remote/hazardous/complex environments. Satelliteunmanned aerial vehicle(UAV) net...Networked robots can perceive their surroundings, interact with each other or humans,and make decisions to accomplish specified tasks in remote/hazardous/complex environments. Satelliteunmanned aerial vehicle(UAV) networks can support such robots by providing on-demand communication services. However, under traditional open-loop communication paradigm, the network resources are usually divided into user-wise mostly-independent links,via ignoring the task-level dependency of robot collaboration. Thus, it is imperative to develop a new communication paradigm, taking into account the highlevel content and values behind, to facilitate multirobot operation. Inspired by Wiener’s Cybernetics theory, this article explores a closed-loop communication paradigm for the robot-oriented satellite-UAV network. This paradigm turns to handle group-wise structured links, so as to allocate resources in a taskoriented manner. It could also exploit the mobility of robots to liberate the network from full coverage,enabling new orchestration between network serving and positive mobility control of robots. Moreover,the integration of sensing, communications, computing and control would enlarge the benefit of this new paradigm. We present a case study for joint mobile edge computing(MEC) offloading and mobility control of robots, and finally outline potential challenges and open issues.展开更多
该文提出了一种对区分服务网络中时延敏感业务进行接纳控制的SACiD(Service Admission Control in DiftServ)算法,它不仅保证用户业务的端到端时延不超过确定的上界,而且能比较充分利用网络资源。仿真结果表明,SA(:iD算法可以保证时延...该文提出了一种对区分服务网络中时延敏感业务进行接纳控制的SACiD(Service Admission Control in DiftServ)算法,它不仅保证用户业务的端到端时延不超过确定的上界,而且能比较充分利用网络资源。仿真结果表明,SA(:iD算法可以保证时延敏感业务的服务质量,而且其业务接纳率和带宽利用率接近综合服务网络中接纳控制算法的性能,但它的存储器需求却远小于它们。此外,SACiD算法运算简单,具有与区分服务一致的可扩展性, 可以为区分服务网络的资源管理提供支持。展开更多
基金supported by the Hi-Tech Research and Development Program (2007AA01Z221,2009AA01Z246)the National Natural Science Foundation of China (60672124,60832009)
文摘Development of fair and efficient bandwidth allocation and admission control schemes is one of the key issues in the design of IEEE 802.16 broadband wireless access systems in time division multiple access （TDMA） mode. In this article, the problem of bandwidth allocation and admission control is formulated as a Nash bargaining model. The nash bargaining solution （NBS） derived from the cooperative game is adopted to maximize the spectrum utilization. Analysis and simulation results show that there is a unique Pareto optimal bandwidth allocation solution by using NBS among various flows. Furthermore, maximum utility of the system can also be maintained by using the admission control policy with different number of connections and variable channel qualities. The total throughput of the proposed scheme is close to the maximal one, while significantly improving fairness compared to the existing solutions.
基金supported by the National Natural Science Foundation of China under Grant No.61701284,61472229,31671588 and 61801270the China Postdoctoral Science Foundation Funded Project under Grant No2017M622233+2 种基金the Application Research Project for Postdoctoral Researchers of Qingdao,the Scientific Research Foundation of Shandong University of Science and Technology for Recruited Talents under Grant No.2016RCJJ010the Sci.&Tech.DevelopmentFund of Shandong Province of China underGrant No.2016ZDJS02A11,ZR2017BF015and ZR2017MF027the Taishan Scholar Climbing Program of Shandong Province,and SDUST Research Fund under Grant No.2015TDJH102
文摘This paper presented a joint resource allocation(RA) and admission control(AC) mechanism in software defined mobile networks(SDMNs). In this mechanism, the joint RA and AC problem can be formulated as an optimization problem with the aim of maximizing the number of admitted users while simultaneously minimizing the number of allocated channels. Since the primal problem is modeled to be a mixed integer nonlinear problem(MINLP), we attain the suboptimal solutions to the primal MINLP by convex relaxation. Additionally, with the global information collected by the SDMNs controller, a centralized joint RA and AC(CJRA)algorithm is proposed by the Lagrange dual decomposition technique to obtain the global optimum. Meanwhile, we propose an OpenFlow rules placement strategy to realize CJRA in an efficient way. Moreover, a distributed algorithm is also developed to find the local optimum, showing a performance benchmark for the centralized one. Finally, simulation results show that the proposed centralized algorithm admits more users compared with the distributed.
基金National Science Foundation of China,Grant No.69682010
文摘In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly discussed especially the principle of dynamic bandwidth allocation. Then the fair share of the bandwidth among different traffic sources is analyzed based on cooperative game model. A CAC scheme is proposed using the genetic algorithm (GA) to optimize the bandwidth-delay-product formed utilization function that ensures the fair share and accuracy of accepting/rejecting the incoming calls. Simulation results show that the proposed scheme ensures fairness of the shared bandwidth to different traffic sources.
基金Supported by the National Natural Science Foundation of China (No.60472027).
文摘Admission control is an important strategy for Quality of Service (QoS) provisioning in Asynchro- nous Transfer Mode (ATM) networks. Based on a control-theory model of resources on-Demand Allocation (DA) protocol, the paper studies the effect of the protocol on the statistical characteristics of network traffic, and proposes a combined connection admission control algorithm with the DA protocol to achieve full utiliza- tion of link resources in satellite communication systems. The proposed algorithm is based on the cross-layer-design approach. Theoretical analysis and system simulation results show that the proposed algo- rithm can admit more connections within certain admission thresholds than one that does not take into account the DA protocol. Thus, the proposed algorithm can increase admission ratio of traffic sources for satellite ATM networks and improve satellite link utilization.
基金supported in part by the National Key Research and Development Program of China (Grant No.2020YFA0711301)in part by the National Natural Science Foundation of China (Grant No.62341110 and U22A2002)in part by the Suzhou Science and Technology Project。
文摘Networked robots can perceive their surroundings, interact with each other or humans,and make decisions to accomplish specified tasks in remote/hazardous/complex environments. Satelliteunmanned aerial vehicle(UAV) networks can support such robots by providing on-demand communication services. However, under traditional open-loop communication paradigm, the network resources are usually divided into user-wise mostly-independent links,via ignoring the task-level dependency of robot collaboration. Thus, it is imperative to develop a new communication paradigm, taking into account the highlevel content and values behind, to facilitate multirobot operation. Inspired by Wiener’s Cybernetics theory, this article explores a closed-loop communication paradigm for the robot-oriented satellite-UAV network. This paradigm turns to handle group-wise structured links, so as to allocate resources in a taskoriented manner. It could also exploit the mobility of robots to liberate the network from full coverage,enabling new orchestration between network serving and positive mobility control of robots. Moreover,the integration of sensing, communications, computing and control would enlarge the benefit of this new paradigm. We present a case study for joint mobile edge computing(MEC) offloading and mobility control of robots, and finally outline potential challenges and open issues.
文摘该文提出了一种对区分服务网络中时延敏感业务进行接纳控制的SACiD(Service Admission Control in DiftServ)算法,它不仅保证用户业务的端到端时延不超过确定的上界,而且能比较充分利用网络资源。仿真结果表明,SA(:iD算法可以保证时延敏感业务的服务质量,而且其业务接纳率和带宽利用率接近综合服务网络中接纳控制算法的性能,但它的存储器需求却远小于它们。此外,SACiD算法运算简单,具有与区分服务一致的可扩展性, 可以为区分服务网络的资源管理提供支持。
