A solution is imperatively expected to meet the efficient contention resolution schemes for managing simultaneous access requests to the communication resources on the Network on Chip (NoC). Based on the ideas of conf...A solution is imperatively expected to meet the efficient contention resolution schemes for managing simultaneous access requests to the communication resources on the Network on Chip (NoC). Based on the ideas of conflict-free transmission, priority-based service, and dynamic self-adaptation to loading, this paper presents a novel scheduling algorithm for Medium Access Control (MAC) in NoC with the researches of the communication structure features of 2D mesh. The algorithm gives priority to guarantee the Quality of Service (QoS) for local input port as well as dynamic adjustment of the performance of the other ports along with input load change. The theoretical model of this algorithm is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the system. Simulated experiments are conducted to test the accuracy of the model. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments. Further more, the analytical findings of the system performance demonstrate that the algorithm enables effectively strengthen the fairness and stability of data transmissions in NoC.展开更多
The IEEE 802.15.4 standard utilizes the CSMA-CA mechanism to control nodes’ access to the shared wireless communication medium. CSMA-CA implements the Binary Exponential Backoff (BEB) algorithm by which a node refrai...The IEEE 802.15.4 standard utilizes the CSMA-CA mechanism to control nodes’ access to the shared wireless communication medium. CSMA-CA implements the Binary Exponential Backoff (BEB) algorithm by which a node refrains from sending any packet before the expiry of its backoff period. After that, the node is required to sense the medium for two successive time slots to assert that the medium is clear from any ongoing transmissions (this is referred to as Clear Channel Assessment (CCA)). Upon finding the medium busy, the node doubles its backoff period and repeats that process. While effective in reducing the likelihood of collisions, this approach takes no measures to preserve the priorities among the nodes contending to access the medium. In this paper we propose the Priority-Based BEB (PB-BEB) algorithm in which we enhance BEB such that nodes’ priority is preserved. We provide a simulation study to examine the performance of PB-BEB. Our simulations show that the latter not only outperforms BEB in terms of fairness, but also show promising results in terms other parameters like channel utilization, reliability, and power conservation.展开更多
In order to have a better support of differentiated service, we propose Priority-based mixed burst assembly, in which packets of different priorities are assembled in a burst with an assigned proportion, and the prior...In order to have a better support of differentiated service, we propose Priority-based mixed burst assembly, in which packets of different priorities are assembled in a burst with an assigned proportion, and the priorities are lined in an ascending order in a burst from head to tail. Simulation results show that the proposed scheme performs very well in terms of latency and packet loss probability.展开更多
An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the obj...An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.展开更多
The concurrent presence of different types of traffic in multimedia applications might aggravate a burden on the underlying data network, which is bound to affect the transmission quality of the specified traffic. Rec...The concurrent presence of different types of traffic in multimedia applications might aggravate a burden on the underlying data network, which is bound to affect the transmission quality of the specified traffic. Recently, several proposals for fulfilling the quality of service(QoS) guarantees have been presented. However, they can only support coarse-grained QoS with no guarantee of throughput, jitter, delay or loss rate for different applications. To address these more challenging problems, an adaptive scheduling algorithm for Parallel data Processing with Multiple Feedback(PPMF) queues based on software defined networks(SDN) is proposed in this paper, which can guarantee the quality of service of high priority traffic in multimedia applications. PPMF combines the queue bandwidth feedback mechanism to realise the automatic adjustment of the queue bandwidth according to the priority of the packet and network conditions, which can effectively solve the problem of network congestion that has been experienced by some queues for a long time. Experimental results show PPMF significantly outperforms other existing scheduling approaches in achieving 35--80% improvement on average time delay by adjusting the bandwidth adaptively, thus ensuring the transmission quality of the specified traffic and avoiding effectively network congestion.展开更多
Polling system models have a wide range of important applications including time-sharing computer systems, industrial control, communications, and computer networks. In this paper, we propose a two-class priority- bas...Polling system models have a wide range of important applications including time-sharing computer systems, industrial control, communications, and computer networks. In this paper, we propose a two-class priority- based polling system that uses gated and exhaustive services to achieve the priority-based scheme. This model is set up according to the method of the imbedded Markov chain theory and the generation function and explicitly analyzes key system performance characteristics including mean queue length, cyclic time, and throughput. Theoretical and simulation results are identical and demonstrate the efficiency of the model.展开更多
基金Supported by the National Natural Science Foundation of China(No.61072079)
文摘A solution is imperatively expected to meet the efficient contention resolution schemes for managing simultaneous access requests to the communication resources on the Network on Chip (NoC). Based on the ideas of conflict-free transmission, priority-based service, and dynamic self-adaptation to loading, this paper presents a novel scheduling algorithm for Medium Access Control (MAC) in NoC with the researches of the communication structure features of 2D mesh. The algorithm gives priority to guarantee the Quality of Service (QoS) for local input port as well as dynamic adjustment of the performance of the other ports along with input load change. The theoretical model of this algorithm is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the system. Simulated experiments are conducted to test the accuracy of the model. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments. Further more, the analytical findings of the system performance demonstrate that the algorithm enables effectively strengthen the fairness and stability of data transmissions in NoC.
文摘The IEEE 802.15.4 standard utilizes the CSMA-CA mechanism to control nodes’ access to the shared wireless communication medium. CSMA-CA implements the Binary Exponential Backoff (BEB) algorithm by which a node refrains from sending any packet before the expiry of its backoff period. After that, the node is required to sense the medium for two successive time slots to assert that the medium is clear from any ongoing transmissions (this is referred to as Clear Channel Assessment (CCA)). Upon finding the medium busy, the node doubles its backoff period and repeats that process. While effective in reducing the likelihood of collisions, this approach takes no measures to preserve the priorities among the nodes contending to access the medium. In this paper we propose the Priority-Based BEB (PB-BEB) algorithm in which we enhance BEB such that nodes’ priority is preserved. We provide a simulation study to examine the performance of PB-BEB. Our simulations show that the latter not only outperforms BEB in terms of fairness, but also show promising results in terms other parameters like channel utilization, reliability, and power conservation.
基金This work is partially supported by the National Natural Science Foundation of China under contract 69990540.
文摘In order to have a better support of differentiated service, we propose Priority-based mixed burst assembly, in which packets of different priorities are assembled in a burst with an assigned proportion, and the priorities are lined in an ascending order in a burst from head to tail. Simulation results show that the proposed scheme performs very well in terms of latency and packet loss probability.
基金supported by the National Natural Science Foundation of China(6083500460775047+4 种基金60974048)the National High Technology Research and Development Program of China(863 Program)(2007AA0422442008AA04Z214)the Natural Science Foundation of Hunan Province(09JJ9012)Scientific Research Fund of Hunan Provincial Education Department(08C337)
文摘An improved differential evolution（IDE）algorithm that adopts a novel mutation strategy to speed up the convergence rate is introduced to solve the resource-constrained project scheduling problem（RCPSP）with the objective of minimizing project duration Activities priorities for scheduling are represented by individual vectors and a senal scheme is utilized to transform the individual-represented priorities to a feasible schedule according to the precedence and resource constraints so as to be evaluated.To investigate the performance of the IDE-based approach for the RCPSP,it is compared against the meta-heuristic methods of hybrid genetic algorithm（HGA）,particle swarm optimization（PSO） and several well selected heuristics.The results show that the proposed scheduling method is better than general heuristic rules and is able to obtain the same optimal result as the HGA and PSO approaches but more efficient than the two algorithms.
基金supported by National Key Basic Research Program of China(973 Program)under grant no.2012CB315802National Natural Science Foundation of China under grant no.61671081 and no.61132001Prospective Research on Future Networks of Jiangsu Future Networks Innovation Institute under grant no.BY2013095-4-01
文摘The concurrent presence of different types of traffic in multimedia applications might aggravate a burden on the underlying data network, which is bound to affect the transmission quality of the specified traffic. Recently, several proposals for fulfilling the quality of service(QoS) guarantees have been presented. However, they can only support coarse-grained QoS with no guarantee of throughput, jitter, delay or loss rate for different applications. To address these more challenging problems, an adaptive scheduling algorithm for Parallel data Processing with Multiple Feedback(PPMF) queues based on software defined networks(SDN) is proposed in this paper, which can guarantee the quality of service of high priority traffic in multimedia applications. PPMF combines the queue bandwidth feedback mechanism to realise the automatic adjustment of the queue bandwidth according to the priority of the packet and network conditions, which can effectively solve the problem of network congestion that has been experienced by some queues for a long time. Experimental results show PPMF significantly outperforms other existing scheduling approaches in achieving 35--80% improvement on average time delay by adjusting the bandwidth adaptively, thus ensuring the transmission quality of the specified traffic and avoiding effectively network congestion.
基金supported by the National Natural Science Foundation of China (Nos. 61072079/F010201 and 61461054)
文摘Polling system models have a wide range of important applications including time-sharing computer systems, industrial control, communications, and computer networks. In this paper, we propose a two-class priority- based polling system that uses gated and exhaustive services to achieve the priority-based scheme. This model is set up according to the method of the imbedded Markov chain theory and the generation function and explicitly analyzes key system performance characteristics including mean queue length, cyclic time, and throughput. Theoretical and simulation results are identical and demonstrate the efficiency of the model.
