Tetsuya Takine

Osaka University, Suika, Ōsaka, Japan

Are you Tetsuya Takine?

Claim your profile

Publications (175)88.79 Total impact

  • Yoshiaki Inoue · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the loss probability Ploss in the stationary M/G/1 queue with generally distributed impatience times (M/G/1+G queue). Recently, it was shown that Ploss increases with service times in the convex order. In this paper, we show that Ploss also increases with impatience times in the excess wealth order. With these results, we show that Ploss in the M/D/1+D queue is smallest among all M/G/1+G queues with the same and finite arrival rate, mean service time, and mean impatience time.
    No preview · Article · Oct 2015 · Operations Research Letters
  • Ken'ichi Kawanishi · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we consider the stationary PH/M/c queue with deterministic impatience times (PH/M/c+D). We show that the probability density function of the virtual waiting time takes the form of a matrix exponential whose exponent is given explicitly by system parameters.
    No preview · Article · Sep 2015 · Journal of Applied Probability
  • Ken’ichi Kawanishi · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers stationary MAP/M/c and M/PH/c queues with constant impatience times. In those queues, waiting customers leave the system without receiving their services if their elapsed waiting times exceed a predefined deterministic threshold. For the MAP/M/c queue with constant impatience times, Choi et al. (Math Oper Res 29:309–325, 2004) derive the virtual waiting time distribution, from which the loss probability and the actual waiting time distribution are obtained. We first refine their result for the virtual waiting time and then derive the stationary queue length distribution. We also discuss the computational procedure for performance measures of interest. Next we consider the stationary M/PH/c queue with constant impatience times and derive the loss probability, the waiting time distribution, and the queue length distribution. Some numerical results are also provided.
    No preview · Article · Jul 2015 · Queueing Systems
  • Yoshiaki Inoue · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider the loss probability in the stationary M/G/1+G queue, i.e., the stationary M/G/1 queue with impatient customers whose impatience times are generally distributed. It is known that the loss probability is given in terms of the probability density function v(x) of the virtual waiting time and that v(x) is given by a formal series solution of a Volterra integral equation. In this paper, we show that the series solution of v(x) can be interpreted as the probability density function of a random sum of dependent random variables and we reveal its dependency structure through the analysis of a last-come first-served, preemptive-resume M/G/1 queue with workload-dependent loss. Furthermore, based on this observation, we show some properties of the loss probability.
    No preview · Article · Jun 2015 · Queueing Systems
  • Tomotaka Kimura · Takahiro Matsuda · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider a location-aware store-carry-forward routing scheme based on node density estimation (LA Routing in short), which adopts different message forwarding strategies depending on node density at contact locations where two nodes encounter. To do so, each node estimates a node density distribution based on information about contact locations. In this paper, we clarify how the estimation accuracy affects the performance of LA Routing. We also examine the performance of LA Routing when it applies to networks with homogeneous node density. Through simulation experiments, we show that LA Routing is fairly robust against the accuracy of node density estimation and its performance is comparable with Probabilistic Routing even in the case that that node density is homogeneous.
    No preview · Article · Jan 2015 · IEICE Transactions on Communications
  • Source
    Yoshiaki Inoue · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider a bivariate Markov process {(U(t), S(t)); t ≥ 0 }, where U(t) (t ≥ 0) takes values in [0, ∞) and S(t) (t ≥ 0) takes values in a finite set. We assume that U(t) (t ≥ 0) is skip-free to the left, and therefore we call it the M/G/1-type Markov process. The M/G/1-type Markov process was first introduced as a generalization of the workload process in the MAP/G/1 queue and its stationary distribution was analyzed under a strong assumption that the conditional infinitesimal generator of the underlying Markov chain S(t) given U(t) > 0 is irreducible. In this paper, we extend known results for the stationary distribution to the case that the conditional infinitesimal generator of the underlying Markov chain given U(t) > 0 is reducible. With this extension, those results become applicable to the analysis of a certain class of queueing models.
    Preview · Article · Jan 2015 · Journal of the Operations Research Society of Japan
  • Tatsuma Matsuki · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: The MapReduce job scheduler implemented in Hadoop is a mechanism to decide which job is allowed to use idle resources in Hadoop. In terms of the mean job response time, the performance of the job scheduler strongly depends on the job arrival pattern, which includes job size (i.e., the amount of required resources) and their arrival order. Because existing schedulers do not utilize information about job sizes, however, those schedulers suffer severe performance degradation with some arrival patterns. In this paper, we propose a scheduler that estimates and utilizes remaining job sizes, in order to achieve good performance regardless of job arrival patterns. Through simulation experiments, we confirm that for various arrival patterns, the proposed scheduler achieves better performance than the existing schedulers.
    No preview · Article · Jan 2015 · IEICE Transactions on Communications
  • Masashi HASEGAWA · Masahiro SASABE · Tetsuya TAKINE
    [Show abstract] [Hide abstract]
    ABSTRACT: Peer-to-Peer (P2P) file distribution systems can efficiently disseminate massive contents, such as disk images of operating systems, from a server to many users in a piece-by-piece manner. In particular, the BitTorrent protocol optimizes each peer's download speed by applying the tit-for-tat (TFT) strategy, where each peer preferentially uploads piece(s) to peer(s) from which it can download missing pieces faster. To the best of our knowledge, however, the optimality of TFT-based P2P file distribution has not been studied sufficiently. In this paper, we aim to understand the optimal scheduling in TFT-based P2P file distribution. First, we develop a discrete-time model of TFT-based P2P file distribution and formulate its optimal scheduling as a two-step integer linear programming problem. The first step is to minimize the average file retrieval time among peers, and the second step is to improve fairness among peers. We analyze the optimal solution obtained by the existing solver and reveal the characteristics of the optimal scheduling. Specifically, we show that it is crucial to distribute pieces from the server indirectly to peers with large upload capacity via those with small upload capacity.
    No preview · Article · Dec 2014 · IEICE Transactions on Communications
  • Tomotaka Kimura · Takahiro Matsuda · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose a probabilistic store-carry-forward message delivery scheme based on node density estimation. In our scheme, when a node with a message copy encounters another node, the former forwards its copy to the latter with a certain probability. The forwarding probability is determined depending on a node density at the contact location where two nodes encounter. More specifically, when the node density is high, the forwarding probability is set to be low. This policy is designed to avoid excess message copy transmissions in a high node-density area. In general, nodes frequently encounter each other in high node-density areas and message copies rapidly spread over the nodes. In order to determine whether the node density is high or not, each node estimates the node density distribution over the whole network based on the contact location information. The information is collected by each node and exchanged among nodes. With simulation experiments, we evaluate the performance of our scheme in terms of the mean delivery delay and the number of forwarded message copies.
    No preview · Conference Paper · Jan 2014
  • Tomotaka Kimura · Takahiro Matsuda · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: We propose Multi-Spreader Routing, a store-carry-forward routing scheme for sparsely populated mobile ad hoc networks. Multi-Spreader Routing includes Epidemic Routing and Two-Hop Forwarding as special cases, and it can manage trade-off between message delivery delay and resource consumption effectively. We analyze various performance measures of Multi-Spreader Routing with a recovery scheme called VACCINE, and we evaluate its performance. Further, through simulation experiments with real mobility trace data, we demonstrate that Multi-Spreader Routing shows stable performance in various network environments.
    No preview · Article · Jan 2014 · Wireless Networks
  • Takanori Kudo · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: SUMMARY We consider on-line detection of persistently high packet-rate flows. We assume that flow information is collected via a time-based sliding window scheme with random packet sampling. In this framework, we propose a method of determining the threshold of the number of sampled packets, which guarantees the false negative ratio. We also formulate and solve the design problem of our scheme, where we aim to minimize the false positive ratio. We then conduct sampling experiments with public trace data and confirm that our method works well as designed. Copyright © 2013 John Wiley & Sons, Ltd.
    No preview · Article · Jan 2014 · International Journal of Network Management
  • Source
    Yoshiaki Inoue · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider a FIFO single-server queue with disasters and multiple Markovian arrival streams. When disasters occur, all customers are removed instantaneously and the system becomes empty. Both the customer arrival and disaster occurrence processes are assumed to be Markovian arrival processes (MAPs), and they are governed by a common underlying Markov chain with finite states. There are K classes of customers, and the amounts of service requirements brought by arriving customers follow general distributions, which depend on the customer class and the states of the underlying Markov chain immediately before and after arrivals. For this queue, we first analyze the first passage time to the idle state and the busy cycle. We then obtain two different representations of the Laplace-Stieltjes transform of the stationary distribution of work in system, and discuss the relation between those. Furthermore, using the result on the workload distribution, we analyze the waiting time and sojourn time distributions, and derive the joint queue length distribution.
    Preview · Article · Jan 2014 · Journal of Industrial and Management Optimization
  • Kazushi Takemoto · Takahiro Matsuda · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: Network tomography is a technique for estimating internal network characteristics from end-to-end measurements. In this paper, we focus on loss tomography, which is a network tomography problem for estimating link loss rates. We study a loss tomography problem to detect links with high link loss rates in network environments with dynamically changing link loss rates, and propose a window-based sequential loss tomography scheme. The loss tomography problem is formulated as an underdetermined linear inverse problem, where there are infinitely many candidates of the solution. In the proposed scheme, we use compressed sensing, which can solve the problem with a prior information that the solution is a sparse vector. Measurement nodes transmit probe packets on measurement paths established between them, and calculate packet loss rates of measurement paths (path loss rates) from probe packets received within a window. Measurement paths are classified into normal quality and low quality states according to the path loss rates. When a measurement node finds measurement paths in the low quality states, link loss rates are estimated by compressed sensing. Using simulation scenarios with a few link states changing dynamically from low to high link loss rates, we evaluate the performance of the proposed scheme.
    No preview · Article · Nov 2013 · IEICE Transactions on Communications
  • Masahiro Sasabe · K. Habibul Kabir · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: Communication among isolated networks (clusters) in delay tolerant networks (DTNs) can be supported by a message ferry, which collects bundles from clusters and delivers them to a sink node. When there are lots of distant static clusters, multiple message ferries and sink nodes will be required. In this paper, we aim to make groups, each of which consists of physically close clusters, a sink node, and a message ferry. Our objective is minimizing the overall mean delivery delay of bundles in consideration of both the offered load of clusters and distances between clusters and their sink nodes. Based on existing work, we first model this problem as a nonlinear integer programming. Using a commercial nonlinear solver, we obtain a quasi-optimal grouping. Through numerical evaluations, we show the fundamental characteristics of grouping, the impact of location limitation of base clusters, and the relationship between delivery delay and the number of base clusters.
    No preview · Article · Aug 2013 · IEICE Transactions on Communications
  • [Show abstract] [Hide abstract]
    ABSTRACT: Principal Component Analysis (PCA) can detect traffic anomalies by projecting measured traffic data onto a normal and anomalous subspaces. Although PCA is a powerful method for detecting traffic anomalies, excessively large anomalies may contaminate the normal subspace and deteriorate the performance of the detector. In order to solve this problem, we propose a PCA-based robust anomaly detection scheme by using the daily or weekly periodicity in traffic volume. In the proposed scheme, traffic anomalies are detected for every period of measured traffic via PCA. Before applying PCA, however, outliers in the current period are removed by means of a reference covariance matrix, which is derived from normal traffic in the preceding period. We apply the proposed scheme to measured traffic data in the Abilene network and show that it can improve the false negative ratio of anomaly detection.
    No preview · Conference Paper · Jun 2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider the mean–variance relationship of the number of flows in traffic aggregation, where flows are divided into several groups randomly, based on a predefined flow aggregation index, such as source IP address. We first derive a quadratic relationship between the mean and the variance of the number of flows belonging to a randomly chosen traffic aggregation group. Note here that the result is applicable to sampled flows obtained through packet sampling. We then show that our analytically derived mean–variance relationship fits well those in actual packet trace data sets. Next, we present two applications of the mean–variance relationship to traffic management. One is an application to detecting network anomalies through monitoring a time series of traffic. Using the mean–variance relationship, we determine the traffic aggregation level in traffic monitoring so that it meets two predefined requirements on false positive and false negative ratios simultaneously. The other is an application to load balancing among network equipments that require per-flow management. We utilize the mean–variance relationship for estimating the processing capability required in each network equipment.
    No preview · Article · Apr 2013 · Computer Networks
  • Masahiro Sasabe · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: In sparsely populated mobile ad hoc networks (MANETs), mobile nodes are chronically isolated each other and they meet very occasionally. Global clock synchronization among nodes in such networks is a challenging problem because reference clock information cannot be disseminated promptly over nodes due to the lack of stable connections among nodes. In recent years, averaging-based algorithms for distributed global clock synchronization have been studied. In this paper, we conduct the continuous-time analysis of the simplest one, called the simple averaging scheme, where two mobile nodes exchange their local clock times when they meet and adjust their own clocks to the average of them. Through the analysis and simulation experiments, we reveal how the clock accuracy of nodes and meeting rates among them affect the rate of convergence to the steady state and the accuracy of clock synchronization in steady state.
    No preview · Article · Apr 2013 · IEEE Journal on Selected Areas in Communications
  • Takahiro Matsuda · Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: Network tomography is an inference technique for internal network characteristics such as link loss rate and link delay from end-to-end measurements. In this paper, we consider network tomography for link loss rates, which is referred to as loss tomography. We propose a loss tomography scheme with bitwise operation-based in-network processing. Intermediate nodes generate coded packets by performing bitwise-operations on received packets so as to embed information about paths along which those packets have been transmitted. The coded packets are then forwarded to downstream nodes. In this way, receiver nodes obtain information about paths along which packets are transmitted successfully. Moreover, we show a recursion to compute the likelihood function of path loss rates, which can be utilized in estimating link loss rates from path loss information.
    No preview · Article · Feb 2013 · IEICE Transactions on Communications
  • Yoshiaki Inoue · Tetsuya Takine

    No preview · Article · Jan 2013 · Journal of the Operations Research Society of Japan
  • Shin’ichi Arakawa · Tetsuya Takine · Masayuki Murata
    [Show abstract] [Hide abstract]
    ABSTRACT: Measurement studies on the Internet topology show that connectivities of nodes exhibit power-law attribute, but it is apparent that only the degree distribution does not determine the network structure, and especially true when we study the network-related control like routing control. In this paper, we first reveal structures of the router-level topologies using the working ISP networks, which clearly indicates ISP topologies are highly clustered; a node connects two or more nodes that also connected each other, while not in the existing modeling approaches. Based on this observation, we develop a new realistic modeling method for generating router-level topologies. In our method, when a new node joins the network, the node likely connects to the nearest nodes. In addition, we add the new links based on the node utilization in the topology, which corresponds to an enhancement of network equipments in ISP networks. With appropriate parameters, important metrics, such as the a clustering coefficient and the amount of traffic that pass through nodes, exhibit the similar value of the actual ISP topology while keeping the degree distribution of resulting topology to follow power-law. We then apply the routing control method to the ISP topologies and show that the optimal routing method gives much smaller maximum link utilization (about 1/3) compared with the minimum hop routing which is often used in the operating networks. Accordingly, we examine a heuristic routing method suitable to the ISP topologies with consideration of technology constraints of IP routers. The evaluation results show that our modeling method can be actually used for evaluations on routing control.
    No preview · Article · May 2012 · Computer Communications

