• Title/Summary/Keyword: Scorched-Node

Search Result 3, Processing Time 0.018 seconds

접속료 산정을 위한 LRIC 모형 연구

  • 민완기;장송자
    • Proceedings of the Korea Technology Innovation Society Conference
    • /
    • 2002.05b
    • /
    • pp.45-59
    • /
    • 2002
  • 최근 들어 접속료가 통신시장의 주요 핵심 이슈로 제기되고 있다. 이에 본 연구는 접속료를 결정하는 다양한 접속료 산정모형 검토를 통해 LRIC 모형이 가장 합리적인 접속료 산정모형임을 밝혀냈다. 또한 LRIC 방식을 도입하기 위해서는 현실 적용이 수월한 Bottom-Up 방식과 Scorched-Node 방식을 가정하여 망 원가를 산정하는 것이 중요하다고 분석되었다.

  • PDF

A Network redesigning methodology for LLU system (가입자선로 세분화를 위한 가입자망 재설계방법)

  • 민대홍
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.10a
    • /
    • pp.446-449
    • /
    • 2001
  • A LLU system is developed for efficient use of existing local loop. By this system, new entrant ran use the local loop indifferently comparing with incumbent telecommunications operator. To implement the LLU, bottom-up typed LRIC model by network redesigning was accepted for costing system in Korea. In this paper, local loop redesigning methodology is presented to build a bottom-up typed LRIC model.

  • PDF

A DTN Routing Protocol for Communications in Post-Disaster Scorched Earth Situations (재난 후 초토화 상황에서 통신을 위한 DTN 라우팅 프로토콜)

  • Yoo, Dae-Hun;Choi, Woong-Chul
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.6
    • /
    • pp.81-92
    • /
    • 2014
  • In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.