Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Zhenghu Gong"'
Publikováno v:
IEEE Transactions on Computers. 65:3304-3317
MapReduce has become a prevalent programming model for building data processing applications in the cloud. While being widely used, existing MapReduce schedulers still suffer from an issue known as partitioning skew, where the output of map tasks is
Publikováno v:
International Journal of Network Management. 26:224-244
MapReduce has become a popular model for large-scale data processing in recent years. Many works on MapReduce scheduling e.g., load balancing and deadline-aware scheduling have emphasized the importance of predicting workload received by individual r
Publikováno v:
Concurrency and Computation: Practice and Experience. 28:3803-3813
Many recent studies show that data center networks usually mix with a large amount of latency-agnostic background flows and a large number of latency-sensitive flows. The former, although contributing most of the traffic, is deadline-agnostic, while
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 12:4998-5003
Publikováno v:
Journal of Computational and Theoretical Nanoscience. 12:3050-3057
Publikováno v:
IEICE Transactions on Information and Systems. :2071-2081
Publikováno v:
SIGCOMM Posters and Demos
This paper presents HERO, a system for accelerating high performance data center applications by integrating hybrid electrical and optical multicast. We built a prototype and developed a flow-level simulator to evaluate the performance of HERO. Exper
Publikováno v:
Journal of Central South University. 20:3142-3149
In recent years, using message ferries as mechanical carriers of data has been shown to be an effective way to collect information in sparse wireless sensor networks. As the sensors are far away from each other in such highly partitioned scenario, a
Publikováno v:
Peer-to-Peer Networking and Applications. 8:642-650
Network coding has emerged as a promising approach for peer-to-peer converged ubiquitous networks to increase network capacity and solve the block reconciliation problem. However, peer-to-peer systems with network coding suffer a severe security thre
Publikováno v:
Journal of Central South University. 20:440-450
The inherent selfishness of each node for the enhancement of message successful delivery ratio and the network overall performance improvement are reflected in the contradiction relationship of competition and cooperation in delay/disruption tolerant