Tetsuya Takine

Osaka University, Suika, Ōsaka, Japan

Are you Tetsuya Takine?

Claim your profile

Publications (143)50.92 Total impact

  • IEEE 11th Consumer Communications and Networking Conference (CCNC 2014); 01/2014
  • [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.
    Wireless Networks 01/2014; · 0.74 Impact Factor
  • 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.
    International Journal of Network Management 11/2013; · 0.51 Impact Factor
  • [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.
    Computer Networks. 04/2013; 57(6):1560–1576.
  • [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.
    Computer Communications. 05/2012; 35(8):980–992.
  • [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 main objective is minimizing the overall mean delivery delay of bundles in consideration of both offered load of clusters and distance between clusters and their sink nodes. We first model this problem as a nonlinear integer programming, based on the knowledge obtained in our previous work. Because it might be hard to solve this problem directly, we take two-step optimization approach based on linear integer programming, which yields an approximate solution of the problem. Through numerical results, we show the two-step optimization approach works well.
    01/2012;
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In multi-hop wireless networks, broadcasting with flooding causes significant packet loss and battery power consumption, which is referred to as the broadcast storm problem. In this paper, we consider the broadcast storm problem in a broadcasting system in which each node generates a new packet periodically as in routing protocols. In order to resolve the problem, we apply network coding, which can reduce the number of forwarded packets by encod-ing several packets into a single packet at intermediate nodes. We propose a broadcasting system called asynchronous multiple-source network coding (AM-SNC), where nodes encode received packets asynchronously generated from different source nodes. In order to apply multiple-source network coding to large multi-hop wireless networks, AMSNC has two mechanisms: timer-based coding scheduling and packet header format with compressed coding vector. With the timer-based coding scheduling, AMSNC effectively encodes packets asynchronously generated at source nodes. Further, with the packet header format with a compressed coding vector, we resolve the overhead problem, where the length of coding vectors becomes long in large multi-hop wireless networks. Simulation results show that AMSNC reduces the number of for-warded packets significantly and improves packet loss rate, end-to-end delay, and radio resource consumption.
    Numerical Algebra, Control and Optimization. 01/2012; 1(4):577-592.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Passive Coding-Based Epidemic Routing in Sparsely Populated Mobile Ad hoc Networks
    IEICE Transactions. 01/2012; 95-B:169-177.
  • Source
    Takahiro Matsuda, Taku Noguchi, Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: Survey of Network Coding and Its Applications
    IEICE Transactions. 01/2011; 94-B:698-717.
  • Takanori Kudo, Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: We discuss the design of a sliding window scheme for detecting high packet-rate flows via random packet sampling. We determine the values of control parameters, such as the sampling rate and window length, to minimize the false positive ratio, while keeping the false negative ratio sufficiently low and making the on-line processing possible. Under mild assumptions, we formulate this problem as a nonlinear program and provide its numerically feasible global optimal solution. We then conduct sampling experiments with public trace data and discuss the fundamental characteristics of the sliding window scheme with random packet sampling.
    Computer Networks. 01/2011; 55:1351-1363.
  • Kouji Hirata, Takahiro Matsuda, Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper proposes three-domain (3-D) burst scheduling in optically burst-switched WDM networks. This scheme completely eliminates contention at intermediate core nodes by combining contention avoidance schemes in the space, wavelength, and time domains. In the space and wavelength domains, the proposed scheme constructs multiple fixed, tree-shaped routes for burst transmission called λ-trees, each of which is assigned a wavelength. Note that λ-trees with the same wavelength do not share any links, and therefore the proposed scheme provides contention-free transmission among bursts transmitted on different λ-trees. Furthermore, in the time domain, the proposed scheme introduces an ingenious offset time assignment scheme named burst grooming, which eliminates contention on each λ-tree. As a result, contention at intermediate core nodes is completely eliminated because each ingress node schedules incoming bursts onto λ-trees with burst grooming. We provide λ-tree construction and burst scheduling algorithms, which aim to minimize the overall burst loss probability. Extensive simulation experiments show that the proposed scheme improves the overall burst loss performance dramatically without wavelength conversion.
    Journal of Optical Communications and Networking. 05/2010; 2(6):332-343.
  • Source
    Yusuke Matsuda, Masahiro Sasabe, Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: Peer-to-Peer (P2P) file sharing is one of key technologies for achieving attractive P2P multimedia social networking. In P2P file-sharing systems, file availability is improved by cooperative users who cache and share files. Note that file caching carries costs such as storage consumption and processing load. In addition, users have different degrees of cooperativity in file caching and they are in different surrounding environments arising from the topological structure of P2P networks. With evolutionary game theory, this paper evaluates the performance of P2P file sharing systems in such heterogeneous environments. Using micro-macro dynamics, we analyze the impact of the heterogeneity of user selfishness on the file availability and system stability. Further, through simulation experiments with agent-based dynamics, we reveal how other aspects, for example, synchronization among nodes and topological structure, affect the system performance. Both analytical and simulation results show that the environmental heterogeneity contributes to the file availability and system stability.
    International Journal of Digital Multimedia Broadcasting 01/2010; 2010.
  • Takahiro Matsuda, Taku Noguchi, Tetsuya TAKINE
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we consider the broadcast storm problem in dense wireless ad hoc networks where interference among densely populated wireless nodes causes significant packet loss. To resolve the problem, we apply randomized network coding (RNC) to the networks. RNC is a completely different approach from existing techniques to resolve the problem, and it reduces the number of outstanding packets in the networks by encoding several packets into a single packet. RNC is a kind of linear network coding, and it is suited to wireless ad hoc networks because it can be implemented in a completely distributed manner. We describe a procedure for implementing the wireless ad hoc broadcasting with RNC. Further, with several simulation scenarios, we provide some insights on the relationship between the system parameters and performance and find that there is the optimal length of coding vectors for RNC in terms of packet loss probability. We also show a guideline for the parameter setting to resolve the broadcast storm problem successfully.
    01/2010;
  • [Show abstract] [Hide abstract]
    ABSTRACT: In the IEEE 802.11 MAC protocol, access points (APs) are given the same priority as wireless terminals in terms of acquiring the wireless link, even though they aggregate several downlink flows. This feature leads to a serious throughput degradation of downlink flows, compared with uplink flows. In this paper, we propose a dynamic contention window control scheme for the IEEE 802.11e EDCA-based wireless LANs, in order to achieve fairness between uplink and downlink TCP flows while guaranteeing QoS requirements for real-time traffic. The proposed scheme first determines the minimum contention window size in the best-effort access category at APs, based on the number of TCP flows. It then determines the minimum and maximum contention window sizes in higher priority access categories, such as voice and video, so as to guarantee QoS requirements for these real-time traffic. Note that the proposed scheme does not require any modification to the MAC protocol at wireless terminals. Through simulation experiments, we show the effectiveness of the proposed scheme.
    IEICE Transactions. 01/2010; 93-B:56-64.
  • [Show abstract] [Hide abstract]
    ABSTRACT: Custody transfer in delay tolerant networks (DTNs) provides reliable end-to-end data delivery by delegating the responsibility of data transfer among special nodes (custodians) in a hop-by-hop manner. However, storage congestion occurs when data increases and/or the network is partitioned into multiple sub-networks for a long time. The storage congestion can be alleviated by message ferries which move around the network and proactively collect data from the custodians. In such a scenario, data should be aggregated to some custodians so that message ferries can collect them effectively. In this paper, we propose a scheme to aggregate data into selected custodians, called aggregators, in a fully distributed and autonomous manner with the help of evolutionary game theoretic approach. Through theoretical analysis and several simulation experiments, taking account of the uncooperative behavior of nodes, we show that aggregators can be selected in a self-organized manner and the number of aggregators can be controlled to a desired value.
    IEICE Transactions. 01/2010; 93-B:490-500.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In the IEEE 802.11 MAC protocol, access points (APs) are given the same authority as wireless terminals (WTs) in terms of acquiring the wireless link, even though they aggregate several downlink flows. This feature leads to a serious throughput degradation of downlink flows, compared with uplink flows. In this paper, we propose a dynamic contention window control scheme for the IEEE 802.11e EDCA-based WLANs, in order to achieve fairness between uplink and downlink TCP flows while guaranteeing QoS requirements for real-time traffic. The proposed scheme first determines the minimum contention window size in the best-effort access category at APs, based on the number of TCP flows. It then determines the minimum and maximum contention window sizes in higher priority access categories, such as voice and video, so as to guarantee QoS requirements for these real-time traffic.
    Vehicular Technology Conference, 2009. VTC Spring 2009. IEEE 69th; 05/2009
  • Masahiro Sasabe, Tetsuya Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: In mobile ad hoc networks (MANETs), time synchronization can be achieved by distributing time information among nodes. This type of time synchronization, however, does not work well under considerable long delay caused by sparse population. In this paper, we propose a simple yet effective scheme for relative time synchronization. When two mobile nodes meet, they exchange their clock information and adjust their own clocks to the average. Through simulation experiments, we show that the variance of the difference between the local and reference times remains within a certain finite range that depends on the frequency of nodes' meetings.
    01/2009;
  • [Show abstract] [Hide abstract]
    ABSTRACT: In delay tolerant networks (DTNs), custody transfer mechanism provides reliable end-to-end data transfer in which special nodes (custodians) transfer data with custody in a hop-by-hop manner. As a result, storage congestion occurs when data with custody increases and/or the network is partitioned into multiple sub-networks for a long time. The storage congestion can be alleviated with the help of message ferries. In such a scenario, data should be aggregated to some custodians so that message ferries can effectively collect them. In this paper, we propose a scheme to aggregate data into selected custodians, called aggregators, in a fully distributed and autonomous manner by using evolutionary game theoretical approach where we can also control the number of aggregators to a desired value.
    10th IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, WOWMOM 2009, Kos Island, Greece, 15-19 June, 2009; 01/2009
  • [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers a fairness issue between uplink and downlink flows in IEEE 802.11 wireless LANs, where uplink flows dominate over downlink flows in terms of wireless bandwidth usage. As a solution to this unfairness, we propose modifying the IEEE 802.11 MAC protocol at access points (APs). Our scheme dynamically controls the minimum contention window size at APs and provides an ample opportunity for them to acquire the transmission right. Note that the proposed scheme does not require any modifications in the MAC protocol at wireless terminals. Furthermore, the optimal minimum contention window size is given by an explicit function of the ratio of the total packet rate of downlink flows to the packet rate of an uplink flow. Through simulation experiments with UDP and TCP flows, we show that the proposed scheme can achieve fairness between uplink and downlink flows.
    IEEE Transactions on Wireless Communications 10/2008; · 2.42 Impact Factor
  • T. Matsuda, T. Takine
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper considers (p, q )-Epidemic Routing, a class of store-carry-forward routing schemes, for sparsely populated mobile ad hoc networks. Our forwarding scheme includes Two-Hop Forwarding and the conventional Epidemic Routing as special cases. In such forwarding schemes, the original packet is copied many times and its packet copies spread over the network. Therefore those packet copies should be deleted after a packet reaches the destination. We analyze the performance of (p, q)-Epidemic Routing with VACCINE recovery scheme. Unlike most of the existing studies, we discuss the performance of (p, q)-Epidemic Routing in depth, taking account of the recovery process that deletes unnecessary packets from the network.
    IEEE Journal on Selected Areas in Communications 07/2008; · 3.12 Impact Factor

Publication Stats

1k Citations
50.92 Total Impact Points

Institutions

  • 1995–2014
    • Osaka University
      • • Department of Information and Communications Technology
      • • Graduate School of Engineering
      • • Department of Information Systems Engineering
      • • Graduate School of Information Science and Technology
      • • Department of Information and Computer sciences
      Suika, Ōsaka, Japan
    • Kinki University
      • Department of Electric and Electronic Engineering
      Ōsaka, Ōsaka, Japan
  • 2007
    • Osaka City University
      Ōsaka, Ōsaka, Japan
  • 1986–2007
    • Kyoto University
      • Department of Applied Mathematics and Physics
      Kyoto, Kyoto-fu, Japan
  • 1994–2003
    • Kyushu Institute of Technology
      • Faculty of Computer Science & Systems Engineering
      Japan
  • 1996–2001
    • Nara Institute of Science and Technology
      • Graduate School of Information Science
      Ikoma, Nara, Japan
    • NEC Corporation
      Edo, Tōkyō, Japan
  • 1997–1998
    • The University of Tokushima
      • Department of Information Science and Intelligent Systems
      Tokusima, Tokushima, Japan
    • Hitachi Cable, Ltd.
      Edo, Tōkyō, Japan