RISS 검색 - 국내학술지논문 상세보기

다국어 입력

あぁかがさざただなはばぱまやゃらわゎんいぃきぎしじちぢにひびぴみりうぅくぐすずつづっぬふぶぷむゆゅるえぇけげせぜてでねへべぺめれおぉこごそぞとどのほぼぽもよょろを

アァカサザタダナハバパマヤャラワヮンイィキギシジチヂニヒビピミリウゥクグスズツヅッヌフブプムユュルエェケゲセゼテデヘベペメレオォコゴソゾトドノホボポモヨョロヲ ―

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)

中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.

ㅥ ㅦ ㅧ ㅨ ㅩ ㅪ ㅫ ㅬ ㅭ ㅮ ㅯ ㅰ ㅱ ㅲ ㅳ ㅴ ㅵ ㅶ ㅷ ㅸ ㅹ ㅺ ㅻ ㅼ ㅽ ㅾ ㅿ ㆀ ㆁ ㆂ ㆃ ㆄ ㆅ ㆆ ㆇ ㆈ ㆉ ㆊ ㆋ ㆌ ㆍ ㆎ

Α Β Γ Δ Ε Ζ Η Θ Ι Κ Λ Μ Ν Ξ Ο Π Ρ Σ Τ Υ Φ Χ Ψ Ω α β γ δ ε ζ η θ ι κ λ μ ν ξ ο π ρ σ τ υ φ χ ψ ω

á à Á À é è É È ç Ç ê

Ä Ö Ü ä ö ü ß

ְ ֳ ֲ ֱ ָ ַ ֵ ֶ ִ ֹ ּ ֻ ׂ ׁ ּ פ ם ן ו ט א ר ק ף ך ל ח י ע כ ג ד ש ץ ת צ מ נ ה ב

‘ ’ “ ” 〔〕〈〉「」『』【】＂（）［］｛｝

± × ÷ ≠ ≤ ≥ ∞ ∴ ♂ ♀ ∠ ⊥ ⌒ ∂ ∇ ≡ ≒ ≪ ≫ √ ∽ ∝ ∵ ∫ ∬ ∈ ∋ ⊆ ⊇ ⊂ ⊃ ∪ ∩ ∧ ∨ ￢ ⇒ ⇔ ∀ ∃ ∮ ∑ ∏ ＋－＜＝＞

、。 · ‥ … ¨ 〃 ― ∥ ＼ ∼ ´ ～ ˇ ˘ ˝ ˚ ˙ ¸ ˛ ¡ ¿ ː ！＇，．／：；？＾＿｀｜

½ ⅓ ⅔ ¼ ¾ ⅛ ⅜ ⅝ ⅞ ¹ ² ³ ⁴ ⁿ ₁ ₂ ₃ ₄

Æ Ð Ħ Ĳ Ł Ø Œ Þ Ŧ Ŋ æ đ ð ħ ı ĳ ĸ ŀ ł ø œ ß þ ŧ ŋ ŉ

А Б В Г Д Е Ё Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я а б в г д е ё ж з и й к л м н о п р с т у ф х ц ч ш щ ъ ы ь э ю я

′ ″ ℃ Å ￠￡￥ ¤ ℉ ‰ ＄％Ｆ￦㎕㎖㎗ ℓ ㎘㏄㎣㎤㎥㎦㎙㎚㎛㎜㎝㎞㎟㎠㎡㎢㏊㎍㎎㎏㏏㎈㎉㏈㎧㎨㎰㎱㎲㎳㎴㎵㎶㎷㎸㎹㎀㎁㎂㎃㎄㎺㎻㎽㎾㎿㎐㎑㎒㎓㎔ Ω ㏀㏁㎊㎋㎌㏖㏅㎭㎮㎯㏛㎩㎪㎫㎬㏝㏐㏓㏃㏉㏜㏆

§ ※ ☆ ★ ○ ● ◎ ◇ ◆ □ ■ △ ▽ → ← ↑ ↓ ↔ 〓 ◁ ◀ ▷ ▶ ♤ ♠ ♡ ♥ ♧ ♣ ⊙ ◈ ▣ ◐ ◑ ▒ ▤ ▥ ▨ ▧ ▦ ▩ ♨ ☏ ☎ ☜ ☞ ¶ † ‡ ↕ ↗ ↙ ↖ ↘ ♭ ♩ ♪ ♬ ㉿㈜ № ㏇ ™ ㏂㏘ ℡ ＃＆＊＠ ª º

ⅰ ⅱ ⅲ ⅳ ⅴ ⅵ ⅶ ⅷ ⅸ ⅹ Ⅰ Ⅱ Ⅲ Ⅳ Ⅴ Ⅵ Ⅶ Ⅷ Ⅸ Ⅹ

ا ب ت ث ج ح خ د ذ ر ز س ش ص ض ط ظ ع غ ف ق ک ل م ن ه و ی

닫기

최근 검색 목록
전체삭제 닫기

RISS 인기검색어

회선 교환망에서 MFDL 경로를 이용한 Flood Search 알고리즘 = Flood Search Algorithm with MFDL Path in Circuit-Switched Networks

한글로보기

https://www.riss.kr/link?id=A106726853

저자

박영철 ; 이상철 ; 은종관
발행기관
한국통신학회
학술지명
한국통신학회논문지(The Journal of the KICS)
권호사항

Vol.18 No.3 [1993]
발행연도
1993
작성언어
Korean
등재정보
KCI등재
자료형태
학술저널
발행기관 URL
http://kics.or.kr
수록면

360-371(12쪽)
제공처
ScienceON, DBpia
소장기관
- 호서대학교(아산) 학술지원과

0
상세조회
0
다운로드
0
내보내기

서지정보 열기

부가정보

다국어 초록 (Multilingual Abstract)

Flood search algorithm is known to be an effective routing mechanism for tactical application, since it provides high degree of survivability and robustness. But it is known that it has significant drawbacks with respect to the network efficiency [1]. We consider a tactical circuit-switched grid network with a maximum of four links and two priority classes of voice traffic, Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of the circuit-switched network without increasing the call set-up time and processor loading of the algorithm.

번역하기

Flood search algorithm is known to be an effective routing mechanism for tactical application, since it provides high degree of survivability and robustness. But it is known that it has significant drawbacks with respect to the network efficiency [1]....

Flood search algorithm is known to be an effective routing mechanism for tactical application, since it provides high degree of survivability and robustness. But it is known that it has significant drawbacks with respect to the network efficiency [1]. We consider a tactical circuit-switched grid network with a maximum of four links and two priority classes of voice traffic, Using the minimum first-derivative length (MFDL) path, we improve the blocking probability performance of the circuit-switched network without increasing the call set-up time and processor loading of the algorithm.