Live video streaming becomes one of the most popular internet activities in the recent years. Along with its popularity, the problems such as scalability, availability and low-latency are still the maindrawbacks of the peer-to-peer (P2P) live video streaming. The DHT-aided chunk-driven overlay (DCO)[3] tried to overcome these problems by using the Distributed Hash Table (DHT) in live video streaming. Even the performance of DCO is better than other traditional works such as tree-based system, in termsof vulnerability to churn, and mesh-based system, in terms of high delay and message overhead, thereare some problems in DCO which need to be solved. The coordinator is easy to get overloaded by manyrequests because one coordinator is responsible for storing the chunk index of several segments. Moreover, the number of nodes that the video server is responsible for sending the video segment toare not clearly defined. To solve these problems, in this paper, a more efficient approach of using thecoordinator nodes is proposed. Furthermore, the threshold is carefully calculated in order to use theserver capacity efficiently. The server is only responsible for sending the video segment to the thresholdnodes. After that, the video segment will be shared among nodes in the network until every node receivesthe video segment. The performance evaluation results show that our work is more efficient than DCO,and the server capacity can be used efficiently if the threshold is careful defined.