Based on MATRIXx, a universal real-time visual distributed simulation system is developed. The system can receive different input data from network or local terminal. Application models in the simulation modules can a...Based on MATRIXx, a universal real-time visual distributed simulation system is developed. The system can receive different input data from network or local terminal. Application models in the simulation modules can automatically get such data to be analyzed and calculated, and then produce real-time simulation control information. Meanwhile, this paper designs relevant simulation components to implement the input and output data, which can guarantee the real-time and universal of the data transmission. Result of the experimental system shows that the real-time performance of the simulation is perfect.展开更多
Energy efficiency(EE) is a key requirement for the design of short-range communication network.In order to alleviate energy consumption(EC) constraint,a novel layered heterogeneous mobile cloud architecture is propose...Energy efficiency(EE) is a key requirement for the design of short-range communication network.In order to alleviate energy consumption(EC) constraint,a novel layered heterogeneous mobile cloud architecture is proposed in this paper.Based on the proposed layered heterogeneous mobile cloud architecture,we establish an appropriate energy consumption model,and design an energy efficiency scheme based on joint data packet fragmentation and cooperative transmission and analyze the energy efficiency corresponding to different packet sizes and the cloud size.Simulation results show that,when all nodes of the cloud are accessing the same size of data packet fragmentation,the proposed layered heterogeneous mobile cloud architecture can provide significant energy savings.The results provide useful insights into the possible operation of the strategies and show that significant energy consumption reductions are possible.展开更多
We consider differentiated timecritical task scheduling in a N×N input queued optical packet s w itch to ens ure 100% throughput and meet different delay requirements among various modules of data center. Existin...We consider differentiated timecritical task scheduling in a N×N input queued optical packet s w itch to ens ure 100% throughput and meet different delay requirements among various modules of data center. Existing schemes either consider slot-by-slot scheduling with queue depth serving as the delay metric or assume that each input-output connection has the same delay bound in the batch scheduling mode. The former scheme neglects the effect of reconfiguration overhead, which may result in crippled system performance, while the latter cannot satisfy users' differentiated Quality of Service(Qo S) requirements. To make up these deficiencies, we propose a new batch scheduling scheme to meet the various portto-port delay requirements in a best-effort manner. Moreover, a speedup is considered to compensate for both the reconfiguration overhead and the unavoidable slots wastage in the switch fabric. With traffic matrix and delay constraint matrix given, this paper proposes two heuristic algorithms Stringent Delay First(SDF) and m-order SDF(m-SDF) to realize the 100% packet switching, while maximizing the delay constraints satisfaction ratio. The performance of our scheme is verified by extensive numerical simulations.展开更多
How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the ...How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the element in authenticated skip list efficiently is an important part of authentication. Kaouthar Blibech and Alban Gabillon proposed a head proof and a tail proof algorithms for the membership proof of elements in the authenticated skip list. However, the proposed algorithms are uncorrelated each other and need plateau function. We propose a new algorithm for computing the membership proof for elements in the authenticated skip list by using two stacks, one is for storing traversal chain of leaf node, the other is for storing authentication path for the leaf. The proposed algorithm is simple and effective without needing plateau function. It can also be applicable for other similar binary hash trees.展开更多
Many research issues have been raised in Application Layer Multicasting(ALM),such as group management,security,integrity of data,link stress,link stretch,load balancing,fault tolerance and scalability,because of the s...Many research issues have been raised in Application Layer Multicasting(ALM),such as group management,security,integrity of data,link stress,link stretch,load balancing,fault tolerance and scalability,because of the shifting of the multicast protocol from the IP layer to the application layer.To address these issues many protocols have evolved by changing their topology structure.In this paper,the POSET protocol stack is proposed,which consists of three layers,such as communication control,POSET cube,and content distribution.The novelty of this paper is the lattice-based data distribution with POSET cube architecture.The results have been compared with the existing NICE and Narada protocols.The experimental results show that the proposed POSET protocol improves throughput between 7.14%and 40%and decreases the delay between 7.69%and 25%,compared to the existing NICE protocol.展开更多
Traditional packet classification for IPv4 involves examining standard 5-tuple of a packet header, source address, destination address, source port, destination port and protocol. With introduction of IPv6 flow label ...Traditional packet classification for IPv4 involves examining standard 5-tuple of a packet header, source address, destination address, source port, destination port and protocol. With introduction of IPv6 flow label field which entails labeling the packets belonging to the same flow, packet classification can be resolved based on 3 dimensions： flow label, source address and desti- nation address. In this paper, we propose a novel approach for the 3-tuple packet classification based on flow label. Besides, by introducing a conversion engine to covert the source-destination pairs to the compound address prefixes, we put forward an algorithm called Reducing Dimension （RD） with dimension reduction capability, which combines heuristic tree search with usage of buck- ets. And we also provide an improved version of RD, called Improved RD （IRD）, which uses two mechanisms： path compression and priority tag, to optimize the perforrmnce. To evaluate our algo- rithm, extensive experiraents have been conducted using a number of synthetically generated databas- es. For the memory consumption, the two pro- posed new algorithms only consumes around 3% of the existing algorithms when the number of ill- ters increases to 10 k. And for the average search time, the search time of the two proposed algo- rithms is more than four times faster than others when the number of filters is 10 k. The results show that the proposed algorithm works well and outperforms rmny typical existing algorithms with the dimension reduction capability.展开更多
文摘Based on MATRIXx, a universal real-time visual distributed simulation system is developed. The system can receive different input data from network or local terminal. Application models in the simulation modules can automatically get such data to be analyzed and calculated, and then produce real-time simulation control information. Meanwhile, this paper designs relevant simulation components to implement the input and output data, which can guarantee the real-time and universal of the data transmission. Result of the experimental system shows that the real-time performance of the simulation is perfect.
基金jointly supported by the Chongqing Municipal Natural Science Foundation under Grant No.CSTC2013jjB40001)the National High Technology Research and Development Program of China(863Program)under Grant No.20140908the Program for Changjiang Scholars and Innovative Research Team in University under Grant No.IRT1299
文摘Energy efficiency(EE) is a key requirement for the design of short-range communication network.In order to alleviate energy consumption(EC) constraint,a novel layered heterogeneous mobile cloud architecture is proposed in this paper.Based on the proposed layered heterogeneous mobile cloud architecture,we establish an appropriate energy consumption model,and design an energy efficiency scheme based on joint data packet fragmentation and cooperative transmission and analyze the energy efficiency corresponding to different packet sizes and the cloud size.Simulation results show that,when all nodes of the cloud are accessing the same size of data packet fragmentation,the proposed layered heterogeneous mobile cloud architecture can provide significant energy savings.The results provide useful insights into the possible operation of the strategies and show that significant energy consumption reductions are possible.
基金supported by the Major State Basic Research Program of China (973 project No. 2013CB329301 and 2010CB327806)the Natural Science Fund of China (NSFC project No. 61372085, 61032003, 61271165 and 61202379)+1 种基金the Research Fund for the Doctoral Program of Higher Education of China (RFDP project No. 20120185110025, 20120185110030 and 20120032120041)supported by Tianjin Key Laboratory of Cognitive Computing and Application, School of Computer Science and Technology, Tianjin University, Tianjin, P. R. China
文摘We consider differentiated timecritical task scheduling in a N×N input queued optical packet s w itch to ens ure 100% throughput and meet different delay requirements among various modules of data center. Existing schemes either consider slot-by-slot scheduling with queue depth serving as the delay metric or assume that each input-output connection has the same delay bound in the batch scheduling mode. The former scheme neglects the effect of reconfiguration overhead, which may result in crippled system performance, while the latter cannot satisfy users' differentiated Quality of Service(Qo S) requirements. To make up these deficiencies, we propose a new batch scheduling scheme to meet the various portto-port delay requirements in a best-effort manner. Moreover, a speedup is considered to compensate for both the reconfiguration overhead and the unavoidable slots wastage in the switch fabric. With traffic matrix and delay constraint matrix given, this paper proposes two heuristic algorithms Stringent Delay First(SDF) and m-order SDF(m-SDF) to realize the 100% packet switching, while maximizing the delay constraints satisfaction ratio. The performance of our scheme is verified by extensive numerical simulations.
基金partially supported by the Fundamental Research Funds for the Central Universities of China under Grant No.2015JBM034the China Scholarship Council Funds under File No.201407095023
文摘How to keep cloud data intact and available to users is a problem to be solved. Authenticated skip list is an important data structure used in cloud data integrity verification. How to get the membership proof of the element in authenticated skip list efficiently is an important part of authentication. Kaouthar Blibech and Alban Gabillon proposed a head proof and a tail proof algorithms for the membership proof of elements in the authenticated skip list. However, the proposed algorithms are uncorrelated each other and need plateau function. We propose a new algorithm for computing the membership proof for elements in the authenticated skip list by using two stacks, one is for storing traversal chain of leaf node, the other is for storing authentication path for the leaf. The proposed algorithm is simple and effective without needing plateau function. It can also be applicable for other similar binary hash trees.
基金supported by the university Grants Commission,New Delhi,India
文摘Many research issues have been raised in Application Layer Multicasting(ALM),such as group management,security,integrity of data,link stress,link stretch,load balancing,fault tolerance and scalability,because of the shifting of the multicast protocol from the IP layer to the application layer.To address these issues many protocols have evolved by changing their topology structure.In this paper,the POSET protocol stack is proposed,which consists of three layers,such as communication control,POSET cube,and content distribution.The novelty of this paper is the lattice-based data distribution with POSET cube architecture.The results have been compared with the existing NICE and Narada protocols.The experimental results show that the proposed POSET protocol improves throughput between 7.14%and 40%and decreases the delay between 7.69%and 25%,compared to the existing NICE protocol.
基金This paper was supported by the National Natural Science Foundation of China under Crant No. 61003282 the Funda- mental Research Funds for the Central Universities under Crant No. 2011RCI）508+1 种基金 National Basic Research Program of China under Crant No. 2009CB320505 National High Technol-ogy Research and Development Program of China under Oant No. 2011AA010704.
文摘Traditional packet classification for IPv4 involves examining standard 5-tuple of a packet header, source address, destination address, source port, destination port and protocol. With introduction of IPv6 flow label field which entails labeling the packets belonging to the same flow, packet classification can be resolved based on 3 dimensions： flow label, source address and desti- nation address. In this paper, we propose a novel approach for the 3-tuple packet classification based on flow label. Besides, by introducing a conversion engine to covert the source-destination pairs to the compound address prefixes, we put forward an algorithm called Reducing Dimension （RD） with dimension reduction capability, which combines heuristic tree search with usage of buck- ets. And we also provide an improved version of RD, called Improved RD （IRD）, which uses two mechanisms： path compression and priority tag, to optimize the perforrmnce. To evaluate our algo- rithm, extensive experiraents have been conducted using a number of synthetically generated databas- es. For the memory consumption, the two pro- posed new algorithms only consumes around 3% of the existing algorithms when the number of ill- ters increases to 10 k. And for the average search time, the search time of the two proposed algo- rithms is more than four times faster than others when the number of filters is 10 k. The results show that the proposed algorithm works well and outperforms rmny typical existing algorithms with the dimension reduction capability.
