http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Maximization of Path Reliabilities in Overlay Multicast Trees for Realtime Internet Service
이정훈(Jung H. Lee),이채영(Chae Y. Lee) 한국경영과학회 2008 韓國經營科學會誌 Vol.33 No.2
Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members’ sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.
Delay Guaranteed Bandwidth-Efficient Multicast Routing in Wireless Multi-hop Networks
Hee-Seok Sohn(손희석),Chae Y. Lee(이채영) 한국경영과학회 2016 韓國經營科學會誌 Vol.41 No.2
Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol:end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.
광마이크로셀 이동통신 시스템의 균등부하를 위한 셀단위 핸드오프 순서결정
이채영,장세헌 한국경영과학회 2001 한국경영과학회지 Vol.26 No.2
This paper considers the scheduling of cell-based handoffs to balance the traffic in a fiber-optic microcellular system. In the system depending on the order of cell based handoff, periodical balancing of the traffic among microcells can be achieve. The cell based handoff problem is formulated as a dynamic programming and the computational complexity is analyzed. Since the scheduling problem require real time solution, heuristic algorithms are proposed and the computational results are discussed.