• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2010 Fiscal Year Final Research Report

A study on formulation and efficient algorithms for an optimization problem in the Internet monitoring

Research Project

  • PDF
Project/Area Number 20700010
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionKyoto University

Principal Investigator

ZHAO Liang  Kyoto University, 大学院・情報学研究科, 講師 (90344902)

Project Period (FY) 2008 – 2010
Keywords組み合わせ最適化 / 頂点被覆 / 支配集合問題 / ビーコン配置問題
Research Abstract

This study proposed "L-beacon" (where L is a nonnegative integer to decide the monitorable area of a beacon) for monitoring links in the Internet and formulated the link monitoring problem by an optimization problem for finding a minimum set of L-beacons. A very efficient algorithm, the Sieve Method, is given for solving this problem, as well as the DualSieve Method for the dual problem. The efficiency and applications of both algorithms are shown by experiments with large-scale instances. From the experiment results, it is shown that L=4, 5 are reasonable for the Internet.

  • Research Products

    (7 results)

All 2011 2010 2009 2008

All Presentation (7 results)

  • [Presentation] A practical speed-up technique for A* algorithms (Abstract)2011

    • Author(s)
      Liang Zhao, Pipaporn Enumthurapojn, Hiroshi Nagamochi
    • Organizer
      4th Annual Meeting of Asian Association for Algorithms and Computation (AAAC 2011)
    • Place of Presentation
      HsinChu, Taiwan.
    • Year and Date
      20110416-20110417
  • [Presentation] An A* algorithm framework for the point-to-point time-dependent shortest path problem, China-Japan Joint Conference on Computational Geometry2010

    • Author(s)
      Tatsuya Ohshima, Pipaporn Eumthurapojn, Liang Zhao, Hiroshi Nagamochi
    • Organizer
      Graphs and Applications
    • Place of Presentation
      Dalian, China.
    • Year and Date
      20101103-20101116
  • [Presentation] On An Edge-Dominating Problem in Networks2009

    • Author(s)
      Liang Zhao, Jaeseong Gim, Hiroshi Nagamochi
    • Organizer
      情報処理学会 第6回ネットワーク生態学シンポジウム
    • Place of Presentation
      つくば産業技術研究所
    • Year and Date
      2009-12-18
  • [Presentation] Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract)2009

    • Author(s)
      Jiexun Wang, Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
    • Organizer
      Intl.Conf.Computational Intelligence and Software Engineering (CiSE) 2009
    • Place of Presentation
      Wuhan, China.
    • Year and Date
      2009-12-13
  • [Presentation] Efficient Approximate Algorithms for the Beacon Placement and its Dual Problem (Abstract)2009

    • Author(s)
      Jiexun Wang, Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
    • Organizer
      Korea-Japan Joint Workshop WAAC 2009
    • Place of Presentation
      Seoul, Korea.
    • Year and Date
      2009-07-04
  • [Presentation] An efficient algorithm for large-scale beacon placement problem2009

    • Author(s)
      Jaeseong Gim, Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
    • Organizer
      電子情報通信学会2009年総合大会COMP学生シンポジウム
    • Place of Presentation
      愛媛大学
    • Year and Date
      2009-03-19
  • [Presentation] Security-aware beacon based network monitoring2008

    • Author(s)
      Masahiro Sasaki, Liang Zhao, Hiroshi Nagamochi
    • Organizer
      11th IEEE Intl.Conference on Communication Systems 2008
    • Place of Presentation
      Guangzhou, China.
    • Year and Date
      2008-11-19

URL: 

Published: 2012-02-13   Modified: 2016-04-21  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi