Á¤º¸°úÇÐȸ ³í¹®Áö A : ½Ã½ºÅÛ ¹× ÀÌ·Ð
Current Result Document : 1 / 1
ÇѱÛÁ¦¸ñ(Korean Title) |
ÃÊ°í¼Ó ±¤¿ª¸Á¿¡¼ È®Àå°¡´ÉÇÑ QoS¸¦ º¸ÀåÇÏ´Â °æ·Î ¼³Á¤ |
¿µ¹®Á¦¸ñ(English Title) |
A Scalable Qos Guaranteed Routing Scheme for High Speed Wide Area Networks |
ÀúÀÚ(Author) |
±èÀ±½Ä
±è½ÂÈÆ
±èÄ¡ÇÏ
Yun Sik Kim
Seunghoon Kim
Cheeha Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 25 NO. 03 PP. 0278 ~ 0287 (1998. 03) |
Çѱ۳»¿ë (Korean Abstract) |
ÃÊ°í¼Ó ³×Æ®¿öÅ©¿¡¼ °¡Àå Áß¿äÇÑ ¼ºñ½º´Â ¸ÖƼ¹Ìµð¾î Æ®·¡ÇÈ ¼ºñ½ºÀÌ´Ù. ¸ÖƼ¹Ìµð¾î Æ®·¡ÇÈ ¼ºñ½º¸¦ À§Çؼ´Â QoS º¸Àå°ú ÀÚ¿ø ¿¹¾à ±â´ÉÀ» Á¦°øÇØ¾ß ÇÑ´Ù. ±âÁ¸ÀÇ °æ·Î ¼³Á¤ ¹æ¹ýÀº NP-CompleteÀÇ ½Ã°£ º¹Àâµµ¸¦ °¡Áö¹Ç·Î ¸ÖƼ¹Ìµð¾î Æ®·¡ÇÈ ¼ºñ½º¿¡ ÇÊ¿äÇÑ ´ÙÁß Á¦¾àµÈ °æ·Î ¼³Á¤¿¡ ½ÇÁ¦·Î »ç¿ëÇϴµ¥ ¾î·Á¿òÀÌ ÀÖ´Ù. ´õ±¸³ª, ³×Æ®¿öÅ©ÀÇ Å©±â°¡ Ä¿Áö´Â °æ¿ì¿¡´Â È¿À²ÀúÇÏ ¾øÀÌ È®Àå °¡´ÉÇÑ ¹æ¹ýÀ» ã±â ¾î·Æ´Ù. ÀÌ ³í¹®Àº ÀÓÀÇÀÇ Á¦¾àÁ¶°ÇµéÀ» ¸¸Á·½ÃÅ°´Â ÈÞ¸®½ºÆ½ ´ÙÁß Á¦¾à °æ·Î ¼³Á¤ ¹æ¹ýÀ» Á¦¾ÈÇÏ°í ÀÌ ¹æ¹ýÀ» È¿À²ÀúÇÏ ¾øÀÌ È®ÀåÇÒ ¼ö ÀÖ´Â ¹æ¹ýµµ ÇÔ²² Á¦¾ÈÇÑ´Ù. ÀÌ ÈÞ¸®½ºÆ½ ¾Ë°í¸®ÁòÀº ÃÖ¾ÇÀÇ °æ¿ì¿¡ O(n©ø)ÀÇ ½Ã°£ º¹Àâµµ¸¦ °®´Â´Ù. ±×¸®°í, ÀÌ ¾Ë°í¸®ÁòÀ» ³×Æ®¿öÅ©ÀÇ Å©±â°¡ Ä¿Á³À» ¶§¿¡µµ »ç¿ë°¡´ÉÇϵµ·Ï ´ÙÁß °èÃþÀû °æ·Î ¼³Á¤ ¹æ¹ýÀ¸·Î È®ÀåÇÏ¿©, ¿µ¿ª°£ÀÇ °æ·Î ¼³Á¤À» ¿µ¿ª ¾È¿¡¼ÀÇ °æ·Î ¼³Á¤°ú µ¿ÀÏÇÏ°Ô Àû¿ëÇÒ ¼ö ÀÖÀ½À» º¸ÀδÙ. ÀÌ ¿µ¿ª°£ÀÇ °æ·Î ¼³Á¤Àº ¼·Î ´Ù¸¥ ¹æ¹ýÀÇ °æ·Î ¼³Á¤ ¹æ¹ýÀ» »ç¿ëÇÏ´Â »óÈ£ ÀÌÁúÀûÀÎ ³×Æ®¿öÅ©°£ÀÇ °æ·Î ¼³Á¤µµ °¡´ÉÇϸç, °æ·Î ¼³Á¤ °è»êÀ» ºÐ»êÇÔÀ¸·Î½á °è»ê ½Ã°£À» ´õ ÁÙÀÏ ¼ö ÀÖ´Â ÀåÁ¡À» Á¦°øÇÑ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
In high speed networks, the most important service is multimedia application traffic service. To support multimedia traffic service, guaranteed quality of service(QoS) and resource reservation must be supported. Routing must be performed before call admission and resource reservation. The order of complexity of multiple QoS guaranteed routing is known to be NP-Complete.
In this paper, we propose a heuristic multi-constrained routing algorithm to solve the QoS guaranteed routing problem subject to any number and any kind of constraint. The order of computational complextity of the proposed algorithms is O(n©ø) in the worst case, where n is the number of nodes. We also extend the proposed algorithm to multi-layer hierarchical routing to apply it to a wide area network. We also present the way of mapping original multi-domain topology graph into a simplified topology graph, and solve inter-domain routing problem seamless as an intra-domain routing. This inter-domain routing scheme enables routing between heterogeneous domains, and makes calcuation more efficient. |
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|