Updated on 2023/02/05

写真a

 
UCHIDA, Masato
 
Scopus Paper Info  
Paper Count: 0  Citation Count: 0  h-index: 4

Citation count denotes the number of citations in papers published for a particular year.

Affiliation
Faculty of Science and Engineering, School of Fundamental Science and Engineering
Job title
Professor
Homepage URL

Concurrent Post

  • Faculty of Science and Engineering   Graduate School of Fundamental Science and Engineering

Research Institute

  • 2022
    -
    2024

    Waseda Research Institute for Science and Engineering   Concurrent Researcher

Education

  • 1999.04
    -
    2001.03

    Hokkaido University   Graduate School of Engineering   Systems and Information Engineering  

  • 1995.04
    -
    1999.03

    Hokkaido University   School of Engineering   Department of Information Engineering  

Degree

  • Hokkaido University   Master of Engineering

  • Hokkaido University   Doctor of Philosophy

Research Experience

  • 2017.04
    -
    Now

    Waseda University   School of Fundamental Science and Engineering

  • 2016.04
    -
    2017.03

    Chiba Institute of Technology Faculty of Engineering, Department of Information and Communication Systems Engineering

  • 2015.04
    -
    2016.03

    Chiba Institute of Technology   Faculty of Engineering, Department of Electrical, Electronics and Computer Engineering

  • 2012.04
    -
    2015.03

    Chiba Institute of Technology   Faculty of Engineering, Department of Electrical, Electronics and Computer Engineering

  • 2007.04
    -
    2012.03

    Kyushu Institute of Technology   Network Design Research Center

  • 2005.08
    -
    2007.03

    Kyushu Institute of Technology   Network Design Research Center

  • 2001.04
    -
    2005.07

    日本電信電話株式会社   NTT情報流通基盤総合研究所

▼display all

Professional Memberships

  •  
     
     

    The Institute of Electrical and Electronics Engineers (IEEE)

  •  
     
     

    Association for Computing Machinery

  •  
     
     

    情報処理学会

  •  
     
     

    電子情報通信学会

 

Research Areas

  • Information security

Research Interests

  • データサイエンス/サイバーセキュリティ

Papers

  • Objection!: Identifying Misclassified Malicious Activities with XAI.

    Koji Fujita, Toshiki Shibahara, Daiki Chiba 0001, Mitsuaki Akiyama, Masato Uchida

    ICC     2065 - 2070  2022  [Refereed]

    DOI

    Scopus

  • Candidate-Label Learning: A Generalization of Ordinary-Label Learning and Complementary-Label Learning.

    Yasuhiro Katsura, Masato Uchida

    SN Computer Science   2 ( 4 ) 288 - 288  2021.07  [Refereed]

    DOI

    Scopus

  • Riccati equation as topology-based model of computer worms and discrete SIR model with constant infectious period

    Daisuke Satoh, Masato Uchida

    Physica A: Statistical Mechanics and its Applications   566   125606 - 125606  2021.03  [Refereed]

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Time-series Measurement of Parked Domain Names and Their Malicious Uses

    Takayuki TOMATSURI, Daiki CHIBA, Mitsuaki AKIYAMA, Masato UCHIDA

    IEICE Transactions on Communications   E104-B ( 7 ) 770 - 780  2021

    DOI

  • Auto-creation of Android Malware Family Tree.

    Kazuya Nomura, Daiki Chiba 0001, Mitsuaki Akiyama, Masato Uchida

    ICC 2021 - IEEE International Conference on Communications(ICC)     1 - 6  2021  [Refereed]

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • Analysis of Route Announcements of Unassigned IP Addresses.

    Kentaro Goto, Akira Shibuya, Masayuki Okada, Masato Uchida

    IEEE 45th Annual Computers, Software, and Applications Conference(COMPSAC)     1411 - 1416  2021  [Refereed]

    DOI

    Scopus

  • Behind The Mask: Masquerading The Reason for Prediction.

    Tomohiro Koide, Masato Uchida

    IEEE 45th Annual Computers, Software, and Applications Conference(COMPSAC)     475 - 481  2021  [Refereed]

    DOI

    Scopus

  • Auto-creation of Robust Android Malware Family Trees.

    Kazuya Nomura, Daiki Chiba 0001, Mitsuaki Akiyama, Masato Uchida

    Journal of Information Processing   29   801 - 811  2021  [Refereed]

    DOI

  • A Comprehensive Measurement of Cloud Service Abuse.

    Naoki Fukushi, Daiki Chiba 0001, Mitsuaki Akiyama, Masato Uchida

    Journal of Information Processing   29   93 - 102  2021  [Refereed]

    DOI

    Scopus

  • Exploration into Gray Area: Toward Efficient Labeling for Detecting Malicious Domain Names.

    Naoki Fukushi, Daiki Chiba 0001, Mitsuaki Akiyama, Masato Uchida

    IEICE Transactions on Communications   103-B ( 4 ) 375 - 388  2020.04  [Refereed]

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Bridging Ordinary-Label Learning and Complementary-Label Learning.

    Yasuhiro Katsura, Masato Uchida

    CoRR   abs/2002.02158  2020  [Refereed]

  • Design of Typing Skills Feedback System for Behavior Change.

    Tokio Takahashi, Masaru Honjo, Akio Yoneyama, Masato Uchida

    IEEE International Conference on Teaching, Assessment, and Learning for Engineering(TALE)     678 - 683  2020  [Refereed]

    DOI

    Scopus

  • Tsallis Entropy Based Labelling.

    Kentaro Goto, Masato Uchida

    19th IEEE International Conference on Machine Learning and Applications(ICMLA)     33 - 40  2020  [Refereed]

    DOI

    Scopus

  • Usage Prediction and Effectiveness Verification of App Restriction Function for Smartphone Addiction.

    Katsuki Yasudomi, Toshitaka Hamamura, Masaru Honjo, Akio Yoneyama, Masato Uchida

    22nd IEEE International Conference on E-health Networking(HealthCom)     1 - 8  2020  [Refereed]

    DOI

    Scopus

    5
    Citation
    (Scopus)
  • A Large-scale Analysis of Cloud Service Abuse.

    Naoki Fukushi, Daiki Chiba 0001, Mitsuaki Akiyama, Masato Uchida

    8th IEEE Conference on Communications and Network Security(CNS)     1 - 9  2020  [Refereed]

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Bridging Ordinary-Label Learning and Complementary-Label Learning.

    Yasuhiro Katsura, Masato Uchida

    Proceedings of The 12th Asian Conference on Machine Learning(ACML)     161 - 176  2020  [Refereed]

  • Time-series Measurement of Parked Domain Names.

    Takayuki Tomatsuri, Daiki Chiba 0001, Mitsuaki Akiyama, Masato Uchida

    IEEE Global Communications Conference(GLOBECOM)     1 - 6  2020  [Refereed]

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • Exploration into Gray Area: Efficient Labeling for Malicious Domain Name Detection.

    Naoki Fukushi, Daiki Chiba 0001, Mitsuaki Akiyama, Masato Uchida

    43rd IEEE Annual Computer Software and Applications Conference     770 - 775  2019  [Refereed]

    DOI

    Scopus

    4
    Citation
    (Scopus)
  • Predicting Network Outages Based on Q-Drop in Optical Network.

    Yohei Hasegawa, Masato Uchida

    43rd IEEE Annual Computer Software and Applications Conference     258 - 263  2019  [Refereed]

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Optimal Hand Sign Selection Using Information Theory for Custom Sign-Based Communication.

    Tokio Takahashi, Masato Uchida

    43rd IEEE Annual Computer Software and Applications Conference     610 - 615  2019  [Refereed]

    DOI

    Scopus

  • Accurate OD Traffic Matrix Estimation Based on Resampling of Observed Flow Data.

    Simon Kase, Masato Tsuru, Masato Uchida

    Asia-Pacific Signal and Information Processing Association Annual Summit and Conference(APSIPA)     1574 - 1579  2018  [Refereed]

    DOI

    Scopus

  • Verification of charge and discharge system composed of multiple lithium ion batteries

    Nobuo Satoh, Atsushi Kosugi, Hiroshi Arai, Masato Uchida

    2017 20th International Conference on Electrical Machines and Systems (ICEMS)    2017.08

    DOI

  • Human error tolerant anomaly detection based on time-periodic packet sampling.

    Masato Uchida

    Knowledge Based Systems   106   242 - 250  2016.08  [Refereed]

     View Summary

    This paper focuses on an anomaly detection method that uses a baseline model describing the normal behavior of network traffic as the basis for comparison with the audit network traffic. In the anomaly detection method, an alarm is raised if a pattern in the current network traffic deviates from the baseline model. The baseline model is often trained using normal traffic data extracted from traffic data for which all instances (i.e., packets) are manually labeled by human experts in advance as either normal or anomalous. However, since humans are fallible, some errors are inevitable in labeling traffic data. Therefore, in this paper, we propose an anomaly detection method that is tolerant to human errors in labeling traffic data. The fundamental idea behind the proposed method is to take advantage of the lossy nature of packet sampling for the purpose of correcting/preventing human errors in labeling traffic data. By using real traffic traces, we show that the proposed method can better detect anomalies regarding TCP SYN packets than the method that relies only on human labeling. (C) 2016 Elsevier B.V. All rights reserved.

    DOI

    Scopus

    4
    Citation
    (Scopus)
  • Recent Trends and Some Lessons for Serious Network Failures in Japan.

    Masato Uchida

    2015 International Conference on Intelligent Networking and Collaborative Systems(INCoS)     478 - 485  2015  [Refereed]

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • Modeling User Behavior in P2P Data Storage System.

    Masato Uchida, Hideaki Iiduka, Isao Sugino

    IEICE Transactions on Communications   98-B ( 1 ) 33 - 41  2015.01  [Refereed]

     View Summary

    In recent years, there has been growing interest in systems for sharing resources, which were originally used for personal purposes by individual users, among many unspecified users via a network. An example of such systems is a peer-to-peer (P2P) data storage system that enables users to share a portion of unused space in their own storage devices among themselves. In a recent paper on a P2P data storage system, the user behavior model was defined based on supply and demand functions that depend only on the storage space unit price in a virtual marketplace. However, it was implicitly assumed that other factors, such as unused space of storage devices possessed by users and additional storage space asked by users, did not affect the characteristics of the supply and demand functions. In addition, it was not clear how the values of parameters used in the user behavior model were determined. Therefore, in this paper, we modify the supply and demand functions and determine the values of their parameters by taking the above mentioned factors as well as the price structure of storage devices in a real marketplace into account. Moreover, we provide a numerical example to evaluate the social welfare realized by the P2P data storage system as a typical application of the modified supply and demand functions.

    DOI

    Scopus

  • Statistical characteristics of serious network failures in Japan.

    Masato Uchida

    Reliability Engineering & System Safety   131   126 - 134  2014.11  [Refereed]

     View Summary

    Due to significant environmental changes in the telecommunications market, network failures affect socioeconomic activities more than ever before. However, the health of public networks at a national level has not been investigated in detail. In this paper, we investigate the statistical characteristics of interval, duration, and the number of users affected for serious network failures, which are defined as network failures that last for more than two hours and affect more than 30,000 users, that occurred in Japan during Japanese fiscal years 2008-2012 (April 2008-March 2013). The results show that (i) the interval follows a Poisson process, (ii) the duration follows a Pareto distribution, (iii) the number of users affected follows a piecewise Pareto distribution, (iv) the product of duration and the number of users affected roughly follow a distribution that can be derived from a convolution of two distributions of duration and the number of users affected, and (v) the relationship between duration and the number of users affected differs from service to service. (C) 2014 Published by Elsevier Ltd.

    DOI

    Scopus

    6
    Citation
    (Scopus)
  • Tight lower bound of generalization error in ensemble learning.

    Masato Uchida

    2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS)(SCIS&ISIS)     1130 - 1133  2014  [Refereed]

    DOI

    Scopus

  • Human Error Tolerant Anomaly Detection Using Time-Periodic Packet Sampling.

    Masato Uchida

    2014 International Conference on Intelligent Networking and Collaborative Systems(INCoS)     390 - 395  2014  [Refereed]

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • Unsupervised weight parameter estimation for exponential mixture distribution based on symmetric Kullback-Leibler divergence.

    Masato Uchida

    2014 Joint 7th International Conference on Soft Computing and Intelligent Systems (SCIS) and 15th International Symposium on Advanced Intelligent Systems (ISIS)(SCIS&ISIS)   98-A ( 11 ) 1126 - 1129  2014  [Refereed]

     View Summary

    When there are multiple component predictors, it is promising to integrate them into one predictor for advanced reasoning. If each component predictor is given as a stochastic model in the form of probability distribution, an exponential mixture of the component probability distributions provides a good way to integrate them. However, weight parameters used in the exponential mixture model are difficult to estimate if there is no training samples for performance evaluation. As a suboptimal way to solve this problem, weight parameters may be estimated so that the exponential mixture model should be a balance point that is defined as an equilibrium point with respect to the distance from/to all component probability distributions. In this paper, we propose a weight parameter estimation method that represents this concept using a symmetric Kullback-Leibler divergence and generalize this method.

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • Node Degree Based Routing Metric for Traffic Load Distribution in the Internet.

    Jun'ichi Shimada, Hitomi Tamura, Masato Uchida, Yuji Oie

    IEICE Transactions on Information & Systems   96-D ( 2 ) 202 - 212  2013  [Refereed]

     View Summary

    Congestion inherently occurs on the Internet due to traffic concentration on certain nodes or links of networks. The traffic concentration is caused by inefficient use of topological information of networks in existing routing protocols, which reduces to inefficient mapping between traffic demands and network resources. Actually, the route with minimum cost, i.e., number of hops, selected as a transmission route by existing routing protocols would pass through specific nodes with common topological characteristics that could contribute to a large improvement in minimizing the cost. However, this would result in traffic concentration on such specific nodes. Therefore, we propose a measure of the distance between two nodes that is suitable for reducing traffic concentration on specific nodes. To consider the topological characteristics of the congestion points of networks, we define node-to-node distance by using a generalized norm, pnorm, of a vector of which elements are degrees of intermediate nodes of the route. Simulation results show that both the maximum Stress Centrality (SC) and the coefficient of variation of the SC are minimized in some network topologies by selecting transmission routes based on the proposed measure of node-to-node distance. Copyright © 2013 The Institute of Electronics, Information and Communication Engineers.

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • Unsupervised Ensemble Anomaly Detection Using Time-Periodic Packet Sampling.

    Masato Uchida, Shuichi Nawata, Yu Gu, Masato Tsuru, Yuji Oie

    IEICE Transactions on Communications   95-B ( 7 ) 2358 - 2367  2012.07  [Refereed]

     View Summary

    We propose an anomaly detection method for finding patterns in network traffic that do not conform to legitimate (i.e., normal) behavior. The proposed method trains a baseline model describing the normal behavior of network traffic without using manually labeled traffic data. The trained baseline model is used as the basis for comparison with the audit network traffic. This anomaly detection works in an unsupervised manner through the use of time-periodic packet sampling, which is used in a manner that differs from its intended purpose the lossy nature of packet sampling is used to extract normal packets from the unlabeled original traffic data. Evaluation using actual traffic traces showed that the proposed method has false positive and false negative rates in the detection of anomalies regarding TCP SYN packets comparable to those of a conventional method that uses manually labeled traffic data to train the baseline model. Performance variation due to the probabilistic nature of sampled traffic data is mitigated by using ensemble anomaly detection that collectively exploits multiple baseline models in parallel. Alarm sensitivity is adjusted for the intended use by using maximum- and minimum-based anomaly detection that effectively take advantage of the performance variations among the multiple baseline models. Testing using actual traffic traces showed that the proposed anomaly detection method performs as well as one using manually labeled traffic data and better than one using randomly sampled (unlabeled) traffic data.

    DOI

    Scopus

    3
    Citation
    (Scopus)
  • Discrete Modeling of the Worm Spread with Random Scanning.

    Masato Uchida

    IEICE Transactions on Communications   95-B ( 5 ) 1575 - 1579  2012.05  [Refereed]

     View Summary

    In this paper, we derive a set of discrete time difference equations that models the spreading process of computer worms such as Code-Red and Slammer, which uses a common strategy called "random scanning" to spread through the Internet. We show that the derived set of discrete time difference equations has an exact relationship with the Kermack and McKendrick susceptible-infectious-removed (SIR) model, which is known as a standard continuous time model for worm spreading.

    DOI

    Scopus

  • A generalised diffusion-based file replication scheme for load balancing in P2P file-sharing networks.

    Masanori Takaoka, Masato Uchida, Kei Ohnishi, Yuji Oie

    International Journal of Grid and Utility Computing   3 ( 4 ) 242 - 252  2012  [Refereed]

     View Summary

    We propose a generalised diffusion-based file replication scheme for load balancing in unstructured P2P file-sharing networks. The generalised method is derived by replacing the replication probability of a peer used in our previous study with a new expression. In the previous expression, the replication probability is defined to be proportional to the difference between its own load and the average load of its neighbour peers. We show here that the replication probability can instead be expressed as a simple average of one defined to be negatively proportional to its own load and one defined to be proportional to the average load of its neighbour peers. The generalised method (a) includes the above three methods as special cases, (b) can control the trade-off between search and load balancing performances, (c) has a physical analogy to diffusion phenomena, and (d) achieves a good balance in the trade-off differently from our previous method. Copyright © 2012 Inderscience Enterprises Ltd.

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Unsupervised Weight Parameter Estimation Method for Ensemble Learning.

    Masato Uchida, Yousuke Maehara, Hiroyuki Shioya

    Journal of Mathematical Modelling and Algorithms   10 ( 4 ) 307 - 322  2011.12  [Refereed]

     View Summary

    When there are multiple trained predictors, one may want to integrate them into one predictor. However, this is challenging if the performances of the trained predictors are unknown and labeled data for evaluating their performances are not given. In this paper, a method is described that uses unlabeled data to estimate the weight parameters needed to build an ensemble predictor integrating multiple trained component predictors. It is readily derived from a mathematical model of ensemble learning based on a generalized mixture of probability density functions and corresponding information divergence measures. Numerical experiments demonstrated that the performance of our method is much better than that of simple average-based ensemble learning, even when the assumption placed on the performances of the component predictors does not hold exactly. © 2011 Springer Science+Business Media B.V.

    DOI

    Scopus

    4
    Citation
    (Scopus)
  • Query-Trail-Mediated Cooperative Behaviors of Peers in Unstructured P2P File Sharing Networks.

    Kei Ohnishi, Hiroshi Yamamoto, Masato Uchida, Yuji Oie

    IEICE Transactions on Information & Systems   94-D ( 10 ) 1966 - 1980  2011.10  [Refereed]

     View Summary

    We propose two types of autonomic and distributed cooperative behaviors of peers for peer-to-peer (P2P) file-sharing networks. Cooperative behaviors of peers are mediated by query trails, and allows the exploration of better trade-off points between file search and storage load balancing performance. Query trails represent previous successful search paths and indicate which peers contributed to previous file searches and were at the same time exposed to the storage load. The first type of cooperative behavior is to determine the locations of replicas of files through the medium of query trails. Placement of replicas of files on strong query trails contributes to improvement of search performance, but a heavy load is generated due to writing files in storage to peers on the strong query trails. Therefore, we attempt to achieve storage load balancing between. peers, while avoiding significant degradation of the search performance by creating replicas of files in peers adjacent to peers on strong query trails. The second type of cooperative behavior is to determine whether peers provide requested files through the medium of query trails. Provision of files by peers holding requested files on strong query trails contributes to better search performance, but such provision of files generates a heavy load for reading files from storage to peers on the strong query trails. Therefore, we attempt to achieve storage load balancing while making only small sacrifices in search performance by having peers on strong query trails refuse to provide files. Simulation results show that the first type of cooperative behavior provides equal or improved ability to explore trade-off points between storage load balancing and search performance in a static and nearly homogeneous P2P environment, without the need for fine tuning parameter values, compared to replication methods that require fine tuning of their parameters values. In addition, the combination of the second type and the first type of cooperative behavior yields better storage load balancing performance with little degradation of search performance. Moreover, even in a dynamic and heterogeneous P2P environment, the two types of cooperative behaviors yield good ability to explore trade-off points between storage load balancing and search performance.

    DOI

    Scopus

  • An information-theoretic characterization of weighted a-proportional fairness in network resource allocation

    Masato Uchida, Jim Kurose

    INFORMATION SCIENCES   181 ( 18 ) 4009 - 4023  2011.09  [Refereed]

     View Summary

    This paper provides a characterization of fairness concepts in network resource allocation problems from the viewpoint of information theory. The fundamental idea underlying this paper is to characterize the utility functions in optimization problems, which motivate fairness concepts, based on a trade-off between user and network satisfaction. User satisfaction is evaluated using information divergence measures, which were originally used in information theory, to evaluate the difference between an implemented resource allocation and a requested resource allocation. The requested resource allocation is assumed to be ideal in some sense from the user's point of view. Network satisfaction is evaluated based on the efficiency of resource usage in the implemented resource allocation. The results in this paper indicate that the well-known fairness concept called weighted alpha-proportional fairness can be characterized using the alpha-divergence measure, which is a general class of information divergence measures, as an equilibrium of the trade-off. Some typical examples of applications demonstrate how the presented characterization works. (C) 2011 Elsevier Inc. All rights reserved.

    DOI

    Scopus

    6
    Citation
    (Scopus)
  • Fixed Point Optimization Algorithms for Network Bandwidth Allocation Problems with Compoundable Constraints.

    Hideaki Iiduka, Masato Uchida

    IEEE Communications Letters   15 ( 6 ) 596 - 598  2011.06  [Refereed]

     View Summary

    In this letter, we develop a novel computational approach for network bandwidth allocation problems in which the compoundable constraints about the preferable transmission rate fall in the infeasible region. The approach is based on an iterative technique for non-convex optimization over the fixed point set of a certain nonexpansive mapping. The realized allocation maximizes a predefined utility and is closest to the preferable transmission rate with respect to the norm. Numerical examples show that our approach is an efficient way to solve the non-concave utility maximization problem.

    DOI

    Scopus

    15
    Citation
    (Scopus)
  • Node Degree-Aware Link Cost for Traffic Load-Distribution in Large-Scale Networks.

    Hitomi Tamura, Mario Köppen, Masato Uchida, Masato Tsuru, Yuji Oie

    2011 Third International Conference on Intelligent Networking and Collaborative Systems (INCoS)(INCoS)     299 - 304  2011  [Refereed]

     View Summary

    Traffic Engineering (TE) is required for reducing highly-loaded links / nodes in parts of a network, thereby distributing the traffic load in the network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. Therefore, we should consider an appropriate definition of "distance" in networks with the topological features of the network instead of traffic demands. Recent studies have demonstrated a scale-free property of network topology, and node outbound degree distribution is an important factor in the scale-free networks. This paper proposes a new definition of "distance" between two arbitrary communication nodes in the Internet by using node degree information for avoiding congestion in the network. Some simulation results show that the proposed scheme can distribute traffic load from high degree nodes to other nodes, and thus provides robustness of networks. © 2011 IEEE.

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Routing Metric Based on Node Degree for Load-Balancing in Large-Scale Networks.

    Hitomi Tamura, Masato Uchida, Masato Tsuru, Jun'ichi Shimada, Takeshi Ikenaga, Yuji Oie

    11th Annual International Symposium on Applications and the Internet(SAINT)     519 - 523  2011  [Refereed]

     View Summary

    Traffic Engineering (TE) is required for reducing highly-loaded links/nodes in a part of networks, thereby reducing the traffic concentration in a part of network. For efficient use of network resources, it is important to efficiently map traffic demands to network resources. However, most of the existing TE schemes are not aware of underlying network topology, Indeed, they try to dynamically map traffic demands to network resources in response to traffic trends in a short period of time. The paper addresses the issue of network congestion due to inefficient mapping between traffic demand and network resources. We propose a new routing metric to allocate forwarding route from source node to its destinations for effective use of network resources in scale-free networks. We show that the best routing metric is p-norm based on node degrees along a path to destination node. Furthermore, we investigate the impact of the parameter, p, on congestion level of each link, and show the best parameter p to minimize the maximum stress centrality in a network. © 2011 IEEE.

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • A Generalized File Replication Scheme with Diffusion-Based Storage Load Balancing Function in Unstructured P2P File-Sharing Networks

    Masanori Takaoka, Masato Uchida, Yuji Oie

    2010 International Conference on Intelligent Networking and Collaborative Systems    2010.11

    DOI

  • Access Load Balancing with Analogy to Thermal Diffusion for Dynamic P2P File-Sharing Environments.

    Masanori Takaoka, Masato Uchida, Kei Ohnishi, Yuji Oie

    IEICE Transactions on Communications   93-B ( 5 ) 1140 - 1150  2010.05  [Refereed]

     View Summary

    In this paper, we propose a file replication method to achieve load balancing in terms of write access to storage device ("write storage access load balancing" for short) in unstructured peer-to-peer (P2P) file-sharing networks in which the popularity trend of queried files varies dynamically. The proposed method uses a write storage access ratio as a load balance index value in order to stabilize dynamic P2P file-sharing environments adaptively. In the proposed method, each peer autonomously controls the file replication ratio, which is defined as a probability to create the replica of the file in order to uniform write storage access loads in the similar way to thermal diffusion phenomena. Theoretical analysis results show that the behavior of the proposed method actually has an analogy to a thermal diffusion equation. In addition, simulation results reveal that the proposed method has an ability to realize write storage access load balancing in the dynamic P2P file-sharing environments.

    DOI CiNii

    Scopus

    5
    Citation
    (Scopus)
  • Dynamic and Decentralized Storage Load Balancing with Analogy to Thermal Diffusion for P2P File Sharing.

    Masato Uchida, Kei Ohnishi, Kento Ichikawa, Masato Tsuru, Yuji Oie

    IEICE Transactions on Communications   93-B ( 3 ) 525 - 535  2010.03  [Refereed]

     View Summary

    In this paper we propose a file replication scheme inspired by a thermal diffusion phenomenon for storage load balancing in unstructured peer-to-peer (P2P) file sharing networks The proposed scheme is designed such that the storage utilization ratios of peers will be uniform, in the same way that the temperature in a field becomes uniform in a thermal diffusion phenomenon The proposed scheme creates replicas of files in peers probabilistically, where the probability is controlled by using parameters that can be used to find the trade-off between storage load balancing and search performance in unstructured P2P file sharing networks First we show through theoretical analysis that the statistical behavior of the storage load balancing cannoned by the proposed scheme has an analogy with the thermal diffusion phenomenon We then show through simulation that the proposed scheme not only has superior performance with respect to balancing the storage load among peers (the primary objective of the present proposal) hut also allows the performance trade-off to be widely found Finally, we qualitatively discuss a guideline for setting the parameter values in order to widely find the performance trade-off from the simulation results.

    DOI

    Scopus

    4
    Citation
    (Scopus)
  • Universal power laws in the threshold network model: A theoretical analysis based on extreme value theory

    A. Fujihara, M. Uchida, H. Miwa

    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS   389 ( 5 ) 1124 - 1130  2010.03  [Refereed]

     View Summary

    We theoretically and numerically investigated the threshold network model with a generic weight function where there were a large number of nodes and a high threshold. Our analysis was based on extreme value theory, which gave us a theoretical understanding of the distribution of independent and identically distributed random variables within a sufficiently high range. Specifically, the distribution could be generally expressed by a generalized Pareto distribution, which enabled us to formulate the generic weight distribution function. By using the theorem, we obtained the exact expressions of degree distribution and clustering coefficient which behaved as universal power laws within certain ranges of degrees. We also compared the theoretical predictions with numerical results and found that they were extremely consistent. (C) 2009 Elsevier B.V. All rights reserved.

    DOI

    Scopus

    6
    Citation
    (Scopus)
  • Performance Evaluation of Power Saving Scheme with Dynamic Transmission Capacity Control

    Yutaka Fukuda, Takeshi Ikenaga, Hitomi Tamura, Masato Uchida, Kenji Kawahara, Yuji Oie

    2009 IEEE Globecom Workshops    2009.11

    DOI

  • Limit Theorems for the Average Distance and the Degree Distribution of the Threshold Network Model

    Akihiro Fujihara, Yusuke Ide, Norio Konno, Naoki Masuda, Hiroyoshi Miwa, Masato Uchida

    Interdisciplinary Information Sciences   15 ( 3 ) 361-366 - 366  2009.11  [Refereed]

    DOI CiNii

  • Impact of Censoring on Estimation of Flow Duration Distribution and Its Mitigation Using Kaplan-Meier-Based Method.

    Yuki Sakai, Masato Uchida, Masato Tsuru, Yuji Oie

    IEICE Transactions on Information & Systems   92-D ( 10 ) 1949 - 1952  2009.10  [Refereed]

     View Summary

    A basic and inevitable problem in estimating flow duration distribution arises from "censoring" (i.e., cutting off) the observed flow duration because of a finite measurement period. We extended the Kaplan-Meier method, which is used in the Survival analysis field, and applied it to recover information on the flow duration distribution that was lost due to censoring. We show that the flow duration distribution from a short period of actual traffic data with censoring that was estimated using a Kaplan-Meier-based method can approximate well the flow duration distribution calculated from a sufficiently long period of actual traffic data.

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • HDTV objective video quality assessment method applying fuzzy measure

    Jun Okamoto, Keishiro Watanabe, Aoi Honda, Masato Uchida, Seiichiro Hangai

    2009 International Workshop on Quality of Multimedia Experience    2009.07

    DOI

  • Path selection scheme for traffic load distribution considering the characteristics of network topology

    Jun'ichi Shimada, Nobumasa Natsui, Hitomi Tamura, Takeshi Ikenaga, Masato Uchida, Yuji Oie

    2009 IEEE 13th International Symposium on Consumer Electronics    2009.05

    DOI

  • An Information-Theoretic Characterization of Weighted alpha-Proportional Fairness.

    Masato Uchida, Jim Kurose

    INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies(INFOCOM)     1053 - 1061  2009  [Refereed]

     View Summary

    This paper provides a novel characterization of fairness concepts in network resource allocation problems from the viewpoint of information theory. The fundamental idea adopted in this paper is to characterize the utility functions used in optimization problems, which motivate fairness concepts, based on a trade-off between user and system satisfaction. Here, user satisfaction is evaluated using information divergence measures that were originally used in information theory to evaluate the difference between two probability distributions. In this paper, information divergence measures are applied to evaluate the difference between the implemented resource allocation and a requested resource allocation. The requested resource allocation is assumed to be ideal in some sense from the user's point of view. Also, system satisfaction is evaluated based on the efficiency of the implemented resource utilization, which is defined as the total amount of resources allocated to each user. The results discussed in this paper indicate that the well-known fairness concept called weighted a-proportional fairness can be characterized using the a-divergence measure, which is a general class of information divergence measures, as an equilibrium of the trade-off described above. In the process of obtaining these results, we also obtained a new utility function that has a parameter to control the trade-off. This new function is then applied to typical examples to solve resource allocation problems in simple network models such as those for two-link networks and wireless LANs.

    DOI

    Scopus

    34
    Citation
    (Scopus)
  • On the Quality of Triangle Inequality Violation Aware Routing Overlay Architecture.

    Ryoichi Kawahara, Eng Keong Lua, Masato Uchida, Satoshi Kamei, Hideaki Yoshino

    INFOCOM 2009. 28th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies(INFOCOM)     2761 - 2765  2009  [Refereed]

     View Summary

    It is known that Internet routing policies for both intra- and inter-domain routing can naturally give rise to Triangle Inequality Violations (TIVs) with respect to Quality of Service (QoS) network metrics such as latencies between nodes. This motivates the exploitation of such TIVs phenomenon in network metrics to design TlV-aware routing overlay architecture which is capable of choosing quality overlay routing paths to improve end-to-end QoS without changing the underlying network architecture. Our idea is to find quality overlay routes between node pairs based on TIV optimization in terms of the latency and packet loss ratio, and that can offer near optimal routing quality in cost-effective and scalable manner. Our intuition to do this is to choose these overlay routes from a small set of transit nodes. We propose to assign nodes with transit selection frequency scores that are computed based on previous node usage for transit, and consolidate a small set of highly ranked transit nodes. For every node pair, we choose the best transit node in this small set for overlay routing, based on TIV optimization in latency and packet loss ratio. We analyze the quality of our TlV-aware routing overlay algorithm analytically and using real Internet measurements on latency and packet loss ratio. Our results show good quality performance in improving end-to-end QoS routing. © 2009 IEEE.

    DOI

    Scopus

    13
    Citation
    (Scopus)
  • Virtual Segment: Segmentation Method for Store-carry-forward Routing Schemes

    Shinya Yamamura, Akira Nagata, Masato Uchida, Masato Tsuru

    1st Workshop on Wireless Broadband Access for Communities and Rural Developing Regions (WIRELESS4D 2008)    2008.12  [Refereed]

  • Mixture Model based Representation of Information Integration

    Masato Uchida, Hiroyuki Shioya, Yousuke Maehara

    Proceedings of SCIS&ISIS 2008   CD-ROM version ( CD-ROM version ) 1020 - 1025  2008.09  [Refereed]

  • Thermal Diffusion-Based Access Load Balancing for P2P File Sharing Networks

    Masanori Takaoka, Kei Ohnishi, Masato Uchida, Yuji Oie

    2008 The Third International Multi-Conference on Computing in the Global Information Technology (iccgi 2008)    2008.07

    DOI

  • Scaling properties of complex networks: Towards Wilsonian renormalization for complex networks

    Kento Ichikawa, Masato Uchida, Masato Tsuru, Yuji Oie

    2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops    2008.04

    DOI

  • TCP Flow Level Performance Evaluation on Error Rate Aware Scheduling Algorithms in Evolved UTRA and UTRAN Networks.

    Yan Zhang 0026, Masato Uchida, Masato Tsuru, Yuji Oie

    IEICE Transactions on Communications   91-B ( 3 ) 761 - 771  2008.03  [Refereed]

     View Summary

    We present a TCP flow level performance evaluation on error rate aware scheduling algorithms in Evolved UTRA and UTRAN networks. With the introduction of the error rate, which is the probability of transmission failure under a given wireless condition and the instantaneous transmission rate, the transmission efficiency can be improved without sacrificing the balance between system performance and user fairness. The performance comparison with and without error rate awareness is carried out dependant on various TCP traffic models, user channel conditions, schedulers with different fairness constraints, and automatic repeat request (ARQ) types. The results indicate that error rate awareness can make the resource allocation more reasonable and effectively improve the system and individual performance, especially for poor channel condition users.

    DOI

    Scopus

  • Proxy data transfer system with a stable control channel and dynamically changing data channels.

    Akira Nagata, Shinya Yamamura, Masato Uchida, Masato Tsuru

    Proceedings of the Third Workshop on Challenged Networks     121 - 124  2008  [Refereed]

     View Summary

    The present paper introduces the Proxy Data Transfer system, which enables file transfer applications to work over long delays and leaky or frequently disconnecting networks (referred to hereinafter as a "challenged environment"), in which traditional end-to-end communication does not work well. An important feature is that the satellite link is applied to the control channel with a low data rate in order to achieve sustainability over a very large area. We developed a prototype and conducted an experiment using the Japanese engineering testing satellite "KIKU no.8" in May of 2008. An experiment using KIKU no.8 will be described and a live demonstration in an emulated network environment will be given at CHANTS2008.

    DOI

    Scopus

    4
    Citation
    (Scopus)
  • Identifying Heavy-Hitter Flows from Sampled Flow Statistics.

    Tatsuya Mori, Tetsuya Takine, Jianping Pan 0001, Ryoichi Kawahara, Masato Uchida, Shigeki Goto

    IEICE Transactions on Communications   90-B ( 11 ) 3061 - 3072  2007.11  [Refereed]

     View Summary

    With the rapid increase of link speed in recent years, packet sampling has become a very attractive and scalable means in collecting flow statistics; however, it also makes inferring original flow characteristics much more difficult. In this paper, we develop techniques and schemes to identify flows with a very large number of packets (also known as heavy-hitter flows) from sampled flow statistics. Our approach follows a two-stage strategy: We first parametrically estimate the original flow length distribution from sampled flows. We then identify heavy-hitter flows with Bayes' theorem, where the flow length distribution estimated at the first stage is used as an a priori distribution. Our approach is validated and evaluated with publicly available packet traces. We show that our approach provides a very flexible framework in striking an appropriate balance between false positives and false negatives when sampling frequency is given.

    DOI

    Scopus

    36
    Citation
    (Scopus)
  • TCP Flow level Performance evaluation on packet combining Hybrid ARQ inevolved UTRA and UTRAN network

    張艶, 内田真人, 鶴正人, 尾家祐二

    the 8th World Wireless Congress (WWC2007)    2007.05  [Refereed]

  • Information theoretic aspects of fairness criteria in network resource allocation problems.

    Masato Uchida

    Proceedings of the 2nd International Conference on Performance Evaluation Methodolgies and Tools(VALUETOOLS)     3 - 3  2007  [Refereed]

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Design of an Unsupervised Weight Parameter Estimation Method in Ensemble Learning.

    Masato Uchida, Yousuke Maehara, Hiroyuki Shioya

    Neural Information Processing   4984   771 - 780  2007  [Refereed]

     View Summary

    A learning method using an integration of multiple component predictors as an ultimate predictor is generically referred to as ensemble learning. The present paper proposes a weight parameter estimation method for ensemble learning under the constraint that we do not have any information of the desirable (true) output. The proposed method is naturally derived from a mathematical model of ensemble learning, which is based on an exponential mixture type probabilistic model and Kullback divergence. The proposed method provides a legitimate strategy for weight parameter estimation under the abovementioned constraint if it is assumed that the accuracy of all multiple predictors are the same. We verify the effectiveness of the proposed method through numerical experiments.

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Estimating scale of peer-to-peer file sharing applications using multilayer partial measurement

    Satoshi Kamei, Masato Uchida, Tatsuya Mori, Yutaka Takahashi

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS   90 ( 3 ) 54 - 63  2007  [Refereed]

     View Summary

    Autonomous distributed systems comprising an overlay network on the Internet are proliferating as a new technology responsible for the next-generation Web. Due to the properties of such a large-scale system, it is difficult to measure the characteristics of the entire system without modifying the internal protocol of the applications. In this paper, by using a measurement method applicable to P2P applications and measured results obtained by applying this measurement method in part, a general-purpose method for estimating the size and behavior of the entire P2P network is proposed. Further, the present method is applied to a real P2P network and its effectiveness is presented by a specific example. (C) 2006 Wiley Periodicals, Inc.

    DOI

    Scopus

  • Can Scheduling with Error Rate Consideration Support TCP Performance Comparable to Packet Combining HARQ in Evolved UTRA and UTRAN Networks?

    Yan Zhang 0026, Masato Uchida, Masato Tsuru, Yuji Oie

    Fourth European Conference on Universal Multiservice Networks (ECUMN 2007)(ECUMN)     135 - 144  2007  [Refereed]

     View Summary

    As a key technology of evolved UTRA and UTRAN, hybrid ARQ with packet combining (HARQ with PC) can effectively improve the throughput performance for poor channel condition users without doing unacceptable level of harm to the system transmission efficiency or the throughput performance of good condition users. In the present study, we attempt to apply scheduling with error rate consideration as an alternative method by which to realize a comparable TCP performance to HARQ with PC. Scheduling with error rate consideration introduces the transmission failure possibility (error rate) in order to modify the existing channel-aware scheduling schemes to avoid high-risk transmissions, and thus improves TCP performance. Simulations show that scheduling with error rate consideration can realize a TCP performance comparable to HARQ with PC when no user continuously experiences a nearly zero successful transmission possibility environment. Moreover, it is shown herein that a synergistic improvement can be achieved by applying scheduling with error rate consideration to HARQ with PC. © 2007 IEEE.

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Evolution and Learning Mediated by Differences in Developmental Timing.

    Kei Ohnishi, Masato Uchida, Yuji Oie

    Journal of Advanced Computational Intelligence and Intelligent Informatics (JACIII)   11 ( 8 ) 905 - 913  2007  [Refereed]

    DOI

  • QoS-Aware Overlay Routing with Limited Number of Alternative Route Candidates and Its Evaluation.

    Masato Uchida, Satoshi Kamei, Ryoichi Kawahara, Takeo Abe

    IEICE Transactions on Communications   89-B ( 9 ) 2361 - 2374  2006.09  [Refereed]

     View Summary

    A recent trend in routing research is the use of overlay routing to improve end-to-end QoS without changing the network-level architecture. The key of this technology is to find an alternative route that can avoid congested routes, using an overlay network. Developing cost-efficient overlay routing in terms of calculation cost and information distribution cost needed to find an alternative route is important for deploying QoS-aware overlay routing. Thus, this paper evaluates how effective overlay routing can be when the number of alternative route candidates is limited to reduce costs. Evaluation results using actual measurement data indicate that overlay routing is still effective even if alternative route candidates are limited to 1/4 of all possible alternative routes. We also discuss an overlay routing algorithm to enable us to find an appropriate route under the constraint that the number of alternative route candidates is limited.

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Storage load balancing via local interactions among peers in unstructured P2P networks

    Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Masato Uchida, Yuji Oie

    Proceedings of the 1st international conference on Scalable information systems - InfoScale '06    2006

    DOI

    Scopus

    3
    Citation
    (Scopus)
  • Dynamic storage load balancing with analogy to thermal diffusion for P2P file sharing

    Masato Uchida, Kei Ohnishi, Kento Ichikawa, Masato Tsuru, Yuji Oie

    Proceedings from the 2006 workshop on Interdisciplinary systems approach in performance evaluation and design of computer & communications sytems - interperf '06    2006

    DOI

    Scopus

    6
    Citation
    (Scopus)
  • Scheduling algorithms with error rate consideration in HSDPA networks.

    Yan Zhang 0026, Masato Uchida, Masato Tsuru, Yuji Oie

    Proceedings of the International Conference on Wireless Communications and Mobile Computing(IWCMC)   2006   1241 - 1246  2006  [Refereed]

     View Summary

    The probability of transmission failure under a given wireless condition and instantaneous transmission rate is introduced as a new scheduling metric to improve the performance of existing scheduling algorithms. Scheduling algorithms for high-speed downlink packet access (HSDPA) in wideband code division multiple access (WCDMA) networks generally deal with the instantaneous transmission rate of each user as a key parameter reflecting the time-varying and location-dependent characteristics of the wireless channel. As a more detailed measure of the wireless condition of each user, the error rate metric improves the effectiveness of sharing resources without sacrificing a good balance between system performance and user fairness. Simulation results demonstrate that a performance gain of approximately 20% can be achieved for several well-known scheduling algorithms when the error rate is taken into account. Copyright 2006 ACM.

    DOI

    Scopus

    6
    Citation
    (Scopus)
  • Effect of Introducing Predictive CIR on Throughput Performance in HSDPA Networks.

    Yan Zhang 0026, Masato Uchida, Masato Tsuru, Yuji Oie

    Proceedings of the IEEE 17th International Symposium on Personal, Indoor and Mobile Radio Communications(PIMRC)     1 - 5  2006  [Refereed]

     View Summary

    Predicting wireless environment parameters as correctly and timely as possible is of practical importance to optimal resource allocation in wireless systems. For example, as the realtime wireless condition information is not available in reality due to delay, the latest historic wireless environment parameters are used to determine the users' instantaneous transmission rate in most of the existing systems in high-speed downlink packet access (HSDPA) networks. However, the wireless condition variation during this delay (e.g., 6ms) sometimes results in unsuitable determination of the instantaneous transmission rate and eventually influences the user and system performance. It is shown by simulation results that compared with using the ideal realtime wireless environment information, using the latest available historic information will introduce about 10%-15% throughput performance damage averagely. Therefore, in this paper, in order to mitigate such performance degradation, a simple linear prediction of the current wireless environment parameters is introduced. Simulation results demonstrate that nearly 10% improvement can be achieved under several well-known scheduling algorithms in a HSDPA network when the predictive environment parameter is applied to determine the instantaneous transmission rate. © 2006 IEEE.

    DOI

    Scopus

  • Performance Evaluation of QoS-Aware Routing in Overlay Network.

    Masato Uchida, Satoshi Kamei, Ryoichi Kawahara

    Information Networking, Advances in Data Communications and Wireless Networks(ICOIN)     925 - 934  2006  [Refereed]

    DOI

    Scopus

  • アンサンブル学習における符号を保つ重み正規化手法に関する検討

    前原 洋祐, 内田 真人, 塩谷 浩之, 大森 隆司

    電子情報通信学会論文誌   J89-D ( 10 ) 2370-2375  2006  [Refereed]

  • Hop-Value-Based Query-Packet Forwarding for Pure P2P.

    Masato Uchida, Shinya Nogami

    IEICE Transactions on Communications   88-B ( 12 ) 4517 - 4522  2005.12  [Refereed]

     View Summary

    In pure peer-to-peer (P2P) file sharing applications and protocols using a flooding-based query algorithm, a large number of control packets (query packets) are transmitted on the network to search for target files. This clearly leads to a degradation of communication quality on the network and terminals as the number of users of the application increases. To solve such problems, this paper proposes: (1) a unified framework to describe a wide variety of query algorithms for pure P2P and (2) a new query algorithm based on this framework. Our framework determines the number of destinations for query packets based on the hop value recorded in received query packets. Simulation results revealed that the proposed query algorithm can reduce the overhead in the flooding-based query algorithm and k-random walks without decreasing the success rate of retrieval regardless of the density of target files in the network.

    DOI

    Scopus

  • Flow analysis of internet traffic: World Wide Web versus peer-to-peer.

    Tatsuya Mori, Masato Uchida, Shigeki Goto

    Systems and Computers in Japan   36 ( 11 ) 70 - 81  2005.10  [Refereed]

     View Summary

    Peer-to-peer (P2P) applications have been expanding rapidly in recent years, and the contribution of P2P to present Internet traffic is close to that of the World Wide Web (WWW). In this study, the flow of WWW and P2P traffic is analyzed by network measurement. The characteristics of WWW and P2P are examined, especially in terms of the flow arrival interval, flow duration, flow size, and flow rate. Based on the results of the analysis, the effect of a P2P flow increase on the overall traffic characteristics is investigated. The results of this study will be utilized in network design, proposals for control procedures, and traffic modeling, considering the traffic characteristics of particular applications. © 2005 Wiley Periodicals, Inc.

    DOI

    Scopus

    21
    Citation
    (Scopus)
  • An extended formula for divergence measures using invariance

    Masato Uchida, Hiroyuki Shioya

    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)   88 ( 4 ) 35 - 42  2005.04  [Refereed]

     View Summary

    The f-divergence, which is defined by using a class of convex functions, is used as a generalized phenotype of discriminant measures between two probability distributions. In this paper, we derive a new class of discriminant measures defined on the set of all positive finite measures using the invariance of the f-divergence. This is a class of discriminant measures different from ones which have often been used. We mention some aspects of its effectiveness concerning the extension of discriminant measures by showing that the proposed class includes measures that facilitate statistical data processing and are suitable for the explicit formulation and analysis of the ensemble learning method. © 2004 Wiley Periodicals, Inc.

    DOI

    Scopus

    7
    Citation
    (Scopus)
  • Modeling Viral Spread by Random Scanning and Its Relationship with the Epidemiological Model.

    Masato Uchida

    19th International Parallel and Distributed Processing Symposium (IPDPS 2005)(IPDPS)    2005  [Refereed]

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • Replication scheme for traffic load balancing and its parameter tuning in pure P2P communication.

    Shinya Nogami, Masato Uchida, Takeo Abe

    2005 International Symposium on Autonomous Decentralized Systems(ISADS)   2005   701 - 706  2005  [Refereed]

     View Summary

    A replication scheme is an effective method for maintaining a high hit rate for target files. This paper proposes a new replication scheme that scatters 'replicas ' of files to other servents on a P2P network for the purpose of dispersing query and download traffic. First, the details of this proposed scheme are described and its parameter tuning is discussed by introducing rating functions. Second, the effectiveness of this scheme is evaluated by simulation. The simulation results demonstrate that the proposed scheme has superior performance for some characteristic values, such as the hit rate and the number of mean hops to the target servent, compared with other schemes. Finally, the influence of departure rate is discussed.

    DOI

    Scopus

  • 複数レイヤでの部分測定を用いたP2Pファイル共有アプリケーションの規模推定

    亀井 聡, 内田 真人, 森 達哉, 高橋 豊

    電子情報通信学会論文誌   J88-B ( 11 ) 2171-2180  2005  [Refereed]

  • Traffic Data Analysis Based on Extreme Value Theory and Its Applications to Predicting Unknown Serious Deterioration.

    Masato Uchida

    IEICE Transactions on Information & Systems   87-D ( 12 ) 2654 - 2664  2004.12  [Refereed]

     View Summary

    It is important to predict serious deterioration of telecommunication quality. This paper investigates predicting such serious events by analyzing only a "short" period (i.e., a "small" amount) of teletraffic data. To achieve this end, this paper presents a method for analyzing the tail distributions of teletraffic state variables, because tail distributions are suitable for representing serious events. This method is based on Extreme Value Theory (EVT), which provides a firm theoretical foundation for the analysis. To be more precise, in this paper, we use throughput data measured on an actual network during daily busy hours for 15 minutes, and use its first 10 seconds (known data) to analyze the tail distribution. Then, we evaluate how well the obtained tail distribution can predict the tail distribution of the remaining 890 seconds (unknown data). The results indicate that the obtained tail distribution based on EVT by analyzing the small amount of known data can predict the tail distribution of unknown data much better than methods based on empirical or log-normal distributions. Furthermore, we apply the obtained tail distribution to predict the peak throughput in unknown data. The results of this paper enable us to predict serious deterioration events with lower measurement cost.

  • Traffic data analysis based on extreme value theory and its applications.

    Masato Uchida

    Proceedings of the Global Telecommunications Conference(GLOBECOM)     1418 - 1424  2004  [Refereed]

    DOI

  • Identifying elephant flows through periodically sampled packets.

    Tatsuya Mori, Masato Uchida, Ryoichi Kawahara, Jianping Pan 0001, Shigeki Goto

    Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference   104 ( 181 ) 115 - 120  2004  [Refereed]

     View Summary

    Identifying elephant flows is very important in developing effective and efficient traffic engineering schemes. In addition, obtaining the statistics of these flows is also very useful for network operation and management. On the other hand, with the rapid growth of link speed in recent years, packet sampling has become a very attractive and scalable means to measure flow statistics ; however, it also makes identifying elephant flows become much more difficult. Based on Bayes' theorem, this paper develops techniques and schemes to identify elephant flows in periodically sampled packets. We show that our basic framework is very flexible in making appropriate trade-offs between false positives (misidentified flows) and false negatives (missed elephant flows) with regard to a given sampling frequency. We further validate and evaluate our approach by using some publicly available traces. Our schemes are generic and require no per-packet processing ; hence, they allow a very cost-effective implementation for being deployed in large-scale high-speed networks.

    DOI CiNii

    Scopus

    152
    Citation
    (Scopus)
  • 不定性を用いた分布間情報量の拡張形式に関する検討

    内田 真人, 塩谷 浩之

    電子情報通信学会論文誌   J87-A ( 4 ) 546-553  2004  [Refereed]

  • インターネットトラヒックのフロー分析:Web と P2P の特性比較

    森 達哉, 内田 真人, 後藤 滋樹

    電子情報通信学会論文誌   J87-D-I ( 5 ) 561-571  2004  [Refereed]

  • アンサンブル学習モデルにおける重み付けに関する考察

    内田 真人, 塩谷 浩之

    電子情報通信学会論文誌   J86-D-II ( 7 ) 1131-1134  2003  [Refereed]

  • アンサンブル学習の解析と拡張

    内田 真人, 塩谷 浩之, 伊達 惇

    電子情報通信学会論文誌   J84-D-II ( 7 ) 1537-1542  2001  [Refereed]

  • 非ベイズ的付加項を用いた多層パーセプトロンの学習

    内田 真人, 塩谷 浩之, 伊達 惇

    電子情報通信学会論文誌   J83-DII ( 6 ) 1572-1576  2000  [Refereed]

▼display all

Misc

  • 不動点最適化手法とネットワーク資源割り当て問題への応用

    飯塚 秀明, 内田 真人

    応用数理   Vol.21 ( No.3 ) 6 - 21  2011.09

  • Delay Tolerant Networking Technology — The Latest Trends and Prospects

    Tsuru Masato, Uchida Masato, Takine Tetsuya, Nagata Akira, Matsuda Takahiro, Miwa Hiroyoshi, Yamamura Shinya

    B-Plus   2011 ( 16 ) 16_57 - 16_68  2011.03  [Refereed]

    DOI CiNii

  • DTN技術の現状と展望

    鶴 正人, 内田 真人, 滝根 哲哉, 永田 晃, 松田 崇弘, 巳波 弘佳, 山村 新也

    電子情報通信学会 通信ソサイエティマガジン   ( No.16 ) 57 - 68  2011.03

  • 電子メールを媒介としたコンピューターウイルス感染拡大モデル

    佐藤 大輔, 内田 真人

    応用数理   Vol.20 ( No.3 ) 50 - 55  2010.09

  • インターネットにおけるべき乗則

    田村 瞳, 内田 真人, 巳波 弘佳

    オペレーションズ・リサーチ : 経営の科学 = [O]perations research as a management science [r]esearch   53 ( 9 ) 517 - 522  2008.09

     View Summary

    本稿では,様々な機能を追加しながら大規模に発展したインターネットと,昨今,様々な分野で注目されている複雑ネットワークとの関係性について紹介する.特に,複雑ネットワークの特徴の一つであるべき乗則という観点から通信の世界を見た場合に得られる,ネットワークトポロジ生成モデルや実際のネットワークトポロジ,通信トラピックの特徴に関する新たな知見について紹介する.

    CiNii

  • B-7-64 Evaluation on Scalability of Overlay Routing

    Uchida Masato, Kamei Satoshi, Kawahara Ryoichi

    Proceedings of the Society Conference of IEICE   2005 ( 2 ) 191 - 191  2005.09

    CiNii

  • Evaluation of QoS-aware Routing in Overlay Network

    UCHIDA Masato, KAMEI Satoshi, KAWAHARA Ryoichi

    IEICE technical report. Information networks   105 ( 178 ) 13 - 18  2005.07

     View Summary

    A recent trend in routing research is using overlay routing to improve end-to-end QoS performance without changing network level architecture. This technology finds detour, which can avoid congested points, using overlay network. It is important to evaluate calculation cost to find such detour to realize the technology. So, this paper evaluated how much the technology can be effective when the number of candidate of detour is limitted. The result of evaluation find that the technology is effective if we limit the candidate of detour appropriately.

    CiNii

  • Unified Framework and an Algorithm for Search in Pure P2P: Hop-value-based Query-packet Forwarding

    Masato Uchida, Shinya Nogami

    NTT Technical Review   Vol.2 ( No.6 ) 43 - 48  2004.06

  • 極値理論を用いたトラヒックデータ分析

    内田 真人

    NTT R&D   Vol.52 ( No.3 ) 239 - 244  2003.03

▼display all

Industrial Property Rights

  • 品質測定方法およびノード装置

    4473199

    Patent

  • オーバーレイネットワークにおける通信経路計算システムと方法およびプログラム

    4437976

    Patent

  • 複数地点測定を用いたネットワーク規模推定システムおよびその方法、ならびにそのプログラムとプログラムを記録した記録媒体

    4390210

    Patent

  • ネットワーク規模推定システムと方法およびプログラム

    3960323

    Patent

  • P2Pネットワークのトラヒック制御方法並びにプログラム及び記録媒体

    3806072

    Patent

Awards

  • Outstanding Paper Award

    2020.12   IEEE International Conference on Teaching, Assessment, and Learning for Engineering   Design of Typing Skills Feedback System for Behavior Change

    Winner: T. Takahashi, M. Honjo, A. Yoneyama, M. Uchida

  • MWS優秀論文賞

    2020.10   コンピュータセキュリティシンポジウム (CSS 2020)   Androidマルウェアの家系図作成

    Winner: 野村和也 (早大), 千葉大紀 (NTT), 秋山満昭 (NTT), 内田真人 (早大)

  • CSS奨励賞

    2020.10   コンピュータセキュリティシンポジウム (CSS 2020)   未割り当てIPアドレスの経路広告の実態調査

    Winner: 五島健太朗 (早大), 澁谷晃 (JPNIC), 岡田雅之 (長崎県立大), 内田真人 (早大)

  • MWS論文賞

    2019.10   情報処理学会 コンピュータセキュリティシンポジウム   ドメインパーキングを利用するドメイン名の大規模実態調査

    Winner: 戸祭隆行, 千葉 大紀, 秋山 満昭, 内田 真人

  • CSS学生論文賞

    2019.10   情報処理学会 コンピュータセキュリティシンポジウム   クラウドサービス悪用攻撃の大規模実態調査

    Winner: 福士 直翼, 千葉 大紀, 秋山 満昭, 内田 真人

  • FIT論文賞

    2019.09   情報処理学会 情報科学技術フォーラム   情報理論に基づいた高信頼かつ高効率なハンドサインの設計

    Winner: 高橋 時生, 内田 真人

  • 活動功労賞

    2016.09   電子情報通信学会 通信ソサイエティ  

    Winner: 内田 真人

  • Best Poster Award

    2014.12   SCIS & ISIS 2014   Unsupervised Weight Parameter Estimation for Exponential Mixture Distribution based on Symmetric Kullback-Leibler Divergence

    Winner: Masato Uchida

  • 功労賞

    2012.07   電子情報通信学会 コミュニケーションクオリティ研究会  

    Winner: 内田 真人

  • 通信ソサイエティ マガジン論文賞

    2012.05   電子情報通信学会   DTN技術の現状と展望

    Winner: 鶴 正人, 内田 真人, 滝根 哲哉, 永田 晃, 松田 崇弘, 巳波 弘佳, 山村 新也

  • ネットワークシステム研究賞

    2012.03   電子情報通信学会ネットワークシステム研究会   時間周期的パケットサンプリングの統計的性質とその異常トラヒック検知への応用

    Winner: 内田 真人, 縄田 秀一, Yu Gu, 鶴 正人, 尾家 祐二

  • ベストオーサー賞

    2011.09   応用数理学会   電子メールを媒介としたコンピューターウイルス感染拡大モデル

    Winner: 佐藤 大輔, 内田 真人

  • 電気通信普及財団賞(テレコムシステム技術賞)

    2010.03   財団法人電気通信普及財団   Identifying Heavy-Hitter Flows From Sampled Flow Statistics

    Winner: 森 達哉, 滝根 哲哉, Jianping Pan, 川原 亮一, 内田 真人, 後藤 滋樹

  • 論文賞

    2009.05   電子情報通信学会   Identifying Heavy-Hitter Flows From Sampled Flow Statistics

    Winner: 森 達哉, 滝根 哲哉, Jianping Pan, 川原 亮一, 内田 真人, 後藤 滋樹

  • 学術奨励賞

    2004.03   電子情報通信学会   Pure型P2Pの方式評価に向けたトポロジ推定法/Pure型P2Pにおける検索方式の検討

    Winner: 内田 真人

  • 奨励賞

    2003.07   電子情報通信学会 コミュニケーションクオリティ研究会   極値理論に基づくトラヒックデータ分析

▼display all

Research Projects

  • A Study on White Boxing of Malicious Domain Name Detection System Using Machine Learning

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research Grant-in-Aid for Scientific Research (C)

    Project Year :

    2020.04
    -
    2023.03
     

  • リアルタイム群集流動制御に関する基盤技術の研究開発

    学振  基盤研究(B)

    Project Year :

    2017.04
    -
    2021.03
     

    内田 真人

  • 観測空間上の情報量を用いた確率モデルの探索・生成・統合に基づくトラヒック行列推定

    学振  基盤研究(C)

    Project Year :

    2017.04
    -
    2020.03
     

    内田 真人

  • 人為的過誤と監視コストを低減するマン・マシン協調による異常トラヒック検出システム

    学振  基盤研究(C)

    Project Year :

    2014.04
    -
    2017.03
     

  • 災害時蓄積搬送型エネルギー流通方式における制御アルゴリズムの設計

    学振  基盤研究(C)

    Project Year :

    2014.04
    -
    2015.03
     

  • 劣通信環境におけるノード移動特性を利用した蓄積搬送型中継転送アルゴリズムの設計

    学振  基盤研究(C)

    Project Year :

    2012.04
    -
    2014.03
     

  • ネットワーク上の資源共用における情報の不完全性/非対称性を考慮した需給調整最適化

    学振  基盤研究(C)

    Project Year :

    2011
    -
    2013
     

    内田 真人

  • 正常トラヒック情報の効率的な抽出と統合モデルによるロバスト異常トラヒック検出技術

    学振  若手研究(B)

    Project Year :

    2009
    -
    2010
     

    内田 真人

  • 劣通信環境における効率的な情報転送制御アルゴリズムの設計

    学振  基盤研究(C)

    Project Year :

    2008
    -
    2010
     

    内田 真人

▼display all

Presentations

  • 人間参加型機械学習によるサイバーセキュリティ

    内田真人

    情報通信マネジメント研究会 

    Presentation date: 2022.01

    Event date:
    2022.01
     
     
  • 異議あり!:XAIによる誤識別された悪性活動の特定

    藤田 晃治, 芝原 俊樹, 千葉 大紀, 秋山 満昭, 内田 真人

    コンピュータセキュリティシンポジウム2021 

    Presentation date: 2021.10

    Event date:
    2021.10
     
     
  • 未割り当てIPアドレスの経路広告の実態調査

    五島 健太朗, 澁谷 晃, 岡田 雅之, 内田 真人

    コンピュータセキュリティシンポジウム2020 

    Presentation date: 2020.10

    Event date:
    2020.10
     
     
  • Androidマルウェアの家系図作成

    野村 和也, 千葉 大紀, 秋山 満昭, 内田 真人

    コンピュータセキュリティシンポジウム2020 

    Presentation date: 2020.10

    Event date:
    2020.10
     
     
  • 行動変容をうながすタイピング技能フィードバックシステムの設計

    高橋 時生, 本庄 勝, 米山 暁夫, 内田 真人

    2020年電子情報通信学会総合大会(新型コロナウイルスの感染拡大防止のため開催中止) 

    Presentation date: 2020.03

  • 不均衡データクラスタリングを用いた機械学習の判断根拠説明における安定化手法の提案

    中野 翔, 内田 真人

    2020年電子情報通信学会総合大会(新型コロナウイルスの感染拡大防止のため開催中止) 

    Presentation date: 2020.03

  • スマホ依存改善のためのアプリ制限機能の使用ユーザ予測

    安冨 勝貴, 浜村 俊傑, 本庄 勝, 米山 暁夫, 内田 真人

    020年電子情報通信学会総合大会(新型コロナウイルスの感染拡大防止のため開催中止) 

    Presentation date: 2020.03

  • 擬似ネットワークトポロジーを用いたODトラヒック行列推定の精度向上

    長谷川 陽平, 内田 真人

    電子情報通信学会 コミュニケーションクオリティ研究会(新型コロナウイルスの感染拡大防止のため開催中止) 

    Presentation date: 2020.03

  • スキャン活動のON/OFFパターンに着目したブラックリストの掲載継続ポリシーの有効性調査

    藤田 孝志, 福士 直翼, 内田 真人

    電子情報通信学会 コミュニケーションクオリティ研究会(新型コロナウイルスの感染拡大防止のため開催中止) 

    Presentation date: 2020.03

  • クラウドサービス悪用攻撃の大規模実態調査

    福士 直翼, 千葉 大紀, 秋山 満昭, 内田 真人

    コンピュータセキュリティシンポジウム2019  (長崎県佐世保市) 

    Presentation date: 2019.10

  • ドメインパーキングを利用するドメイン名の大規模実態調査

    戸祭 隆行, 千葉 大紀, 秋山 満昭, 内田 真人

    コンピュータセキュリティシンポジウム2019  (長崎県佐世保市) 

    Presentation date: 2019.10

  • Ethereumネットワークにおけるスマートコントラクトの経時変化に関する分析

    安冨勝貴, 内田真人

    第18回情報科学技術フォーラム(FIT)  (岡山県岡山市)  情報処理学会

    Presentation date: 2019.09

  • ユーザーの行動パターンに注目したECサイト上の不正取引検知

    野村和也, 小川翔大, 中野翔, 座間味卓臣, 内田真人

    第18回情報科学技術フォーラム(FIT)  (岡山県岡山市)  情報処理学会

    Presentation date: 2019.09

  • 通信状況の可視化によるネットワーク障害の早期検出・分析

    桂康洋, 内田真人

    第18回情報科学技術フォーラム(FIT)  (岡山県岡山市)  情報処理学会

    Presentation date: 2019.09

  • Active LearningとEnsemble Learningを用いた悪性ドメイン名検知システム

    福士 直翼, 千葉 大紀, 高田 雄太, 秋山 満昭, 内田 真人

    コンピュータセキュリティシンポジウム2018 

    Presentation date: 2018.10

  • Q&Aサイトにおける回答者クラスタリングに基づく質問マッチング

    小川 翔大, 内田 真人

    第17回情報科学技術フォーラム 

    Presentation date: 2018.09

  • 論文引用ネットワークを利用した類似研究者検索手法

    中野 翔, 内田 真人

    第17回情報科学技術フォーラム 

    Presentation date: 2018.09

  • 光学レイヤ特性に基づく広域光ネットワークの停止予測

    長谷川 陽平, 内田 真人

    第17回情報科学技術フォーラム 

    Presentation date: 2018.09

  • 情報理論に基づいた高信頼かつ高効率なハンドサインの設計

    高橋 時生, 内田 真人

    第17回情報科学技術フォーラム 

    Presentation date: 2018.09

  • Verification of charge and discharge system composed of multiple lithium ion batteries

    Nobuo Satoh, Atsushi Kosugi, Hiroshi Arai, Masato Uchida

    The 20th International Conference on Electrical Machines and Systems (ICEMS 2018)  (Sydney, Australia) 

    Presentation date: 2018.08

  • 発現量分布の類似性に着目したマイクロアレイ測定データの統合手法の提案

    福士 直翼, 齊藤 秀, 内田 真人

    情報処理学会 バイオ情報学研究会 

    Presentation date: 2018.06

  • 観測データのリサンプリングによる解候補の生成と選別に基づいたODトラヒック行列推定の精度向上

    加瀬 史門, 宮田 高道, 鶴 正人, 内田 真人

    電子情報通信学会 ネットワークシステム研究会 

    Presentation date: 2018.03

  • ODトラヒック行列推定における逆関数法の一般化

    土井 裕貴, 鶴 正人, 内田 真人

    電子情報通信学会 ネットワークシステム研究会 

    Presentation date: 2018.03

  • リチウムイオン電池を用いた充放電システムの構築

    小杉 篤司, 伊藤 遼, 藤縄 隼人, 新井 浩志, 内田 真人, 佐藤 宣夫

    平成29年電気学会全国大会 

    Presentation date: 2017.03

  • 観測フローデータのリサンプリングによるODトラヒック行列推定の精度向上

    加瀬 史門, 内田 真人

    電子情報通信学会 コミュニケーションクオリティ研究会 

    Presentation date: 2017.03

  • Wikipediaネットワークの成長過程とBAモデルの類似性について

    大山 拓海, 内田 真人

    電子情報通信学会 コミュニケーションクオリティ研究会 

    Presentation date: 2017.03

  • 太陽光発電システムにおける充放電制御アルゴリズムの提案とシミュレータの実装

    高須 宏樹, 山口 真弥, 石毛 大貴, 佐藤 宣夫, 内田 真人

    平成28年電気学会全国大会 

    Presentation date: 2016.03

  • リチウムイオン電池の充放電特性に関する一考察

    山口 真弥, 高須 宏樹, 佐藤 宣夫, 内田 真人

    平成28年電気学会全国大会 

    Presentation date: 2016.03

  • MDL基準を用いたネットワークフロー流量分布の推定

    加瀬 史門, 内田 真人

    2016年電子情報通信学会総合大会 

    Presentation date: 2016.03

  • 電気通信事故の発生状況に関する事業者別・発生要因別の統計分析

    石川 優樹, 内田 真人

    2016年電子情報通信学会総合大会 

    Presentation date: 2016.03

  • 非正常パターン検知型異常トラヒック検知における基準モデルの高精度化

    大石 悟史, 会川 諒太, 内田 真人

    2016年電子情報通信学会総合大会 

    Presentation date: 2016.03

  • 複数の基準モデルを用いた非正常パターン検知型異常トラヒック検知

    会川 諒太, 大石 悟史, 内田 真人

    2016年電子情報通信学会総合大会 

    Presentation date: 2016.03

  • 一般化平均を用いた記事類似度による適応的なWikipedia検索

    野口 雄輝, 内田 真人

    2016年電子情報通信学会総合大会 

    Presentation date: 2016.03

  • Wikipediaネットワークのリンク関係推定に関する一考察

    榎波 早敏, 内田 真人

    2016年電子情報通信学会総合大会 

    Presentation date: 2016.03

  • Inferring Origin-Destination Traffic Matrix with Partial Observation on OpenFlow Networks

    Shota Yamashita, Masato Uchida, Masato Tsuru

    Presentation date: 2015.03

    Event date:
    2015.03
     
     
  • 重大な電気通信事故の深刻度レベルに関する分析

    高知尾 遼, 岩井 智宏, 内田 真人

    2015年電子情報通信学会総合大会 

    Presentation date: 2015.03

  • 重大な電気通信事故の発生状況に関する経年変化の分析

    高知尾 遼, 岩井 智宏, 内田 真人

    2015年電子情報通信学会総合大会 

    Presentation date: 2015.03

  • Wikipediaにおける記事情報量分布に関する分析

    近藤 美紗希, 内田 真人

    2015年電子情報通信学会総合大会 

    Presentation date: 2015.03

  • サンプルされたWikipediaネットワークにおける記事引用関係

    榎波 早敏, 内田 真人

    2015年電子情報通信学会総合大会 

    Presentation date: 2015.03

  • 電気通信サービスの事故発生状況に関する統計分析

    内田 真人

    2014年電子情報通信学会ソサイエティ大会 

    Presentation date: 2014.09

  • 非正常パターン検知型異常トラヒック検知におけるヒューマンエラーへの対処に関する研究

    榎波 早敏, 内田 真人

    2014年電子情報通信学会ソサイエティ大会 

    Presentation date: 2014.09

  • 非正常パターン検知型異常トラヒック検知における人的作業コスト抑制に関する研究

    石川 優樹, 内田 真人

    2014年電子情報通信学会ソサイエティ大会 

    Presentation date: 2014.09

  • 非正常パターン検知型異常トラヒック検知におけるネットワーク監視コストの軽減に関する研究

    野口 雄輝, 内田 真人

    2014年電子情報通信学会ソサイエティ大会 

    Presentation date: 2014.09

  • 時間周期的パケットサンプリングを用いたヒューマンエラーに頑健な異常トラヒック検知

    内田 真人

    電子情報通信学会 コミュニケーションクオリティ研究会 

    Presentation date: 2014.07

  • 重大な電気通信事故の発生状況に関する分析

    内田 真人

    電子情報通信学会 コミュニケーションクオリティ研究会 

    Presentation date: 2014.03

  • P2Pデータストレージシステムにおける需給関係の平均モデル

    内田 真人, 飯塚 秀明, 杉野 勲

    電子情報通信学会 コミュニケーションクオリティ研究会 

    Presentation date: 2013.11

  • ネットワークトモグラフィによるODトラヒック行列推定の実用化

    古閑 健一, 内田 真人, 鶴 正人

    電子情報通信学会総合大会 

    Presentation date: 2013.03

    Event date:
    2013.03
     
     
  • 依頼講演:P2Pデータストレージシステムにおける需給関係のマクロモデル

    内田 真人, 飯塚 秀明, 杉野 勲

    2013年電子情報通信学会総合大会 

    Presentation date: 2013.03

  • 極値理論を用いたトラヒックピークレート推定の誤差低減手法

    下川 尚人, 内田 真人, 鶴 正人

    情報処理学会 火の国シンポジウム2012 

    Presentation date: 2012.03

  • P2Pデータストレージシステムにおけるユーザ行動モデルに関する考察

    内田 真人, 飯塚 秀明, 杉野 勲

    電子情報通信学会 コミュニケーションクオリティ研究会 

    Presentation date: 2012.01

  • 大規模ネットワークにおける負荷分散のためのノード次数を利用した経路選択指標に関する検討

    田村 瞳, 内田 真人, 鶴 正人, 尾家 祐二

    電子情報通信学会 ネットワークシステム研究会 

    Presentation date: 2011.03

    Event date:
    2011.03
     
     
  • 時間周期的パケットサンプリングの統計的性質とその異常トラヒック検知への応用

    内田 真人, 縄田 秀一, Yu Gu, 鶴 正人, 尾家 祐二

    電子情報通信学会 ネットワークシステム研究会 

    Presentation date: 2011.03

    Event date:
    2011.03
     
     
  • ネットワークトモグラフィを用いたODトラヒック行列推定における信頼性向上

    田中 喜明, 内田 真人, 鶴 正人

    電子情報通信学会 ネットワークシステム研究会 

    Presentation date: 2011.03

    Event date:
    2011.03
     
     
  • 時間周期的パケットサンプリングの統計的性質とその異常トラヒック検知への応用

    内田 真人, 縄田 秀一, Yu Gu, 鶴 正人, 尾家 祐二

    電子情報通信学会 ネットワークシステム研究会 

    Presentation date: 2011.03

  • 大規模ネットワークにおける負荷分散のためのノード次数を利用した経路選択指標に関する検討

    田村 瞳, 内田 真人, 鶴 正人, 尾家 祐二

    電子情報通信学会 ネットワークシステム研究会 

    Presentation date: 2011.03

  • 妥協可能制約付きネットワーク帯域幅割り当て問題のための不動点最適化手法

    飯塚 秀明, 内田 真人

    電子情報通信学会 コミュニケーションクオリティ研究会 

    Presentation date: 2010.11

  • 時間周期的パケットサンプリングによる教師無しアンサンブル異常検出手法

    縄田 秀一, 内田 真人, Yu Gu, 鶴 正人, 尾家 祐二

    電子情報通信学会 情報ネットワーク研究会 

    Presentation date: 2010.03

    Event date:
    2010.03
     
     
  • Performance Evaluation on TCP Throughputs over IMT-Advanced Mobile Networks

    KAKUDA Kunimasa, IIDUKA Hideaki, UCHIDA Masato, TSURU Masato

    Presentation date: 2010.03

    Event date:
    2010.03
     
     
  • Unsupervised Ensemble Anomaly Detection through Time-Periodical Packet Sampling

    Shuichi Nawata, Masato Uchida, Yu Gu, Masato Tsuru, Yuji Oie

    13th IEEE Global Internet Symposium 2010  (San Diego, CA, USA) 

    Presentation date: 2010.03

  • HDTV映像を対象としたFR型メディアレイヤ映像品質客観評価法の有効性検証

    岡本 淳, 渡辺 敬志郎, 本田 あおい, 内田 真人, 半谷 精一郎

    2010年電子情報通信学会総合大会 

    Presentation date: 2010.03

  • FA機器間接続システムの一検討

    飯塚 秀明, 内田 真人, 福寿 康行, 成澤 孝悦, 寺尾 貴明

    2010年電子情報通信学会総合大会 

    Presentation date: 2010.03

  • FA機器間接続装置の構成法

    福寿 康行, 成澤 孝悦, 寺尾 貴明, 飯塚 秀明, 内田 真人

    2010年電子情報通信学会総合大会 

    Presentation date: 2010.03

  • 集約フロー流量計測からのフロー毎流量統計推定における信頼性向上手法

    田中 喜明, 内田 真人, 鶴 正人

    電子情報通信学会 ネットワークシステム研究会 

    Presentation date: 2010.03

  • Flow-based Path Selection Scheme with Waiting Status in Intermittently Connected Networks

    YAMADA Yuya, TAMURA Hitomi, UCHIDA Masato, TSURU Masato, OIE Yuji

    Presentation date: 2010.03

  • Performance Evaluation of Power Saving Scheme with Dynamic Transmission Capacity Control

    Yutaka Fukuda, Takeshi Ikenaga, Hitomi Tamura, Masato Uchida, Kenji Kawahara, Yuji Oie

    2nd International Workshop on Green Communications (GreenComm2)  (Honolulu, HI, USA) 

    Presentation date: 2009.12

  • Dynamic Link Control with Changing Traffic for Power Saving

    Yutaka Fukuda, Takeshi Ikenaga, Hitomi Tamura, Masato Uchida, Kenji Kawahara, Yuji Oie

    The 34th IEEE Conference on Local Computer Networks (LCN 2009)  (Zurich, Switzerland) 

    Presentation date: 2009.10

  • 距離写像学習ネットワークにおける極大ノイズにロバストなパラメータ推定法に関する検討

    齋藤 拓真, 塩谷 浩之, 内田 真人, 沖井 廣宣

    平成21年度電気・情報関係学会北海道支部連合大会 

    Presentation date: 2009.10

  • HDTVを対象とした映像品質客観評価法の精度向上に向けた一検討

    内田 真人

    2009年電子情報通信学会ソサイエティ大会 

    Presentation date: 2009.09

  • Peak traffic estimation for power-saving network

    Kanemitsu Hiraoaki, Tamura Hitomi, Uchida Masato, Oie Yuji

    Presentation date: 2009.09

  • サービスプラットホームとしてのネットワーク計測の試み ~perfSONARに基づく広域ネットワークの統合的管理を目指して~

    内田 真人

    サービスプラットホームとしてのネットワーク計測の試み ~perfSONARに基づく広域ネットワークの統合的管理を目指して~ 

    Presentation date: 2009.09

  • マルチキャリアシステムに関する共役勾配方向を用いたProportional Fairスケジューラ

    飯塚 秀明, 内田 真人, 鶴 正人, 角田 邦真

    第21回RAMP (Research Association of Mathematical Programming) シンポジウム 

    Presentation date: 2009.09

  • HDTV Objective Video Quality Assessment Method Applying Fuzzy Measure

    Jun Okamoto, Keishiro Watanabe, Aoi Honda, Masato Uchida, Seiichiro Hangai

    First International Workshop on Quality of Multimedia Experience (QoMEX 2009)  (San Diego, CA, USA) 

    Presentation date: 2009.07

  • On Storage Capacity Control Methods for Fault-Tolerant Peer-to-Peer Storage System

    IIDUKA Hideaki, UCHIDA Masato, TSURU Masato, OIE Yuji

    Presentation date: 2009.07

  • Path Selection Scheme for Traffic Load Distribution Considering the Characteristics of Network Topology

    Jun’ichi Shimada, Nobumasa Natsui, Hitomi Tamura, Takeshi Ikenaga, Masato Uchida, Yuji Oie

    The 13th IEEE International Symposium on Consumer Electronics (ISCE 2009)  (Kyoto, Japan) 

    Presentation date: 2009.05

  • An Information-Theoretic Characterization of Weighted α-Proportional Fairness

    Masato Uchida, Jim Kurose

    The 28th IEEE International Conference on Computer Communications (IEEE Infocom 2009 (main-conference))  (Rio de Janeiro, Brazil) 

    Presentation date: 2009.04

  • On the Quality of Triangle Inequality Violation Aware Routing Overlay Architecture

    Ryoichi Kawahara, Eng Keong Lua, Masato Uchida, Satoshi Kamei, Hideaki Yoshino

    The 28th IEEE International Conference on Computer Communications (IEEE Infocom 2009 (mini-conference))  (Rio de Janeiro, Brazil) 

    Presentation date: 2009.04

  • Locating Causal Segments Along A Performance-Degraded End-to-End Path

    Yuki Sakai, Masato Uchida, Masato Tsuru, Yuji Oie

    The 10th Passive and Active Measurement Conference (PAM 2009)  (Seoul, South Korea) 

    Presentation date: 2009.04

  • 生存時間解析を用いた打切データからのフロー持続時間分布の推定

    坂井 裕樹, 内田 真人, 鶴 正人, 尾家 祐二

    電子情報通信学会技術報告(ネットワークシステム研究会) 

    Presentation date: 2009.03

    Event date:
    2009.03
     
     
  • Analysis of threshold network model based on extreme value theory and universal power laws

    FUJIHARA Akihiro, UCHIDA Masato, MIWA Hiroyoshi

    Presentation date: 2009.03

    Event date:
    2009.03
     
     
  • 車両による蓄積運搬型通信を用いた新ネットワークインフラの検討

    山村 新也, 永田 晃, 内田 真人, 鶴 正人

    電子情報通信学会技術報告(ネットワークシステム研究会) 

    Presentation date: 2009.03

  • Data Forwarding over Multiple Communication Channels for Challenged Networks

    NAGATA Akira, YAMAMURA Shinya, UCHIDA Masato, TSURU Masato

    Presentation date: 2009.03

  • 実ネットワークにおける集約フロー流量からのフロー毎流量統計の推定

    田中 喜明, 立花 大祐, 内田 真人, 鶴 正人

    情報処理学会 火の国シンポジウム2009 

    Presentation date: 2009.03

  • Path selection scheme for traffic load distribution considering the characteristics of network topology

    Jun'ichi Shimada, Nobumasa Natsui, Hitomi Tamura, Takeshi Ikenaga, Masato Uchida, Yuji Oie

    Presentation date: 2009.03

  • Experimental Evaluation on a Network-Tomographic Traffic Matrix Inference Method

    TACHIBANA D, TANAKA Y, UCHIDA M, TSURU M, OIE Y

    Presentation date: 2009.01

    Event date:
    2009.01
     
     
  • Overlay Routing with Acceptable Waiting Time for Unstably Fluctuated Network Environments(jointly worked)

    Yuya Yamada, Hitomi Tamura, Masato Uchida, Masato Tsuru, Yuji Oie

    The International Conference on Information Networking 2009 (ICOIN 2009)  (Chiang Mai, Thailand) 

    Presentation date: 2009.01

  • Virtual Segment: Segmentation Method for Store-carry-forward Routing Schemes(jointly worked)

    Shinya Yamamura, Akira Nagata, Masato Uchida, Masato Tsuru

    1st Workshop on Wireless Broadband Access for Communities and Rural Developing Regions (WIRELESS4D 2008)  (Karlstad, Sweden) 

    Presentation date: 2008.12

  • 断続的接続環境における許容待機時間付きオーバーレイルーティング

    山田 裕也, 田村 瞳, 内田 真人, 鶴 正人, 尾家 祐二

    電子情報通信学会(コミュニケーションクオリティ研究会) 

    Presentation date: 2008.11

  • 劣通信環境における複数通信路を活用したデータ転送方式

    永田 晃, 山村 新也, 内田 真人, 鶴 正人

    電子情報通信学会(ネットワークシステム研究会) 

    Presentation date: 2008.10

  • TCP Performance over Evolved UTRA and UTRAN with Time-Frequency Scheduling(jointly worked)

    Masaru Hirose, Masato Uchida, Masato Tsuru, Yuji Oie

    International Conference on the Latest Advances in Networks (ICLAN 2008)  (Toulouse, France) 

    Presentation date: 2008.10

  • Quality Evaluations of Network Services Using a Non-Additive Set Function(jointly worked)

    Daisuke Mori, Aoi Honda, Masato Uchida, Yoshiaki Okazaki

    Modeling Decisions for Artificial Intelligence (MDAI 2008)  (Catalonia, Spain) 

    Presentation date: 2008.10

  • Proxy Data Transfer System with Stable Control Channel and Dynamically Changing Data Channels(jointly worked)

    Akira Nagata, Shinya Yamamura, Masato Uchida, Masato Tsuru

    ACM Mobicom Workshop on Challenged Networks (CHANTS 2008)  (Francisco, CA, USA) 

    Presentation date: 2008.09

  • Mixture Model based Representation of Information Integration(jointly worked)

    Masato Uchida, Hiroyuki Shioya, Yousuke Maehara

    Joint 4th International Conference on Soft Computing and Intelligent Systems and 9th International Symposium on advanced Intelligent Systems (SCIS & ISIS 2008)  (Nagoya, Japan) 

    Presentation date: 2008.09

  • Thermal Diffusion-based Access Load Balancing for P2P File Sharing Networks(jointly worked)

    Masanori Takaoka, Kei Ohnishi, Masato Uchida, Yuji Oie

    The 1st International Workshop on Computational P2P Networks: Theory & Practice (ComP2P 2008)  (Athens, Greece) 

    Presentation date: 2008.08

  • Scaling Properties of Complex Networks: Towards Wilsonian Renormalization for Complex Networks(jointly worked)

    Kento Ichikawa, Masato Uchida, Masato Tsuru, Yuji Oie

    PHYSCOMNET 2008  (Berlin, Germany) 

    Presentation date: 2008.04

  • オーバーレイネットワークのための空間・時間領域を考慮したトラヒックエンジニアリングの提案

    山田 裕也, 田村 瞳, 内田 真人, 鶴 正人, 尾家 祐二

    電子情報通信学会(テレコミュニケーションマネジメント研究会) 

    Presentation date: 2008.03

  • 教師なしアンサンブル学習に関する検討 ~集合知の情報論的モデル化~

    内田 真人, 前原 洋祐, 塩谷 浩之

    電子情報通信学会 ニューロコンピューティング研究会 

    Presentation date: 2008.01

    Event date:
    2008.01
     
     
  • 教師なしアンサンブル学習に関する検討~集合知の情報論的モデル化~

    内田 真人, 前原 洋祐, 塩谷 浩之

    電子情報通信学会(ニューロコンピューティング研究会) 

    Presentation date: 2008.01

  • Design of an Unsupervised Weight Parameter Estimation Method in Ensemble Learning(jointly worked)

    Masato Uchida, Yousuke Maehara, Hiroyuki Shioya

    ICONIP 2007  (Kitakyushu, Japan) 

    Presentation date: 2007.11

  • 指数型混合モデルに基づくアンサンブル学習に関する一検討

    内田 真人

    平成19年度電気・情報関係学会北海道支部連合大会 

    Presentation date: 2007.10

  • Information Theoretic Aspects of Fairness Criteria in Network Resource Allocation Problems

    Masato Uchida

    GameComm 2007  (Nantes, France) 

    Presentation date: 2007.10

  • Adaptive File Replication to Dynamic Change in Access Frequency to Peers in Unstructured P2P Networks

    TAKAOA Masanori, OHNISHI Kei, UCHIDA Masato, OIE Yuji

    Presentation date: 2007.09

    Event date:
    2007.09
     
     
  • Performance evaluation of overlay routing handling multiple QoS metrics

    Kawahara Ryoichi, Kamei Satoshi, Lua Eng Keong, Uchida Masato, Yoshino Hideaki

    Presentation date: 2007.09

    Event date:
    2007.09
     
     
  • Experimental Evaluation on Flow Rate Statistics Inference

    Tachibana Daisuke, Uchida Masato, Tsuru Masato, Oie Yuji

    Presentation date: 2007.09

    Event date:
    2007.09
     
     
  • QoSオーバーレイルーティングの性能評価と様々なQoSメトリックへの適用(jointly worked)

    川原 亮一, Eng Keong Lua, 内田 真人, 亀井 聡, 吉野 秀明

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2007.09

  • 複数QoS metricを考慮したQoSオーバーレイ経路制御の性能評価

    川原 亮一, 亀井 聡, Eng Keong Lua, 内田 真人, 吉野 秀明

    2007年電子情報通信学会ソサイエティ大会 

    Presentation date: 2007.09

  • TCP Flow Level Performance Evaluation on Packet Combining Hybrid ARQ in Evolved UTRA and UTRAN Network(jointly worked)

    Yan Zhang, Masato Uchida, Masato Tsuru, Yuji Oie

    WWC 2007  (San Francisco, CA, USA) 

    Presentation date: 2007.05

  • 教師なしアンサンブル学習の定式化とその評価

    内田 真人, 前原 洋祐, 塩谷 浩之

    電子情報通信学会技術報告(ニューロコンピューティング研究会) 

    Presentation date: 2007.03

    Event date:
    2007.03
     
     
  • Traffic Reduction in DTN by Efficient Information Delivery

    MORIYAMA Atsufumi, TAKAHASHI Masao, UCHIDA Masato, TSURU Masato

    Presentation date: 2007.03

    Event date:
    2007.03
     
     
  • サンプリングに基づくフローサイズ分布推定法

    橋本 英憲, 巳波 弘佳, 内田 真人

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2007.03

    Event date:
    2007.03
     
     
  • Riccati方程式によるソフトウェア信頼度成長モデル

    佐藤 大輔, 内田 真人

    日本オペレーションズリサーチ学会 

    Presentation date: 2007.03

  • Can error rate considered scheduling support TCP performance comparable to packet combining HARQ in evolved UTRA and UTRAN networks?(jointly worked)

    Yan Zhang, Masato Uchida, Masato Tsuru, Yuji Oie

    ECUMN 2007  (Toulouse, France) 

    Presentation date: 2007.02

  • Network Topology Generation via Temporal Paterns of Node Activity and Inactivity

    OHNISHI Kei, UCHIDA Masato, OIE Yuji

    Presentation date: 2006.12

    Event date:
    2006.12
     
     
  • 遺伝子型分布遷移モデルへのアンサンブル学習の導入

    前原 洋祐, 大場 巨章, 内田 真人, 塩谷 浩之

    平成18年度電気・情報関係学会北海道支部連合大会 

    Presentation date: 2006.10

  • Dynamic Storage Load Balancing with Analogy to Thermal Diffusion for P2P File Sharing(jointly worked)

    Masato Uchida, Kei Ohnishi, Kento Ichikawa, Masato Tsuru, Yuji Oie

    Inter-Perf 2006  (Pisa, Italy) 

    Presentation date: 2006.10

  • QoSオーバーレイ経路選択アルゴリズムのトラヒック変動への追従性

    川原 亮一, 内田 真人, 亀井 聡

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2006.09

    Event date:
    2006.09
     
     
  • 進化的最適化過程に出現するネットワーク

    大西 圭, 内田 真人, 尾家 祐二

    第22回ファジィシステムシンポジウム 

    Presentation date: 2006.09

  • Unsupervised Weight Parameter Estimation Method for Ensemble Learning(jointly worked)

    Masato Uchida, Yousuke Maehara, Hiroyuki Shioya, Wen-Tao Huang

    SCIS & ISIS 2006  (Tokyo, Japan) 

    Presentation date: 2006.09

  • Network Topologies Emerging in An Evolutionary Optimization Process(jointly worked)

    Kei Ohnishi, Masato Uchida, Yuji Oie

    SCIS & ISIS 2006  (Tokyo, Japan) 

    Presentation date: 2006.09

  • Effect of Introducing Predictive CIR on Throughput Performance in HSDPA Networks(jointly worked)

    Yan Zhang, Masato Uchida, Masato Tsuru, Yuji Oie

    PIMRC 2006  (Helsinki, Finland) 

    Presentation date: 2006.09

  • Scheduling algorithms with error rate consideration in HSDPA networks(jointly worked)

    Yan Zhang, Masato Uchida, Masato Tsuru, Yuji Oie

    IWCMC 2006  (Vancouver, Canada) 

    Presentation date: 2006.07

  • ピアによるファイル提供の局所制御に基づくストレージ負荷分散(共著)

    大西 圭, 市川 憲人, 山本 寛, 内田 真人, 尾家 祐二

    電子情報通信学会技術報告(インターネットアーキテクチャ研究会) 

    Presentation date: 2006.05

  • Storage Load Balancing via Local Interactions Among Peers in Unstructured P2P Networks(jointly worked)

    Kei Ohnishi, Hiroshi Yamamoto, Kento Ichikawa, Masato Uchida, Yuji Oie

    P2PIM2006  (Hong Kong, China) 

    Presentation date: 2006.05

  • 招待講演:非構造型P2Pファイル共有アプリケーションにおける検索効率と負荷分散の両立を目指した複製配置手法

    内田 真人

    日本オペレーションズリサーチ学会 KSMAP研究会 

    Presentation date: 2006.03

  • QoS overlay routing algorithm with limited number of alternative route candidates and its evaluation

    KAWAHARA Ryoichi, KAMEI Satoshi, UCHIDA Masato, ABE Takeo

    Presentation date: 2006.03

    Event date:
    2006.03
     
     
  • P2Pファイル共有アプリケーションにおける負荷分散を実現する複製配置手法~熱拡散現象とのアナロジー~(共著)

    市川 憲人, 大西 圭, 内田 真人, 鶴 正人, 尾家 祐二

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2006.03

  • 迂回経路候補数に制限がある場合のQoSオーバーレイ経路選択アルゴリズム(共著)

    川原 亮一, 亀井 聡, 内田 真人, 阿部 威朗

    2006年電子情報通信学会総合大会 

    Presentation date: 2006

  • Performance Evaluation of QoS-aware Routing in Overlay Network(jointly worked)

    Masato Uchida, Satoshi Kamei, Ryoichi Kawahara

    ICOIN2006  (Sendai, Japan) 

    Presentation date: 2006.01

  • Evolved UTRA and UTRANネットワークにおけるパケット合成型Hybrid ARQの性能評価

    山本 篤, 山本 寛, 塚本 和也, 内田 真人, 鶴 正人, 尾家 祐二

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2006.01

  • 大規模分散環境における品質把握に向けたクラスタ化手法の検討

    亀井 聡, 内田 真人, 川原 亮一

    2005年電子情報通信学会ソサイエティ大会 

    Presentation date: 2005.09

  • オーバーレイルーティングの効率化に関する評価

    内田 真人, 亀井 聡, 川原 亮一

    2005年電子情報通信学会ソサイエティ大会 

    Presentation date: 2005.09

  • オーバーレイルーティングへのP2P技術の応用(共著)

    亀井 聡, 内田 真人, 川原 亮一, 阿部 威郎  [Invited]

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2005.07

  • オーバレイネットワークによるQoSルーチング制御に関する評価

    内田 真人, 亀井 聡, 川原 亮一

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2005.07

  • Replication Scheme for Traffic Load Balancing and Its Parameter Tuning in Pure P2P Communication(jointly worked)

    Shinya Nogami, Masato Uchida, Takeo Abe

    AHSP2005  (Jiuzhaigou, China) 

    Presentation date: 2005.04

  • Modeling Viral Spread by Random Scanning and Its Relationship with the Epidemiological Model

    Masato Uchida

    SSN2005  (Denver, CO, USA) 

    Presentation date: 2005.04

  • Evaluation of Path Selection for Overly QoS Control

    Uchida Masato, Kamei Satoshi, Kawahara Ryoichi, Abe Takeo

    Presentation date: 2005.03

    Event date:
    2005.03
     
     
  • エンドホストオーバーレイネットワークを用いたトラヒックエンジニアリングアーキテクチャの提案

    亀井 聡, 内田 真人, 川原 亮一, 阿部 威郎

    2005年電子情報通信学会総合大会 

    Presentation date: 2005.03

  • Traffic Data Analysis Based on Extreme Value Theory and Its Applications

    Masato Uchida

    Globecom2004 

    Presentation date: 2004.12

  • アンサンブル学習における指数型混合モデル手法とAdaBoostとの比較

    前原 洋祐, 内田 真人, 塩谷 浩之

    平成16年度電気・情報関係学会北海道支部連合大会 

    Presentation date: 2004.10

  • Identifying elephant flows through periodically sampled packets(jointly worked)

    Tatsuya Mori, Masato Uchida, Ryoichi Kawahara, Jianping Pan, Shigeki Goto

    IMC 2004 

    Presentation date: 2004.10

  • オーバーレイネットワークにおけるQoSルーチング制御に関する考察

    内田 真人, 木村 卓巳, 川原 亮一, 亀井 聡, 森 達哉, 能上 慎也, 阿部 威郎

    電子情報通信学会ソサイエティ大会 

    Presentation date: 2004.09

  • オーバレイネットワークを用いたトラヒック制御

    木村 卓巳, 内田 真人, 川原 亮一, 亀井 聡, 森 達哉, 能上 慎也, 阿部 威郎

    2004年電子情報通信学会ソサイエティ大会 

    Presentation date: 2004.09

  • メール型コンピュータウィルス拡散モデル

    佐藤 大輔, 内田 真人, 石橋 圭介, 小林 真

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2004.07

    Event date:
    2004.07
     
     
  • コンピュータウィルス拡散過程の数理モデル化と解析

    内田 真人, 佐藤 大輔

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2004

    Event date:
    2004.07
     
     
  • Identifying elephant flows from sampled packet stream

    MORI Tatsuya, UCHIDA Masato, KAWAHARA Ryoichi, GOTO Shigeki

    Presentation date: 2004.07

    Event date:
    2004.07
     
     
  • A New Traffic Control Paradigm using Overlay Networks

    KIMURA Takumi, UCHIDA Masato, KAWAHARA Ryoichi, KAMEI Satoshi, MORI Tatsuya, NOGAMI Shinya, ABE Takeo

    Presentation date: 2004.07

    Event date:
    2004.07
     
     
  • サンプルしたパケットからエレファントフローを特定する手法

    森 達哉, 内田 真人, 川原 亮一, 後藤 滋樹

    電子情報通信学会技術報告(ネットワークシステム研究会) 

    Presentation date: 2004.04

    Event date:
    2004.04
     
     
  • A Proposal of Decentralized Topology Control for Unstructured Overlay Networks

    Kimura Takumi, Kamei Satoshi, Mori Tatsuya, Uchida Masato, Sumita Shuichi, Abe Takeo

    Presentation date: 2004.03

    Event date:
    2004.03
     
     
  • Identifying elephant flows using packet sampling

    Mori Tatsuya, Uchida Masato, Kawahara Ryoichi, Goto Shigeki

    Presentation date: 2004.03

    Event date:
    2004.03
     
     
  • Measurement Study for Scale of Peer-to-peer Network

    KAMEI Satoshi, UCHIDA Masato

    Presentation date: 2004.03

    Event date:
    2004.03
     
     
  • メール型コンピュータウィルス拡散過程モデルの提案

    佐藤 大輔, 内田 真人, 石橋 圭介, 小林 真

    日本オペレーションズリサーチ学会, 2004春季研究発表会 

    Presentation date: 2004.03

  • コンピュータウィルス拡散過程の解析

    内田 真人, 佐藤 大輔

    日本オペレーションズリサーチ学会, 2004春季研究発表会 

    Presentation date: 2004.03

  • コンピュータウィルス拡散過程のモデル化に関する検討

    内田 真人, 佐藤 大輔

    2004年電子情報通信学会総合大会 

    Presentation date: 2004.03

  • Pure型P2Pにおけるファイル検索&レプリケーションについて

    能上 慎也, 内田 真人

    2004年電子情報通信学会総合大会 

    Presentation date: 2004.03

  • P2Pネットワークの規模推定法

    亀井 聡, 内田 真人

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2004.02

    Event date:
    2004.02
     
     
  • サンプルパケットによって構成されるフロー統計の評価

    森 達哉, 内田 真人, 川原 亮一, 後藤 滋樹

    2004年電子情報通信学会ソサイエティ大会 

    Presentation date: 2004

  • Hop-value-based Query-packet Forwarding for Pure P2P(jointly worked)

    Masato Uchida, Shinya Nogami

    CQR 2004 

    Presentation date: 2004

  • 極値理論に基づくトラヒックデータ分析の推定精度

    内田 真人

    電子情報通信学会技術報告(情報ネットワーク研究会) 

    Presentation date: 2003.12

  • 極値理論に基づくトラヒックデータ分析における推定手法の比較~最尤法とモーメント法の比較~

    内田 真人

    電子情報通信学会技術報告(ネットワークシステム研究会) 

    Presentation date: 2003.11

  • Pure型P2Pにおける検索方式の検討

    内田 真人, 能上 慎也

    2003年電子情報通信学会ソサイエティ大会 

    Presentation date: 2003.09

  • Topology Estimation Method and Search Method for Pure P2P

    UCHIDA Masato, NOGAMI Shinya

    Presentation date: 2003.02

    Event date:
    2003.02
     
     
  • 不定性を利用した分布間情報量の拡張に関する一検討

    内田 真人, 塩谷 浩之

    電子情報通信学会技術報告(ニューロコンピューティング研究会) 

    Presentation date: 2003.02

  • Pure型P2Pにおけるトポロジ推定法, および検索方式について

    内田 真人, 能上 慎也

    電子情報通信学会技術報告(コミュニケーションクオリティ研究会) 

    Presentation date: 2003.02

  • 極値理論を用いたトラヒックデータ分析

    内田 真人

    2002年電子情報通信学会ソサイエティ大会 

    Presentation date: 2002.09

  • 拡張混合表現を用いた学習と遺伝子型分布

    塩谷 浩之, 内田 真人

    情報処理学会 数理モデル化と問題解決研究会 

    Presentation date: 2002.09

  • P2Pにおけるトラヒック制御に関する考察

    能上 慎也, 内田 真人

    2002年電子情報通信学会ソサイエティ大会 

    Presentation date: 2002.09

  • 極値理論に基づくトラヒックデータ分析

    内田 真人

    電子情報通信学会技術報告(コミュニケーションクオリティ研究会) 

    Presentation date: 2002.07

  • ユーザ満足度を考慮した通信品質目標値決定法

    内田 真人, 佐藤 大輔, 阿部 威郎

    電子情報通信学会技術報告(ネットワークシステム研究会) 

    Presentation date: 2002.04

  • SLAに基づく通信品質目標値の決定方法

    内田 真人, 佐藤 大輔, 阿部 威郎

    2002年電子情報通信学会総合大会 

    Presentation date: 2002.03

  • Regularization Term of Multi Layer Perceptrons

    UCHIDA Masato, SHIOYA Hiroyuki, DA-TE Tsutomu

    Presentation date: 1999.10

    Event date:
    1999.10
     
     
  • アンサンブル学習の理論的モデル化に関する一検討

    内田 真人, 塩谷 浩之, 伊達 惇

    電子情報通信学会技術報告(ニューロコンピューティング研究会) 

    Presentation date: 1999.10

