Updated on 2022/05/25

写真a

 
UCHIDA, Masato
 
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

  • 2020
    -
    2022

    理工学術院総合研究所   兼任研究員

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 network

Research Interests

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

Papers

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

    Naoki Fukushi, Daiki Chiba, Mitsuaki Akiyama, Masato Uchida

    IEICE Transactions on Communications   E103-B ( 4 )  2020.04  [Refereed]

  • Welcome Message from WIND 2016 Workshop Chairs

    Masaki Aida, Mario Koeppen, Layth Sliman, Hiroyoshi Miwa, Neng-Fa Zhou, Masato Tsuru, Masato Uchida

    Proceedings - 2016 International Conference on Intelligent Networking and Collaborative Systems, IEEE INCoS 2016     xxxix - xl  2016.10  [Refereed]

    DOI

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

    Masato Uchida

    KNOWLEDGE-BASED SYSTEMS   106   242 - 250  2016.08

     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

  • Unsupervised weight parameter estimation for exponential mixture distribution based on symmetric kullback-leibler divergence

    Masato Uchida

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E98A ( 11 ) 2349 - 2353  2015.11  [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

  • Modeling User Behavior in P2P Data Storage System

    Masato Uchida, Hideaki Iiduka, Isao Sugino

    IEICE TRANSACTIONS ON COMMUNICATIONS   E98B ( 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

  • 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

  • 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 and Systems   E96-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

  • Unsupervised Ensemble Anomaly Detection Using Time-Periodic Packet Sampling

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

    IEICE TRANSACTIONS ON COMMUNICATIONS   E95B ( 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

  • Discrete Modeling of the Worm Spread with Random Scanning

    Masato Uchida

    IEICE TRANSACTIONS ON COMMUNICATIONS   E95B ( 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

  • 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

  • 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

  • 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 AND SYSTEMS   E94D ( 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

  • 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

  • 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

  • Node degree-aware link cost for traffic load-distribution in large-scale networks

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

    Proceedings - 3rd IEEE International Conference on Intelligent Networking and Collaborative Systems, INCoS 2011     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

  • 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

    Proceedings - 11th IEEE/IPSJ International Symposium on Applications and the Internet, SAINT 2011     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

  • 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   E93-B ( 5 ) 1140-1150  2010.05  [Refereed]

    DOI

  • 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   E93B ( 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

  • 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

  • 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  2009.11  [Refereed]

    DOI

  • 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 AND SYSTEMS   E92D ( 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

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

    Masato Uchida, Jim Kurose

    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5     1053 - +  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.

  • On the quality of triangle inequality violation aware routing overlay architecture

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

    Proceedings - IEEE 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

  • 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]

  • TCP flow level performance evaluation on error rate aware scheduling algorithms in Evolved UTRA and UTRAN networks

    Yan Zhang, Masato Uchida, Masato Tsuru, Yuji Oie

    IEICE TRANSACTIONS ON COMMUNICATIONS   E91B ( 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

  • Design of an unsupervised weight parameter estimation method in ensemble learning

    Masato Uchida, Yousuke Maehara, Hiroyuki Shioya

    NEURAL INFORMATION PROCESSING, PART I   4984   771 - +  2008  [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.

  • 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 Annual International Conference on Mobile Computing and Networking, MOBICOM     121 - 123  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

  • Identifying heavy-hitter flows from sampled flow statistics

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

    IEICE TRANSACTIONS ON COMMUNICATIONS   E90B ( 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

  • TCP Flow level Performance evaluation on packet combining Hybrid ARQ inevolved UTRA and UTRAN network

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

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

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

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

    Proc. 4th European Conference on Universal Multiservice Networks    2007.02  [Refereed]

  • 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

  • Evolution and Learning Mediated by Difference in Developmental Timing

    Kei Ohnishi, Masato Uchida, Yuji Oie

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

  • Effect of Introducing Predictive CIR on Throughput Performance in HSDPA Networks

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

    The 17th Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications(PIMRC 2006)    2006.09  [Refereed]

  • 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   E89B ( 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

  • Scheduling algorithms with error rate consideration in HSDPA networks

    Yan Zhang, Masato Uchida, Masato Tsuru, Yuji Oie

    IWCMC 2006 - Proceedings of the 2006 International Wireless Communications and Mobile Computing Conference   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

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

    Masato Uchida, Satoshi Kamei, Ryoichi Kawahara

    Information Networking, Advances in Data Communications and Wireless Networks, International Conference, ICOIN 2006, Sendai, Japan, January 16-19, 2006, Revised Selected Papers     925 - 934  2006  [Refereed]

    DOI

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

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

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

  • Hop-value-based query-packet forwarding for pure P2P

    M Uchida, S Nogami

    IEICE TRANSACTIONS ON COMMUNICATIONS   E88B ( 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

  • 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

  • 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

  • Replication scheme for traffic load balancing and its parameter tuning in pure P2P communication

    Shinya Nogami, Masato Uchida, Takeo Abe

    Proceedings - 2005 International Symposium on Autonomous Decentralized Systems, ISADS 2005   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

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

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

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

  • Traffic data analysis based on extreme value theory and its applications to predicting unknown serious deterioration

    M Uchida

    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS   E87D ( 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.

  • Identifying elephant flows through periodically sampled packets.

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

    Proceedings of the 4th ACM SIGCOMM Internet Measurement Conference, IMC 2004, Taormina, Sicily, Italy, October 25-27, 2004     115 - 120  2004  [Refereed]

    DOI

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

    内田 真人, 塩谷 浩之

    電子情報通信学会論文誌   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

  • BS-3-38 INFERRING ORIGIN-DESTINATION TRAFFIC MATRIX WITH PARTIAL OBSERVATION ON OPENFLOW NETWORKS(BS-3. Advanced Technologies in the Design, Management and Control for Future Innovative Communication Network)

    Yamashita Shota, Uchida Masato, Tsuru Masato

    Proceedings of the IEICE General Conference   2015 ( 2 ) "S - 80"-"S-81"  2015.02

    CiNii

  • B-6-98 Practical network-tomographic inference of OD traffic matrices

    Koga Kenichi, Uchida Masato, Tsuru Masato

    Proceedings of the IEICE General Conference   2013 ( 2 ) 98 - 98  2013.03

    CiNii

  • Unsupervised ensemble anomaly detection through time-periodical packet sampling

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

    Proceedings - IEEE INFOCOM     1 - 6  2010

     View Summary

    We propose an anomaly detection method that 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. The proposed method can be carried out in an unsupervised manner through the use of time-periodical packet sampling for a different purpose from which it was intended. That is, we take advantage of the lossy nature of packet sampling for the purpose of extracting normal packets from the unlabeled original traffic data. By using real traffic traces, we show that the proposed method is comparable in terms of false positive and false negative rates on detecting anomalies regarding TCP SYN packets to the conventional method that requires manually labeled traffic data to train the baseline model. In addition, in order to mitigate the possible performance variation due to probabilistic nature of sampled traffic data, we devise an ensemble anomaly detection method that exploits multiple baseline models in parallel. Experimental results show that the proposed ensemble anomaly detection performs well and is not affected by the variability of time-periodical packet sampling. ©2010 IEEE.

    DOI

  • A generalized file replication scheme with diffusion-based storage load balancing function in unstructured P2P file-sharing networks

    Masanori Takaoka, Masato Uchida, Yuji Oie

    Proceedings - 2nd International Conference on Intelligent Networking and Collaborative Systems, INCOS 2010     350 - 355  2010

     View Summary

    In this paper, we provide a generalized file replication scheme with a storage load balancing function in unstructured P2P file-sharing networks. The generalized file replication scheme is expressed as a weighted mixture of the concepts introduced in existing schemes. A mathematical analysis shows that the system behavior realized by the generalized file replication scheme can be described by a thermal diffusion equation composed of heat, reaction and diffusion terms, the weights of which are controlled by a parameter of the mixing rate. Here, the heat term represents a function to enhance file search performance by making replicas on specific peers. The reaction term represents a function to avoid concentrations of storage loads on specific peers. The diffusion term represents a function to uniform the storage loads among peers. The simulation results show that the generalized file replication scheme enables us to control the trade-off between search and storage load balancing performances extensively and intuitively by controlling the parameter of the mixing rate. In addition, the simulation results show that the generalized file replication scheme can adapt to dynamic P2P file-sharing environments. © 2010 IEEE.

    DOI

  • 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 In conjunction with the IEEE Global Communications Conference (IEEE GLOBECOM 2009)    2009

  • 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

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

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

    Consumer Electronics, 2009. ISCE '09. IEEE 13th International Symposium on     876 - 880  2009

    DOI

  • Overlay Routing with Acceptable Waiting Time for Unstably Fluctuated Network Environments

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

    The International Conference on Information Networking 2009 (ICOIN 2009)    2009

  • TCP Performance over Evolved UTRA and UTRAN with Time-Frequency Scheduling

    Masaru Hirose, Masato Uchida, Masato Tsuru, Yuji Oie

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

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

    Masanori Takaoka, Kei Ohnishi, Masato Uchida, Yuji Oie

    ComP2P 2008    2008

    DOI

  • Scaling Properties of Complex Networks: Towards Wilsonian Renormalization for Complex Networks

    Kento Ichikawa, Masato Uchida, Masato Tsuru, Yuji Oie

    PHYSCOMNET'08    2008

    DOI

  • Dynamic Storage Load Balancing with Analogy to Thermal Diffusion for P2P File Sharing

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

    Workshop on interdisciplinary systems approach in performance evaluation and design of computer & communications systems (Inter-Perf 2006)    2006

    DOI

  • Network Topologies Emerging in An Evolutionary Optimization Process

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

    Joint 3rd International Conference on Soft Computing and Intelligent Systems and 7th International ymposium on Advanced Intelligent Systems (SCIS & ISIS 2006)     401 - 406  2006

  • Storage Load Balancing via Local Interactions Among Peers in Unstructured P2P Networks

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

    International Workshop on Peer-to-Peer Infromation Management (P2PIM2006), 8 pages, CD-ROM    2006

  • A New Traffic Control Paradigm using Overlay Networks

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

    IEICE technical report. Information networks   104 ( 182 ) 7 - 12  2004.07

     View Summary

    In this paper, we propose a traffic control paradigm using overlay networks which are logical networks over IP networks in the Internet scale. Its key technologies are dynamic topology configuration and Quality of Service (QoS) routing based on IP-layer information measured in real time. The control paradigm is expected to enable end-to-end QoS and global load-balancing through multiple Internet Service Providers (ISPs).

    CiNii

  • Identifying elephant flows from sampled packet stream

    MORI Tatsuya, UCHIDA Masato, KAWAHARA Ryoichi, GOTO Shigeki

    IEICE technical report   104 ( 18 ) 17 - 20  2004.04

     View Summary

    In a network link with sufficient volume of traffic, a small number of flows constructed from a large number of packets occupy a large part of whole aggregated traffic. Such flows are called "elephant flows". Idenfying and controlling them will be useful for contrusting efficient and effective traffic engieering schemes. Meanwhile, with the recent growth in bandwidth of network links, packet sampling technique has been widely noticed as a scalable technology for measuring and managing networks. In this paper, we propose a new method for identifying elephant flows from a sampled packet stream.. We will also evaluate the method using measured data.

    CiNii

  • B-7-115 A Proposal of Decentralized Topology Control for Unstructured Overlay Networks

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

    Proceedings of the IEICE General Conference   2004 ( 2 ) 324 - 324  2004.03

    CiNii

  • B-7-117 Identifying elephant flows using packet sampling

    Mori Tatsuya, Uchida Masato, Kawahara Ryoichi, Goto Shigeki

    Proceedings of the IEICE General Conference   2004 ( 2 ) 326 - 326  2004.03

    CiNii

▼display all

Industrial Property Rights

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

    4473199

    Patent

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

    4437976

    Patent

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

    4390210

    Patent

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

    3960323

    Patent

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

    3806072

    Patent

Awards

  • 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

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

    学振  基盤研究(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

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

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

    コンピュータセキュリティシンポジウム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

  • Exploration into Gray Area: Efficient Labeling for Malicious Domain Name Detection

    Naoki Fukushi, Daiki Chiba, Mitsuaki Akiyama, Masato Uchida

    (Milwaukee, WI, USA) 

    Presentation date: 2019.07

  • Optimal Hand Sign Selection Using Information Theory for Custom Sign-Based Communication

    Tokio Takahashi, Masato Uchida

    IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC 2019)  (Milwaukee, WI, USA) 

    Presentation date: 2019.07

  • Predicting Network Outages Based on Q-drop in Optical Network

    Yohei Hasegawa, Masato Uchida

    IEEE 43rd Annual Computer Software and Applications Conference (COMPSAC 2019)  (Milwaukee, WI, USA) 

    Presentation date: 2019.07

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

    Shimon Kase, Masato Tsuru, Masato Uchida

    Asia-Pacific Signal and Information Processing Association Annual Summit and Conference 2018 (APSIPA-ASC 2018)  (Honolulu, HI, USA) 

    Presentation date: 2018.11

  • 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

  • Recent Trends and Some Lessons for Serious Network Failures in Japan (Invited Talk)

    Masato Uchida

    The Seventh International Workshop on Information Network Design (WIND 2015)  (Taipei, Taiwan) 

    Presentation date: 2015.09

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

    山下 翔太, 内田 真人, 鶴 正人

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

    Presentation 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

  • Tight Lower Bound of Generalization Error in Ensemble Learning

    Masato Uchida

    Joint 7th International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on Advanced Intelligent Systems (SCIS & ISIS 2014)  (Kitakyushu, Japan) 

    Presentation date: 2014.12

  • Unsupervised Weight Parameter Estimation for Exponential Mixture Distribution based on Symmetric Kullback-Leibler Divergence

    Masato Uchida

    Joint 7th International Conference on Soft Computing and Intelligent Systems and 15th International Symposium on Advanced Intelligent Systems (SCIS & ISIS 2014)  (Kitakyushu, Japan) 

    Presentation date: 2014.12

  • Human Error Tolerant Anomaly Detection using Time-Periodic Packet Sampling

    Masato Uchida

    The Sixth International Workshop on Information Network Design (WIND 2014)  (Salerno, Italy) 

    Presentation date: 2014.09

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

    内田 真人

    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トラヒック行列推定の実用化

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

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

    Presentation date: 2013.03

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

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

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

    Presentation date: 2013.03

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

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

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

    Presentation date: 2012.03

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

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

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

    Presentation date: 2012.01

  • Node Degree-Aware Link Cost for Traffic Load-Distribution in Large-Scale Networks

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

    Third International Conference on Intelligent Networking and Collaborative Systems (INCoS 2011)  (Fukuoka, Japan) 

    Presentation date: 2011.12

  • Routing Metric based on Node Degree for Load-Balancing in a Large-Scale Network

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

    The Second Workshop on Heuristic Methods for the Design, Deployment, and Reliability of Networks and Network Applications (HEUNET 2011)  (Munich, Germany) 

    Presentation date: 2011.07

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

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

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

    Presentation date: 2011.03

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

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

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

    Presentation date: 2011.03

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

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

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

    Presentation date: 2011.03

  • A Generalized File Replication Scheme with Diffusion-based Storage Load Balancing Function in Unstructured P2P File-Sharing Networks

    Masanori Takaoka, Masato Uchida, Yuji Oie

    The Third International Workshop on Information Network Design (WIND 2010)  (Thessaloniki, Greece) 

    Presentation date: 2010.11

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

    飯塚 秀明, 内田 真人

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

    Presentation date: 2010.11

  • 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

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

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

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

    Presentation date: 2010.03

  • 第四世代移動体通信網におけるTCP通信のスループット評価

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

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

    Presentation date: 2010.03

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

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

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

    Presentation date: 2010.03

  • 断続的接続環境におけるフローレベルの待ちが可能なパス選択手法

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

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

    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

  • 省電力ネットワークの実現に向けたピークトラヒックの推定

    内田 真人

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

    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

  • 耐障害性を有するP2P記憶システムに関する記憶容量制御手法について

    飯塚 秀明, 内田 真人, 鶴 正人, 尾家 祐二

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

    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

  • 複数の劣品質通信路を活用したデータ転送方式に関する一検討

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

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

    Presentation date: 2009.03

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

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

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

    Presentation date: 2009.03

  • 極値理論による閾値モデル解析と普遍的冪乗則

    藤原 明広, 内田 真人, 巳波 弘佳

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

    Presentation date: 2009.03

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

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

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

    Presentation date: 2009.03

  • ネットワークトポロジの特徴を考慮した負荷分散のための経路選択手法

    夏井 宣匡, 島田 淳一, 田村 瞳, 池永 全志, 内田 真人, 尾家 祐二

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

    Presentation date: 2009.03

  • ネットワークトモグラフィーを用いたトラヒック行列推定手法の実験

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

    電子情報通信学会(通信方式研究会) 

    Presentation 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

  • 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

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

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

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

    Presentation date: 2007.09

  • P2Pファイル共有ネットワークにおけるファイルのアクセス頻度の変化に適応する複製配置

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

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

    Presentation date: 2007.09

  • フロー流量統計推定手法の実環境における評価実験

    立花 大祐, 内田 真人, 鶴 正人, 尾家 祐二

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

    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

  • 劣通信環境における効率的な情報伝達による通信量削減

    森山 敦文, 高橋 正生, 内田 真人, 鶴 正人

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

    Presentation date: 2007.03

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

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

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

    Presentation 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

  • ノードの活性・不活性時間パターンを利用したネットワークトポロジ生成

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

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

    Presentation 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

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

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

    第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

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

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

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

    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

  • 迂回経路候補数に制限がある場合のQoSオーバーレイ経路選択アルゴリズムとその評価

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

    2006年電子情報通信学会総合大会(情報ネットワーク研究会) 

    Presentation 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

  • オーバーレイQoS制御におけるパス選択の評価

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

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

    Presentation 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

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

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

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

    Presentation date: 2004.07

  • オーバレイネットワークによるトラヒック制御の提案

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

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

    Presentation date: 2004.07

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

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

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

    Presentation date: 2004.04

  • 非構造化オーバレイネットワークの分散トポロジ制御の一提案

    木村 卓巳, 亀井 聡, 森 達哉, 内田 真人, 住田 修一, 阿部 威郎

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

    Presentation date: 2004.03

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

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

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

    Presentation 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ネットワークの規模推定および測定に関する一考察

    亀井 聡, 内田 真人

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

    Presentation date: 2004.03

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

    亀井 聡, 内田 真人

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

    Presentation date: 2004.02

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

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

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

    Presentation date: 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

  • Pure型P2Pの方式評価に向けたトポロジ推定法

    内田 真人, 能上 慎也

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

    Presentation date: 2003.03

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

    内田 真人, 塩谷 浩之

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

    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

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

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

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

    Presentation date: 1999.10

  • MLPの正則化項に関する一検討

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

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

    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

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

  • 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