Publication Stats

2k Citations
88.79 Total Impact Points

Institutions

  • 1995-2015
    • Osaka University
      • • Department of Information and Communications Technology
      • • Graduate School of Engineering
      • • Department of Information Systems Engineering
      Suika, Ōsaka, Japan
    • Kinki University
      • Department of Electric and Electronic Engineering
      Ōsaka, Ōsaka, Japan
  • 2007
    • Osaka City University
      • Graduate School of Engineering
      Ōsaka, Ōsaka, Japan
  • 1986-2007
    • Kyoto University
      • • Department of Systems Science
      • • Department of Applied Mathematics and Physics
      • • Graduate School of Informatics
      Kioto, Kyōto, Japan
  • 1999-2006
    • Kyushu Institute of Technology
      • Faculty of Computer Science & Systems Engineering
      Kitakyūshū, Fukuoka, Japan
  • 1997-1998
    • The University of Tokushima
      • Department of Information Science and Intelligent Systems
      Tokusima, Tokushima, Japan
    • Hitachi Cable, Ltd.
      Edo, Tōkyō, Japan
  • 1996
    • Nara Institute of Science and Technology
      • Graduate School of Information Science
      Ikuma, Nara, Japan
    • University of California, Irvine
      • Department of Computer Science
      Irvine, California, United States