▼display all

Specific Research

  • リサンプリングによる弱解集合の生成とその分布傾向を考慮したトラヒック行列推定

    2017  

     View Summary

    直接観測することが困難な対地間フロー流量を,それらが通過するルータにおいて容易に観測できる集約されたフロー流量(集約フロー流量)から推定する問題はトラヒック行列推定問題と呼ばれる.本研究では,トラヒック行列推定の精度を,非観測空間(対地間フロー流量が取り得る状態の集合)上ではなく,観測空間(集約フロー流量が取り得る状態の集合)上において間接評価する手法を提案した.また,集約フロー流量の観測データのリサンプリングにより生成される多様な解候補の分布傾向を考慮した推定手法を提案した.さらに,従来手法における「対地間フロー流量がゼロとなる確率が正である」という仮定を必要としない一般化手法を提案した.

 

Syllabus

▼display all

 

Committee Memberships

  • 2018.10
    -
    Now

    総務省 情報通信審議会 電気通信事業政策部会 電気通信事業分野における競争ルール等の包括的検証に関する特別委員会  専門委員

  • 2016.08
    -
    Now

    日本ネットワークインフォメーションセンター  評議委員

  • 2016.06
    -
    Now

    電子情報通信学会 英文論文誌B編集委員会  査読委員

  • 2016.04
    -
    Now

    総務省 情報通信審議会 電気通信事業政策部会 電話網移行円滑化委員会  専門委員

  • 2015.05
    -
    Now

    総務省 電気通信事故検証会議  構成員(座長代理)

  • 2014.05
    -
    Now

    総務省 情報通信審議会 情報通信技術分科会 IPネットワーク設備委員会  専門委員

  • 2012.04
    -
    Now

    総務省 情報通信審議会 情報通信技術分科会 IPネットワーク設備委員会 安全・信頼性検討作業班  構成員

  • 2011.07
    -
    Now

    電子情報通信学会 情報ネットワーク科学時限研究専門委員会  専門委員

  • 2022.10
    -
    2026.03

    総務省 「非常時における業者間ローミング等に関する検討会」  構成員

  • 2022.10
    -
    2023.03

    総務省 電気通信事故検証会議 「周知広報・連絡体制ワーキンググループ」  構成員

  • 2022.05
    -
    2023.03

    総務省 「技術検討作業班」  主任

  • 2019.09
    -
    2023.03

    東日本電信電話株式会社  データ主導経済における通信事業戦略に関する研究会

  • 2019.05
    -
    2023.03

    NTTドコモ  情報通信制度に関する研究会 委員

  • 2022.05
    -
    2023.01

    総務省情報通信審議会情報通信技術分科会IPネットワーク設備委員会  技術検討作業班 主任

  • 2021.03
    -
    2023.01

    総務省  事故報告・検証制度等タスクフォース 主任

  • 2020.11
    -
    2021.03

    総務省  スイッチング円滑化タスクフォース 構成員

  • 2020.11
    -
    2021.03

    総務省  インターネットトラフィック研究会 構成員

  • 2020.06
    -
    2020.12

    総務省 情報通信審議会情報通信技術分科会  技術検討作業班 主任

  • 2019.05
    -
    2020.03

    三菱総合研究所  全国瞬時警報システム更新に関わる有識者ワーキンググループ 構成員

  • 2019.05
    -
    2020.03

    情報通信総合研究所  2030年頃のデジタル社会基盤の在り方に関する意見交換会 委員

  • 2017.04
    -
    2019.04

    総務省 情報通信行政・郵政行政審議会 電気通信事業部会 ユニバーサルサービス委員会  専門委員

  • 2017.04
    -
    2019.04

    総務省 情報通信行政・郵政行政審議会 電気通信事業部会 接続委員会  専門委員

  • 2017.04
    -
    2019.04

    総務省 情報通信行政・郵政行政審議会  専門委員

  • 2012.05
    -
    2018.05

    電子情報通信学会 ネットワークシステム研究専門委員会  専門委員

  • 2017.01
    -
    2017.06

    総務省 将来のネットワークインフラに関する研究会  構成員

  • 2006.05
    -
    2017.05

    電子情報通信学会 コミュニケーションクオリティ研究専門委員会  専門委員

  • 2013.01
    -
    2017.03

    三菱総合研究所 ネットワークの安全性・信頼性対策に関する調査検討会  座長

  • 2011.05
    -
    2016.06

    電子情報通信学会 英文論文誌B編集委員会  編集委員

  • 2013.12
    -
    2014.12

    総務省 0AB-J IP電話の品質要件の在り方に関する検討会  構成員

  • 2013.04
    -
    2013.10

    総務省 多様化・複雑化する電気通信事故の防止の在り方に関する検討会  構成員

  • 2012.02
    -
    2012.03

    みずほ総合研究所 IPネットワークの高度化に対応した安全・信頼性対策に関する調査検討会  座長

  • 2011.01
    -
    2011.06

    三菱総合研究所 アクセス回線の光化等に対応した重要通信の確保等に関する検討会  座長

▼display all