DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이정훈 | ko |
dc.contributor.author | 이채영 | ko |
dc.date.accessioned | 2013-03-06T17:44:33Z | - |
dc.date.available | 2013-03-06T17:44:33Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2008-06 | - |
dc.identifier.citation | 한국경영과학회지, v.33, no.2, pp.103 - 114 | - |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | http://hdl.handle.net/10203/87824 | - |
dc.description.abstract | 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. | - |
dc.language | Korean | - |
dc.publisher | 한국경영과학회 | - |
dc.title | 실시간 인터넷 서비스를 위한 오브레이 말티케스트 트리의 패스 신뢰성 최대화 | - |
dc.title.alternative | Maximization of Path Reliabilities in Overlay Multicast Trees for Realtime Internet Service | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.citation.volume | 33 | - |
dc.citation.issue | 2 | - |
dc.citation.beginningpage | 103 | - |
dc.citation.endingpage | 114 | - |
dc.citation.publicationname | 한국경영과학회지 | - |
dc.identifier.kciid | ART001265283 | - |
dc.contributor.localauthor | 이채영 | - |
dc.contributor.nonIdAuthor | 이정훈 | - |
dc.subject.keywordAuthor | Overlay Multicast | - |
dc.subject.keywordAuthor | Multicast Tree | - |
dc.subject.keywordAuthor | Path Reliability | - |
dc.subject.keywordAuthor | Tabu Search | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.