(A) quickest routing procedure for a virtual circuit data network with multicast capability멀티캐스트 (Multicast)가 가능한 가상회선 데이타 망에서의 전송시간 최소화 경로탐색
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Sung, Chang-Sup | - |
| dc.contributor.advisor | 성창섭 | - |
| dc.contributor.author | Heo, Jeong-Yun | - |
| dc.contributor.author | 허정윤 | - |
| dc.date.accessioned | 2011-12-14T04:18:36Z | - |
| dc.date.available | 2011-12-14T04:18:36Z | - |
| dc.date.issued | 1994 | - |
| dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=69482&flag=dissertation | - |
| dc.identifier.uri | http://hdl.handle.net/10203/41439 | - |
| dc.description | 학위논문(석사) - 한국과학기술원 : 산업공학과, 1994.2, [ 35 p. ] | - |
| dc.description.abstract | This thesis considers a flow problem of finding a quickest multicast routing for two commodities on a virtual circuit network where two sources should inform distinctly different messages to all other nodes. The objective is to find a routing that minimizes the maximum transmission time. It is assumed in the problem that the data can not be partitioned into smaller parts(i.e., nonbifurcated routing). Two heuristic algorithms are suggested and tested for their effectivenesses with several numerical examples. | eng |
| dc.language | eng | - |
| dc.publisher | 한국과학기술원 | - |
| dc.title | (A) quickest routing procedure for a virtual circuit data network with multicast capability | - |
| dc.title.alternative | 멀티캐스트 (Multicast)가 가능한 가상회선 데이타 망에서의 전송시간 최소화 경로탐색 | - |
| dc.type | Thesis(Master) | - |
| dc.identifier.CNRN | 69482/325007 | - |
| dc.description.department | 한국과학기술원 : 산업공학과, | - |
| dc.identifier.uid | 000923571 | - |
| dc.contributor.localauthor | Sung, Chang-Sup | - |
| dc.contributor.localauthor | 성창섭 | - |
- Appears in Collection
- IE-Theses_Master(석사논문)
- Files in This Item
- There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.