Updated on 2024/02/28

写真a

 
TANAKA, Yoshiaki
 
Affiliation
Faculty of Science and Engineering
Job title
Professor Emeritus
Degree
Doctor of Engineering ( 1979.03 The University of Tokyo )
Profile

Yoshiaki Tanaka received the B.E., M.E., and D.E. degrees in electrical engineering from the University of Tokyo, Tokyo, Japan, in 1974, 1976, and 1979, respectively. He became a staff at the Department of Electrical Engineering, the University of Tokyo, in 1979, and has been engaged in teaching and researching in the fields of telecommunication networks, switching systems, and network security. He was a guest professor at the Department of Communication Systems, Lund Institute of Technology, Sweden, from 1986 to 1987. He was also a visiting researcher at the Institute for Posts and Telecommunications Policy, from 1988 to 1991, and at the Institute for Monetary and Economic Studies, Bank of Japan, from 1994 to 1996. He is presently a professor at Global Information and Telecommunication Institute, Waseda University, and a visiting professor at National Institute of Informatics. He received the IEEE Outstanding Student Award in 1977, the Niwa Memorial Prize in 1980, the IEICE Achievements Award in 1980, the Okawa Publication Prize in 1994, the TAF Telecom System Technology Award in 1995 and in 2006, the IEICE Information Network Research Award in 1996, in 2001, in 2004, and in 2006, the IEICE Communications Society Activity Testimonial in 1997 and in 1998, the IEICE Switching System Research Award in 2001, the IEICE Best Paper Award in 2005, the IEICE Network System Research Award in 2006 and in 2008, and the IEICE Communications Society Activity Award in 2008. He is a Fellow of IEICE.

Research Areas

  • Information network
 

Papers

  • Resource Sharing Framework for Heterogeneous Network Services

    OISHI Haruo, YAMORI Kyoko, ZHANG Cheng, TANAKA Yoshiaki

      J105-B ( 1 ) 1 - 13  2022.01

     View Summary

    Some researches on cognitive networks proposed communication networks that combined multiple communication methods. In addition, some researches show the importance of cooperation for heterogeneous networks. The researches have been proposed to increase utility, reduce costs and improve incentive mechanism with cooperation. However, a framework that integrates them and provides them to users has not been proposed. Therefore, inspired by a concept of service provision called MaaS (Mobility as a Service) in transportation fields, a novel concept of SHaaS (Sharing framework for Heterogeneous network services as a Service) is proposed in this paper. SHaaS aims to optimize social utility by cooperative mechanism using intermediation between service providers and users. The simulation model is proposed to evaluate effectiveness of SHaaS. SHaaS environment can improve users' utility with resource sharing. The evaluation results show high effectiveness of SHaaS concept.

    DOI

  • Adaptive Wireless Multi-Hop Routing Less Affected by Processing Delay

    Hiroshi Katada, Taku Yamazaki, Takumi Miyoshi, Shigeru Shimamoto, Yoshiaki Tanaka

    2020 22nd Asia-Pacific Network Operations and Management Symposium (APNOMS 2021)     410 - 413  2021.09  [Refereed]

    DOI

    Scopus

  • An Auction Based Communication Line Resource Trading Considering Relationship between Telecommunication Network Failure Rate and Users' Utility

    OISHI Haruo, YAMORI Kyoko, ZHANG Cheng, TANAKA Yoshiaki

      J104-B ( 3 ) 261 - 270  2021.03

     View Summary

    The telecommunication services market has been greatly changed because of the significantly changing of telecommunication network technologies and corresponding users' environment. The application services on the network have become more important. As the application service platform, the telecommunication network with suitable pricing and high utility are required from users. There are many research papers about the bandwidth of telecommunication quality, but there are few research focused reliability of it. In this paper, we aim to provide telecommunication network service with quality of service that satisfies users demand and improves total users' utility. The impact of reliability of telecommunication service on users' utility is studied. The failure rate of service is important, but few studies have focused on this point. However, the relation between the failure rate and willingness to pay (WTP) as well as willingness to accept (WTA) were clarified in the related study. We propose a method to improve the total of users' utility with the auction based trading among the users when the failure occurred, and show the effectiveness of the method by the simulation.

    DOI

  • Decentralized Local Scaling Factor Control for Backoff-based Opportunistic Routing

    Taku Yamazaki, Ryo Yamamoto, Genki Hosokawa, Tadahide Kunitachi, Yoshiaki Tanaka

    IEICE Transactions on Information and Systems   E102-D ( 11 ) 2317 - 2328  2019.12  [Refereed]

    DOI

    Scopus

  • Adaptive Contents Dissemination Method for Floating Contents

    Ryo Yamamoto, Atsufumi Kashima, Taku Yamazaki, Yoshiaki Tanaka

    IEEE 90th Vehicular Technology Conference     1 - 5  2019.09  [Refereed]

  • Path Aggregation Method Based on Inter-Vehicle Distance in Hierarchical VANET

    Mitsuhiro Nakamura, Taku Yamazaki, Ryo Yamamoto, Takumi Miyoshi, Yoshiaki Tanaka

    34th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC2019)   ( OS-15-1 )  2019.06  [Refereed]

     View Summary

    For a future environment where manual driving cars and autonomous driving cars coexist, an information sharing method, which adaptively shares surrounding information based on driving support level, has been proposed. However, the conventional system consumes network resources as the number of vehicles in the network increases since it keeps a full-mesh topology and shares information among all the autonomous driving cars in the network. This paper proposes a duplicate path and packet aggregation method based on inter-vehicle distance information in hierarchical vehicular ad-hoc networks. This paper also evaluates the characteristics by simulations. As a result, this paper revealed that the proposed method reduces network traffic by aggregating paths and packets.

  • ACO-Inspired Energy-Aware Routing Algorithm for Wireless Sensor Networks

    Ryo Yamamoto, Seira Nishibu, Taku Yamazaki, Yasushi Okamura, Yoshiaki Tanaka

    Journal of Telecommunications and Information Technology   1   5 - 13  2019.03  [Refereed]

  • A Deep Learning Based Social-aware D2D Peer Discovery Mechanism

    Yu Long, Taku Yamazaki, Ryo Yamamoto, Yoshiaki Tanaka

    2019 21st International Conference on Advanced Communications Technology (IEEE/ICACT 2019)     91 - 97  2019.02  [Refereed]

    DOI

    Scopus

    10
    Citation
    (Scopus)
  • Adaptive Anchor Zone Adjustment Based on Terminal Encounter Rate in Floating Contents

    Atsufumi Kashima, Taku Yamazaki, Ryo Yamamoto, Yoshiaki Tanaka

    IEICE Information and Communication Technology Forum 2018     0 - 0  2018.07  [Refereed]

  • Well-Timed Secure Handover in LTE Self Organized Network

    Nava Krishna Chaitanya Javvaji, Ryo Yamamoto, Yoshiaki Tanaka

    32nd International Technical Conference on Circuits/Systems, Computers and Communications     0 - 0  2017.07  [Refereed]

  • Hierarchical Opportunistic Routing with Destination Area Estimation for Ad Hoc Networks

    Ryota Kameda, Ryo Yamamoto, Yoshiaki Tanaka

    32nd International Technical Conference on Circuits/Systems, Computers and Communications     0 - 0  2017.07  [Refereed]

  • Opportunistic Routing Using Prioritized Forwarders with Retransmission Control

    Taku Yamazaki, Ryo Yamamoto, Takumi Miyoshi, Takuya Asaka, Yoshiaki Tanaka

    Image Processing & Communications   21 ( 1 ) 57 - 66  2017.04  [Refereed]

     View Summary

    In ad hoc networks, broadcast-based forwarding protocols called opportunistic routing have been proposed. In general backoff-based opportunistic routing protocols, each receiver autonomously makes a forwarding decision using a random backoff time based on logical distance. However, each potential forwarder must wait for the expiration of the backoff timer before the packet forwarding. Moreover, they cannot gain forwarding path diversity in sparse environments. In this paper, we propose a novel forwarder selection method for opportunistic routing. In the proposed method, a terminal called, a prioritized forwarder, and which is selected from among neighbours and can forward packets without using the backoff time. In addition, we integrate a hop-by-hop retransmission control in the proposed method, which improves the packet transmission success rate in sparse environments. We evaluate the proposed method in comparison with the conventional protocols in computer simulations.

    DOI

  • PRIOR: Prioritized Forwarding for Opportunistic Routing

    Taku Yamazaki, Ryo Yamamoto, Takumi Miyoshi, Takuya Asaka, Yoshiaki Tanaka

    IEICE TRANSACTIONS ON COMMUNICATIONS   E100B ( 1 ) 28 - 41  2017.01  [Refereed]

     View Summary

    In ad hoc networks, broadcast forwarding protocols called OR (opportunistic routing) have been proposed to gain path diversity for higher packet delivery rates and shorter end-to-end delays. In general backoff-based OR protocols, each receiver autonomously makes a forwarding decision by using certain metrics to determine if a random backoff time is to be applied. However, each forwarder candidate must wait for the expiration of the backoff timer before forwarding a packet. Moreover, they cannot gain path diversity if the forwarding path includes local sparse areas, and this degrades performance as it strongly depends on the terminal density. In this paper, we propose a novel OR protocol called PRIOR (prioritized forwarding for opportunistic routing). In PRIOR, a terminal, called a prioritized forwarder and which forwards packets without using a backoff time, is selected from among the neighbours. In addition, PRIOR uses lightweight hop-by-hop retransmission control to mitigate the effect of terminal density. Moreover, we introduce an enhancement to PRIOR to reduce unnecessary forwarding by using an explicit acknowledgement. We evaluate PRIOR in comparison with conventional protocols in computer simulations.

    DOI

    Scopus

    12
    Citation
    (Scopus)
  • Forwarding Mechanism Using Prioritized Forwarders for Opportunistic Routing

    Taku Yamazaki, Ryo Yamamoto, Takumi Miyoshi, Takuya Asaka, Yoshiaki Tanaka

    2016 18th Asia-Pacific Network Operations and Management Symposium (APNOMS 2016)    2016.10  [Refereed]

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • Block-based Transmission with Adaptive Reliability Control for Ad Hoc Networks

    Tomoaki Sakaguchi, Taku Yamazaki, Ryo Yamamoto, Yoshiaki Tanaka

    31th International Technical Conference on Circuit/System, Computer and Communications     403 - 406  2016.07  [Refereed]

  • DTN Reliability Enhancement with End-to-End Retransmission in the Presence of a Complete Route

    Saw David San, Ryo Yamamoto, Yoshiaki Tanaka

    30th International Technical Conference on Circuit/System, Computer and Communications     413 - 416  2015.06  [Refereed]

  • Autonomous Retransmission Terminal Selection with Neighbour Terminals for Ad Hoc Networks

    Taku Yamazaki, Ryo Yamamoto, Takumi Miyoshi, Yoshiaki Tanaka

    IEICE Transactions on Communications   J98-B ( 6 ) 484 - 496  2015.06  [Refereed]

     View Summary

    In ad hoc networks, radio interference and terminal mobility may cause frame loss. When the frame losses occur continuously, general datalink layer protocols regard it as a link failure and then notify it to a network layer. On receiving the notification, routing protocols re-establish a route to recover the link failure. However, the route re-establishment increases network load and decreases transmission efficiency. For solving these problems, some retransmission and relay control methods have been proposed. In these methods, neighbour terminals overhear transmitted frames and autonomously recover the lost frames using the overheard frame. However, the conventional methods may decrease transmission efficiency under the bursty frame losses or suffer from processing overhead and slow adaptation problem under the sparse frame losses. We propose an efficient and lightweight method in which neighbour terminals adaptively retransmit the lost frames considering the frequency of frame losses. The performance and the effectiveness of the proposed method are clarified by computer simulation.

  • Road Side Unit Assisted Stochastic Multi-hop Broadcast Scheme for Instant Emergency Message Propagation

    Xing Fan, Bo Yang, Ryo Yamamoto, Yoshiaki Tanaka

    2015 17TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT)    2015  [Refereed]

     View Summary

    VANET ( Vehicular ad hoc Network) is a special kind of ad hoc wireless network where every single node is a vehicle moving in a relatively high velocity, which leads to exclusive challenges like rapid changing topologies, safety and privacy concerns. In this specific network, broadcasts tend to be carrying important messages such as car accident notification, disaster alert or extreme traffic condition. Thus the propagation of broadcasted emergency messages could be critical to save human lives and property. Many researchers have proposed routing or broadcast protocols to solve this problem in VANET. With consideration of the other common issues. The objective of this paper is to propose a broadcast scheme in VANET that is not likely to cause broadcast storm problem with a reasonable delay and high delivery rate. Since VANET is an attack-prone network and any kind of malicious behavior in VANET might cause serious loss or even death in reality, we should also refrain from using beacons to exchange privacy-sensitive information in V2V ( Vehicle to Vehicle). In this paper, a multi-hop broadcast scheme that makes use of RSU and V2I ( Vehicle to Infrastructure) communication is proposed. The simulation result shows that the proposed scheme outperforms static stochastic broadcast scheme in terms of delivery rate. Comparing to flooding, we offer a better delay and less network usage.

  • Autonomous Retransmission Control with Neighbour Terminals for Ad Hoc Networks

    Taku Yamazaki, Ryo Yamamoto, Takumi Miyoshi, Yoshiaki Tanaka

    2014 16th Asia-Pacific Network Operations and Management Symposium (APNOMS 2014)    2014.09  [Refereed]

    DOI

    Scopus

  • Dempster-Shafer Evidence Theory Based Trust Management Strategy against Cooperative Black Hole Attacks and Gray Hole Attacks in MANETs

    Bo Yang, Ryo Yamamoto, Yoshiaki Tanaka

    2014 16TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT)   2 ( 3 ) 223 - +  2014  [Refereed]

     View Summary

    The MANETs have been experiencing exponential growth in the past decade. However, their vulnerability to various attacks makes the security problem extremely prominent. The main reasons are its distributed, self-organized and infrastructure independent natures. As concerning these problems, trust management scheme is a common way to detect and isolate the compromised nodes when a cryptography mechanism shows a failure facing inner attacks. Among huge numbers of attacks, black hole attack may collapse the network by depriving the route of the normal communication. The conventional proposed method achieved good performance facing black hole attack, while failing to detect gray hole attacks. In this paper, a Dempster-Shafer (D-S) evidence based trust management strategy is proposed to conquer not only cooperative black hole attack but also gray hole attack. In the proposed method, a neighbour observing model based on watchdog mechanism is used to detect single black hole attack by focusing on the direct trust value (DTV). Historical evidence is also taken into consideration to go against gray hole attacks. Then, a neighbour recommendation model companied with indirect trust value (ITV) is used to figure out the cooperative black hole attack. D-S evidence theory is implemented to combine ITVs from different neighbours. Some of the neighbour nodes may declare a false ITV, which effect can also be diminished through the proposed method. The simulation is firstly conducted in the Matlab to evaluate the performance of the algorithm. Then the security routing protocol is implemented in the GloMoSim to evaluate the effectiveness of the strategy. Both of them show good results and demonstrate the advantages of proposed method by punishing malicious actions to prevent the camouflage and deception in the attacks.

  • Road Side Unit Assisted Stochastic Multi-hop Broadcast Scheme for Instant Emergency Message Propagation

    Xing Fan, Bo Yang, Ryo Yamamoto, Yoshiaki Tanaka

    2014 16TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT)   3 ( 3 ) 103 - 108  2014  [Refereed]

     View Summary

    VANET (Vehicular ad hoc Network) is a special kind of ad hoc wireless network where every single node is a vehicle moving in a relatively high velocity, which leads to exclusive challenges like rapid changing topologies, safety and privacy concerns. In this specific network, the propagation of emergency messages could be critical to save human lives and property. Many researchers have proposed routing or broadcast protocols to solve the problems in VANET. The objective of this paper is to propose a broadcast scheme in VANET that is not likely to cause broadcast storm problem with a reasonable delay and high delivery rate. Since VANET is an attack-prone network and any kind of malicious behaviour in VANET might cause serious loss or even death in reality, we should also refrain from using beacons to exchange privacy-sensitive information in V2V (Vehicle to Vehicle). In this paper, a multi-hop broadcast scheme that makes use of RSU and V2I (Vehicle to Infrastructure) communication is proposed. The simulation result shows that the proposed scheme outperforms static stochastic broadcast scheme in terms of delivery rate. Comparing to flooding, we offer a better delay and less network usage.

  • A Multipath Energy-Efficient Probability Routing Protocol in Ad Hoc Networks

    Zhimu Huang, Ryo Yamamoto, Yoshiaki Tanaka

    2014 16TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY (ICACT)     224 - 250  2014  [Refereed]

     View Summary

    Ad hoc networks are decentralized type of wireless networks. Moreover, ad hoc networks are characterized by random, multi-hop topologies that may change rapidly over time because of mobile nodes. However, since nodes in ad hoc networks operate on limited battery energy and it is impractical to recharge or replace the battery, an energy-efficient protocol is important in the design of ad hoc networks. By conventional routing protocols, a shortest path is always selected in ad hoc networks. Without considering the energy consumption, some nodes will exhaust very soon and ad hoc networks will become partitioned. Improving routing protocols to prolong the lifetime of ad hoc networks has been a hot research area in the past few years. However, most of protocols only focus on the constrained battery energy. In this paper, a new protocol is proposed. It is a multipath energy-efficient probability routing protocol based on AODV (MEP-AODV). In MEP-AODV, not only battery energy consumption but also multipath selection is considered. By the proposed protocol, when an intermediate node received a request packet (RREQ), it won't relay the RREQ immediately. It will relay the RREQ with a probability which is based on its remaining battery energy. After the RREQ arrived at the destination node, it won't trigger a reply packet (RREP) at once until the expiry of a delay timer. The destination will select multiple paths with sufficient battery energy from the collected paths after the timer expired. Then the destination node initiates the corresponding RREPs. The source node can send data packets via the selected multiple paths by a probability function which is based on the minimum node remaining battery energy of one path. This proposed protocol is implemented in QualNet to evaluate the performance. From the results, MEP-AODV shows the good energy efficiency in terms of the maximizing the lifetime of ad hoc networks.

  • Performance Analysis of Fixed Node Assisted Opportunistic Routing for Ad Hoc Networks

    Tatsuya Shirai, Taku Yamazaki, Ryo Yamamoto, Takumi Miyoshi, Yoshiaki Tanaka

    2014 SECOND INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR)     260 - 265  2014  [Refereed]

     View Summary

    In ad hoc networks, we can achieve better performance if we use fixed nodes besides mobile nodes. In this paper, we first present a network model comprised of fixed nodes with enough network resource as well as mobile nodes. Then, we propose a novel routing method that opportunistically selects the most stable links through fixed nodes in preference to links through mobile nodes based on the mobility information of neighbouring nodes. The proposed method also relieves packet losses due to its simple retransmission function among fixed nodes. The simulation results show that the proposed method opportunistically selects stable links and able to improve the performance with higher packet delivery rate and lower control message overhead.

    DOI

    Scopus

  • Neighbour Traffic Adaptive Load Balancing Method Using Transmission Rate Control for Ad Hoc Networks

    Ryo Yamamoto, Takumi Miyoshi, Yoshiaki Tanaka

    IEICE Transactions on Communications (Japanese Edition)   J96-B ( 7 ) 782 - 792  2013.07  [Refereed]

     View Summary

    In ad hoc networks, since it is hard to realize the centralized management of network state due to their distributed manner, dynamic changes of the network topology by terminals' mobility may cause the increase of traffic load on a certain terminal or in a certain location. As concerns this problem, routing algorithms based on traffic load or TCP for ad hoc networks have been proposed to improve a communication efficiency. However, the load-balancing routing algorithms hardly control the load in the environment where both the network topology and the traffic drastically change in a short period. Furthermore, TCP for ad hoc network mainly aims for the throughput improvement. Therefore, the methods may not be appropriate for the network entirely in terms of load balancing. For achieving efficient load balancing in ad hoc networks, this paper proposes a novel method by overhearing the neighbouring terminals' activity as well as exchanging traffic load on the transmission routes. The proposed method controls the transmission rate depending on the states of the neighbouring terminals and the transmission route, and consequently achieves load balancing in the network. The computer simulation clarifies the efficiency of the proposed load balancing method and its fairness achievement.

    CiNii

  • Neighbour Traffic-Aware Load Balancing Method in Ad Hoc Networks

    Ryo Yamamoto, Takumi Miyoshi, Yoshiaki Tanaka

    4th International Conference on Intelligent Networking and Collaborative Systems (INCoS2012)     193 - 197  2012.09  [Refereed]

     View Summary

    Load balancing in ad hoc networks is more challenging issue than that in wired networks because the nature of decentralized network management and terminal mobility makes it difficult to realize appropriate controls for the whole network. Although some traffic-based load balancing methods that work with rerouting mechanisms have been proposed, they are, due to the overhead for rerouting, hard to adapt the environment where the traffic or the topology changes in a short period. Furthermore, the conventional methods cannot always find appropriate routes since they only give attention to the current transmission route. This paper proposes a load balancing method based on adaptive transmission rate control using neighbouring terminals' and relay terminals' status. The proposed method does not adopt a rerouting mechanism but introduce a rate control so that we do not have to consider the overhead for rerouting. Computer simulation showed that, depending on terminals' status, our method achieves more effective load balancing, as well as better throughput, than the conventional rerouting-based methods.

    DOI

    Scopus

    2
    Citation
    (Scopus)
  • Historical Evidence Based Trust Management Strategy against Black Hole Attacks in MANET

    Bo Yang, Ryo Yamamoto, Yoshiaki Tanaka

    14th International Conference on Advanced Communication Technology     394 - 399  2012.02  [Refereed]

  • A Method for Side Splitting of Packet Trace

    Marat Zhanikeev, Ryo Yamamoto, Kyoko Yamori, Yoshiaki Tanaka

    13th Asia-Pacific Network Operations and Management Symposium   ( TS6-1 )  2011.09  [Refereed]

  • A Load Balancing Method with Adaptive Transmission Rate Control in Ad Hoc Networks

    Ryo Yamamoto, Takumi Miyoshi, Yoshiaki Tanaka

    13th Asia-Pacific Network Operations and Management Symposium (APNOMS2011)    2011.09  [Refereed]

     View Summary

    Load balancing in ad hoc networks is more challenging issue than that in wired networks because the nature of decentralized network management and terminal mobility makes it difficult to realize appropriate controls for the whole network. Although some traffic-based load balancing methods that work with rerouting mechanisms have been proposed, they are, due to the overhead for rerouting, hard to adapt the environment where the traffic or the topology changes in a short period. Furthermore, the conventional methods cannot always find appropriate routes since they only give attention to the current transmission route. This paper proposes a load balancing method based on adaptive transmission rate control using neighbouring terminals' and relay terminals' status. The proposed method does not adopt a rerouting mechanism but introduce a rate control so that we do not have to consider the overhead for rerouting. Computer simulation showed that, depending on terminals' status, our method achieves more effective load balancing, as well as better throughput, than the conventional rerouting-based methods.

  • Wormhole Attack Defense Method Based on Observation Report for Mobile Ad Hoc Networks

    Qi Wang, Ryo Yamamoto, Yoshiaki Tanaka

    26th International Technical Conference on Circuit/System, Computer and Communications   ( P3-6 ) 1139 - 1142  2011.06  [Refereed]

  • Adaptive Transport Protocol Using Round Trip Time for Ad Hoc Networks

    Ryo Yamamoto, Takumi Miyoshi, Yoshiaki Tanaka

    IEICE Transactions on Communications (Japanese Edition)   J93-B ( 5 ) 735 - 746  2010.05  [Refereed]

     View Summary

    In ad hoc networks, since each terminal transmits data using radio communications, segment loss frequently occurs owing to radio interference or physical obstacles. In such environment, conventional transport protocols such as TCP Reno degrade their performance since the protocols take for the temporary segment loss as an occurrence of congestion. Moreover, TCP Vegas that is an improved version of TCP Reno degrades the performance and the fairness between TCP Reno in ad hoc networks. To these problems, TCP Westwood that builds bandwidth estimation into window control of TCP Reno and TCP Vegas-A that dynamically changes the threshold of TCP Vegas's window control have been proposed. In ad hoc networks, however, it is difficult to estimate bandwidth or adapt to significant state changes. In this paper, we propose a novel transport protocol using RTT to adjust transmission rate according to a network state and to reduce redundant segment retransmission. The efficiency of the proposed method and its fairness achievement among protocols and terminals are clarified by the computer simulation.

    CiNii

  • Pricing for maximizing provider's revenue in multicast content delivery services

    Takehiro Kajita, Kyoko Yamori, Yoshiaki Tanaka

    TOWARDS SUSTAINABLE SOCIETY ON UBIQUITOUS NETWORKS   286   173 - +  2008  [Refereed]

     View Summary

    With the rapid growth of broadband computer networks, users are inclined to use delivery services that can handle large-size content. When offering download service of popular contents, it is more useful to use a multicast system and deliver content to all users who request the content than using unicast system. Using a multicast system, the content server can increase the number of users and decrease user's waiting time. As a result, increasing user's WTP (Willingness To Pay) and the provider's revenue can be expected. In this paper, we suggest two content delivery methods which can be employed in the multicast content download services. We also discuss the provider's revenue of each delivery method. Using user's behaviour model in which a user participates in the service and leaves it, we show the relation between price for the service and user's participation rate of the service through simulation. The relation between price and the provider's revenue is also demonstrated in the simulation. In addition, in each delivery method, we show an optimal price which maximizes the provider's revenue.

  • Evaluation Indices of Many-to-Many Multicast Routing Tree to Represent Delay Performance

    Hajime Karasawa, Shinsuke Terada, Takumi Miyoshi, Kyoko Yamori, Yoshiaki Tanaka

    2006 Asia-Pacific Conference on Communications (APCC 2006)   ( 2.00E-06 )  2006.08  [Refereed]

     View Summary

    The optimization of multicast routing tree is an important issue for efficient multicast communication. Some previous papers have tried to analyze the one-to-many multicast tree and have obtained that the most efficient tree depends on the characteristics of the receivers such as the number of receivers. For many-to-many multicast, on the other hand, the effi-ciency of the tree has not been analyzed. This paper analyzes how various components affect the efficiency of the many-to-many multicast tree. As a result, it is shown that the most efficient many-to-many multicast tree does not depend on the number of multicast mem-bers. The result also tells that the diameter of the tree, the variance of node degrees, and the number of leaf nodes mostly decide the delay performance of the tree.

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • A two-stage simulated annealing logical topology reconfiguration in IP over WDM networks

    SG Xu, K Sezaki, Y Tanaka

    IEICE TRANSACTIONS ON COMMUNICATIONS   E88B ( 6 ) 2483 - 2494  2005.06  [Refereed]

     View Summary

    WDM optical networks represent the future direction of high capacity wide-area network applications. By creating optical paths between several nodes in the core networks, a logical topology can be created over the physical topology. By reconfiguring the logical topology, network resource utilization can be optimized corresponding to traffic pattern changes. From the viewpoint of network operation, the complexity of reconfiguration should be minimized as well. In this paper we consider the logical topology reconfiguration in arbitrary topology IP over WDM networks with balancing between network performance and operation complexity. The exact formulation of the logical topology reconfiguration problem is usually represented as Mixed Integer Linear Programming, but it grows intractable with increasing network size. Here we propose a simulated annealing approach in order to both determine the target topology with a smaller logical topology change and also satisfy the performance requirement. A threshold on the congestion performance requirement is used to balance the optimal congestion requirement and operation complexity. This is achieved by tuning this threshold to a feasible value. For effective solution discovery, a two-stage SA algorithm is developed for multiple objectives optimization.

    DOI

  • Adaptive Content Delivery System with Multicasting and Buffering on Heterogeneous Networks

    Takumi Miyoshi, Yoshiaki Tanaka

    IEICE Transactions on Information and Systems   E88-D ( 2 ) 204 - 213  2005.02  [Refereed]

     View Summary

    If multicasting is applied to a content delivery system, the transmission speed must be set to the lowest one among the available capacities of links on the multicast tree for all client terminals to receive the contents simultaneously. This paper studies effective content delivery systems for non-real-time point-to-multipoint services over heterogeneous environments and proposes an adaptive delivery system to select multicasting and store-and-forward transferring data streams. The results obtained by computer simulation show that our proposed system can reduce delivery time.

    DOI CiNii

    Scopus

    1
    Citation
    (Scopus)
  • Adaptive Contents Delivery Protocol for Variable-Speed Multicast Trees

    Hideaki Tetsuhashi, Takumi Miyoshi, Yoshiaki Tanaka

    IEEE Conference on Convergent Technologies for the Asia-Pacific Region (TENCON 2004)     644 - 647  2004.11  [Refereed]

     View Summary

    This paper proposes an adaptive content delivery system over multicast trees and discusses its implementation. Considering some limitations of real network, this paper proposes the use of link capacity measurement. Adaptiveness is based on the measurement and can trigger temporary storage of data in case the discrepancy is found among downstream links originating from the same node.

    DOI

  • Routing Group Management with Traffic Impact on Hierarchical Routing

    Akiyoshi Atsumi, Takumi Miyoshi, Yoshiaki Tanaka

    5th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2003)     499 - 504  2003.11  [Refereed]

     View Summary

    This paper proposes a grouping management method that introduces traffic information as well as static link metrics, into the decision on hierarchical routing groups. The obtained results show that this method greatly reduces the size of routing data while maintaining a low average delay in the networks.

  • Proposal of Service-Adaptive Selection Method for Multiple Transport Networks and Its Evaluation

    Wataru Kagiyama, Takumi Miyoshi, Yoshiaki Tanaka

    5th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2003)     91 - 96  2003.11  [Refereed]

     View Summary

    This paper proposes a new network service architecture that supports both the packet-switched network and the circuit-switched network for the next generation networks. The simulation results show that our proposed system can reduce the delay jitters and obtain better throughput.

  • Dynamic Multicast Routing with Predetermined Path Approach for Layered Streams

    Takumi Miyoshi, Takuya Asaka, Yoshiaki Tanaka

    IEICE Transactions on Communications   E86-B ( 6 ) 1829 - 1838  2003.06  [Refereed]

     View Summary

    Since a layered multicast technique accommodates different types of users in the same multicast group, it helps to provide multicast services in a heterogeneous environment. However, this makes it difficult to construct an efficient routing tree when receivers join or leave a multicast session dynamically. In the proposed algorithm, we adopt a pre-determined path approach to handle such dynamic membership of a layered multicast session without the burden of much additional traffic. Simulation results show that the proposed algorithm can minimize the average multicast tree cost.

    CiNii

  • Network extension method considering increase of multicast traffic

    T Miyoshi, Y Tanaka, K Sezaki

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS   86 ( 6 ) 69 - 83  2003  [Refereed]

     View Summary

    Recently, the spread of multicast communication is expected from the perspective of the efficient utilization of the network. Since the connection state of multicast communication clearly differs from that of conventional unicast communication, the optimum network topology is believed to change if multicast communication spreads in the future. The authors studied the network topology used when unicast communication and multicast communication are mixed. It was found that the Delta-Star topology was optimal compared to the Star topology currently used in the lowest level of the network. In this paper, we studied the performance of each topology from the perspective of the required capacity of the equipment and the costs required to construct the network when a circuit switching or a connection service was assumed and the multicast traffic increased. Furthermore, we proposed a network extension method that changed the topology from the Star to the Delta-Star topology and evaluated the performance. We found that by using a relatively simple extension method to set the locations of the transmission route link extensions, adequate cost performance was obtained. (C) 2003 Wiley Periodicals, Inc.

    DOI

    Scopus

  • A heuristic method of logical topology reconfiguration in IP/WDM optical networks

    SG Xu, K Sezaki, Y Tanaka

    ICT'2003: 10TH INTERNATIONAL CONFERENCE ON TELECOMMUNICATIONS, VOLS I AND II, CONFERENCE PROCEEDINGS     6 - 11  2003  [Refereed]

     View Summary

    WDM optical networks represent the direction to the future high capacity wide-area network applications. By creating the optical paths between several nodes in the core networks, logical topology can be created over the physical topology. The network can dynamically change its logical topology corresponding to the changing traffic conditions. In this paper we consider the method of logical topology reconfiguration in wavelength routed optical networks. The exact formulation of the logical topology problem is usually given as a Mixed Integer Linear Programming, but it grows intractable with increasing size of network. Heuristic approaches have been proposed, here we also proposed a different heuristic approach to determine the logical topology reconfiguration.

  • A Multicast Routing Algorithm for Satellite-Terrestrial Networks

    Hiroyuki Kawada, Takumi Miyoshi, Yoshiaki Tanaka

    8th Asia-Pacific Conference on Communications (APCC 2002)     598 - 601  2002.09  [Refereed]

     View Summary

    We propose an effective routing algorithm for satellite-terrestrial (ST) networks. Among the nodes requesting the highest quality, the proposed algorithm selects a path that satisfies the end-to-end delay bound and consumes the minimum network resource. The results show that the proposed algorithm utilizes network resource more efficiently and satisfies better QoS than conventional algorithms.

  • Fast Topological Design with Simulated Annealing for Multicast Networks

    Takumi Miyoshi, Shintaro Shimizu, Yoshiaki Tanaka

    7th IEEE Symposium on Computers and Communications (ISCC 2002)     959 - 966  2002.07  [Refereed]

     View Summary

    This paper investigates topological designs for multicast networks using simulated annealing (SA) and proposes a new method for finding an effective initial solution to the problem of reducing the computational time of SA. The results show that the computational time needed to reach the final solution becomes shorter if our proposed method is applied.

    DOI CiNii

    Scopus

    7
    Citation
    (Scopus)
  • Cost-based Pricing for Multicast Streaming Services

    Eiji Takahashi, Takaaki Ohara, Takumi Miyoshi, Yoshiaki Tanaka

    10th International Telecommunication Network Planning Symposium (Networks 2002)     245 - 249  2002.06  [Refereed]

     View Summary

    We consider the case where an information provider (sender) provides receivers with multicast-type video streaming services by using the network resources owned by a telecommunication carrier. First, we consider some cost sharing methods to determine the charge in multicast-type streaming services and then calculate the shared cost to analyze the cost structure of multicast-type streaming services.

  • Dynamic Routing with Predetermined Path Search for Layered Multicast Streams

    Takumi Miyoshi, Takuya Asaka, Yoshiaki Tanaka

    16th International Workshop on Communications Quality & Reliability (CQR 2002)     159 - 163  2002.05  [Refereed]

     View Summary

    This paper proposes a new dynamic multicast routing algorithm for layered streams. In the proposed algorithm, we adopt a pre-determined path approach in order to handle such a dynamic membership of a layered multicast session without the burden of much additional traffic. Simulation results show that the proposed algorithm can minimize the average multicast tree cost and that it works well on large-scale networks.

  • Evaluation of Local-Recovery-Based Retransmission for Multicast Network

    Jun Ito, Takumi Miyoshi, Yoshiaki Tanaka

    4th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2001)     208 - 212  2001.11  [Refereed]

     View Summary

    This paper focuses on retransmission methods with local recovery systems since they must be the better solutions for the large-scale multicasting on the worldwide network. We use typical kinds of network topologies: star, ring, delta-star, and discuss the suitable network topology for the reliable multicasting from the viewpoint of network construction cost.

  • Waiting Time versus Utility to Download Images

    Kazutomo Nomura, Kyoko Yamori, Eiji Takahashi, Takumi Miyoshi, Yoshiaki Tanaka

    4th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2001)     128 - 132  2001.11  [Refereed]

     View Summary

    The utility of a contents delivery network depends on the waiting time. This paper deals with the priority control of contents delivery networks from the viewpoint of utility. This paper experiments on image downloading services for obtaining the relationship between the waiting time and the utility. Then, a function of the utility versus the waiting time is estimated. This function is applied to the optimization of the priority control of an image delivery system.

    CiNii

  • Adaptive Contents Delivery System Using Multicasting and Buffering in Best Effort Networks

    Takumi Miyoshi, Yoshiaki Tanaka

    4th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2001)     101 - 105  2001.11  [Refereed]

     View Summary

    This paper studies the effective contents delivery systems for non-real-time point-to-multipoint services on best effort networks, and proposes the adaptive delivery system to select multicasting and store-and-forward transferring. The results show that our proposed system can reduce the delivery time, and taht it is scalable to large networks and robust against network sizes or environmental heterogeneities.

  • Optimization of Robust Enterprise Networks against Diverse Tariff Structures

    Kagemasa Mouri, Takumi Miyoshi, Yoshiaki Tanaka

    4th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2001)     79 - 83  2001.11  [Refereed]

     View Summary

    The aim of this paper is finding the suitable enterprise network that is robust against diverse tariff structures, considering appropriate path selections. Simulated annealing is applied to search better solutions regardless of topological connectivities.

  • Cost Sharing Methods for Multicast Services and Probability Distribution of Shared Cost

    Eiji Takahashi, Takaaki Ohara, Takumi Miyoshi, Yoshiaki Tanaka

    4th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2001)     74 - 78  2001.11  [Refereed]

     View Summary

    This paper discusses cost sharing methods where many users share multicast flows and describes how these costs are shared among the members of multicast groups. First, we consider some cost sharing methods to determine the charge in a multicast-type services and then calculate the probability distribution of the shared cost.

  • Optimal Grouping Method for Hierarchical Routing

    Akiyoshi Atsumi, Takumi Miyoshi, Yoshiaki Tanaka

    4th Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT 2001)     64 - 68  2001.11  [Refereed]

     View Summary

    This paper focuses on the grouping methods on hierarchical routing protocols. Under the assumption that the network topology cannot be changed physically, the optimal grouping methods for the hierarchical routing are proposed. The efficiency of routing is evaluated using steady-state simulations.

  • Label Algorithm for Delay-Constrained Dynamic Multicast Routing

    Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka

    IEICE Transactions on Communications   E84-B ( 1 ) 55 - 62  2001.01  [Refereed]

     View Summary

    Conventional delay-constrained dynamic multicast routing algorithms are not practical because they allow two coming path where nodes in a multicast tree transit the several identical data flows. This paper proposes a new algorithm which uses a QoS label to prevent the occurrence of two coming path and can construct an efficient multicast tree for any traffic volume.

    CiNii

  • Dynamic multicast routing algorithm using predetermined path search

    T Asaka, T Miyoshi, Y Tanaka

    IEICE TRANSACTIONS ON COMMUNICATIONS   E83B ( 5 ) 1128 - 1135  2000.05  [Refereed]

     View Summary

    With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

  • Virtual-cost-based algorithm for dynamic multicast routing in satellite-terrestrial networks

    T Asaka, T Miyoshi, Y Tanaka

    IEICE TRANSACTIONS ON COMMUNICATIONS   E83B ( 3 ) 680 - 689  2000.03  [Refereed]

     View Summary

    Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast services. This is because satellite broadcasting is suitable for a large multicast group and a terrestrial network is suitable for a small multicast group. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. Conventional dynamic routing algorithms for terrestrial networks cannot construct an efficient multicast routing tree because they basically select a less-expensive route when a node is added. We have developed a dynamic routing algorithm, a virtual-cost-based algorithm, for ST networks that selects: the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.

  • Application of delta-star topology to multicast network

    T Miyoshi, Y Tanaka, K Sezaki

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART II-ELECTRONICS   83 ( 11 ) 44 - 56  2000  [Refereed]

     View Summary

    A significant percentage of traffic will be occupied by various kinds of multicast services, beginning with the broadcasting services in a B-ISDN. In order to reduce the traffic on transmission paths in multicast services, point-to-multipoint connections are used, which are significantly different from the past point-to-point connections. Thus, it is necessary to study the network topology for the case in which multicast services and point-to-point communications services coexist. On the other hand, the delta-star topology has been proposed as a topology effective for enhancing the reliability of the point-to-point communications networks. Since this topology combines the ring topology, which is advantageous for multicasting, and the star topology, which is advantageous for point-to-point communications, this topology is considered to be effective for the case in which both services coexist. In this paper, the network construction cost is evaluated for the cases in which various topologies such as the mesh, star, ring, multiring, and delta-star topologies are applied to communications networks in which multicast services and point-to-point communications services coexist. It has been found that the delta-star topology is optimal for many cases, regardless of the receiving probabilities or transmission bandwidth of various services, transmission path constructed network topologies, and so forth. (C) 2000 Scripta Technica.

  • Multicast routing in ATM network

    H Kojima, T Miyoshi, Y Tanaka, H Tominaga

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS   83 ( 4 ) 105 - 114  2000  [Refereed]

     View Summary

    It is expected that when B-ISDN is implemented, a large portion of the traffic will be occupied by various multicast services, including broadcast. Among the services that are expected to emerge in the future, such as minibroadcasts and specialized broadcasts, each station has few listeners, with the number varying with time. Thus, dynamic multicast routing is required. As another point, in the ATM network that provides the basis for B-ISDN, VP is provided as a network, and routing must be executed considering the VP environment. This article proposes a direct VP limiting algorithm that controls the use of VP and evaluates the performance when the algorithm is applied to the ATM network. It is found that the proposed algorithm is suitable when the physical network has a non-hierarchical configuration, while the static routing suffices when the network has a hierarchical configuration. (C) 1999 Scripta Technica, Electron Comm Jpn Pt 1, 83(4): 105-114, 2000.

  • New distributed multicast routing and its performance evaluation

    T Asaka, T Miyoshi, Y Tanaka

    NETWORKING 2000   1815   835 - 846  2000  [Refereed]

     View Summary

    With conventional dynamic routing algorithms, many query messages are required in a distributed environment for efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared with conventional dynamic routing algorithms when nodes are added to or removed from the multicast group during steady-state simulation.

    DOI

    Scopus

    1
    Citation
    (Scopus)
  • A new routing algorithm for delay-constrained dynamic multicast

    T Asaka, T Miyoshi, Y Tanaka

    ECUMN '2000: 1ST EUROPEAN CONFERENCE ON UNIVERSAL MULTISERVICE NETWORKS, PROCEEDINGS     231 - 238  2000  [Refereed]

     View Summary

    Many new multimedia applications involve dynamic multiple participants, have stringent source-to-end delay requirements, and consume large amounts of network resources. A conventional algorithm that allows "two coming paths", where nodes in a multicast tree transmit the several identical data flows, is therefore not practical. We have developed an algorithm for delay-constrained dynamic routing. This algorithm uses a QoS label to prevent the occurrence of "two coming paths", and can construct an efficient multicast tree for any traffic volume. The proposed algorithm was superior to conventional routing algorithms in terms of cost nodes were added to or removed from the multicast group during a steady-state simulation.

    DOI

    Scopus

  • Robust topology for enterprise networks against diverse tariff structures

    T Miyoshi, K Mouri, T Asaka, Y Tanaka

    ECUMN '2000: 1ST EUROPEAN CONFERENCE ON UNIVERSAL MULTISERVICE NETWORKS, PROCEEDINGS     344 - 350  2000  [Refereed]

     View Summary

    Rapid technological growth is bringing about price reductions in network components, and the tariff structures of leased line services have been changing drastically. Since most enterprise networks are constructed using leased line services, their effective constructions become very important issues. This paper analyzes the characteristics of enterprise network topologies when the tariff structure changes, and examines the topology that is robust against the diverse tariff structures. A topological design for robust enterprise networks is also discussed. The obtained results lead us to important conclusions, which we will use as guidelines when ne design enterprise networks.

    DOI

    Scopus

  • Topological Design Comparison for Multicast Network

    Takumi Miyoshi, Yoshiaki Tanaka, Kaoru Sezaki

    IEEE Global Communications Conference (GLOBECOM'99)     1899 - 1904  1999.12  [Refereed]

     View Summary

    In this paper, network construction cost is examined by applying each of the following topologies: Star, Ring, Multi-Ring, and Delta-Star. The results show that the Delta-Star topology is the most suitable for multicast networks in many cases.

    DOI CiNii

  • Multicast Routing in Satellite-Terrestrial Networks

    Takuya Asaka, Takumi Miyoshi, Yoshiaki Tanaka

    5th Asia-Pacific Conference on Communications (APCC'99)   1   768 - 771  1999.10  [Refereed]

     View Summary

    Satellite-terrestrial network, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast service. We have developed a dynamic routing algorithm for satellite-terrestrial networks that selects the route to use according to the multicast group size when a node is added to the group.

    DOI

    Scopus

    7
    Citation
    (Scopus)
  • A Study on Multicast Network Topology Extension

    Takumi Miyoshi, Yoshiaki Tanaka, Kaoru Sezaki

    1999 Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT'99)     73 - 77  1999.08  [Refereed]

     View Summary

    This paper focuses on the lower layer of the hierarchically structured network and evaluates the topological extension algorithms from Star to Delta-Star. The results show that Shortest Link First algorith, which uses only link lengths, can work as well as Greedy Heuristic.

  • Multicast Network Design by the Use of Heuristic Algorithms

    Shintaro Shimizu, Takumi Miyoshi, Yoshiaki Tanaka

    1999 Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT'99)     68 - 72  1999.08  [Refereed]

     View Summary

    In this paper, the multicast network design methods using heuristic algorithms are proposed for the area assumed to be the lowest layer of the hierarchical network. The results show that heuristic algorithms are better than the conventional methods, which use the basic topologies, such as star, mesh, ring from the viewpoint of the network construction cost.

  • Optimal hierarchical structure of broadcast network

    T Miyoshi, Y Tanaka

    ELECTRONICS AND COMMUNICATIONS IN JAPAN PART I-COMMUNICATIONS   82 ( 2 ) 48 - 56  1999.02  [Refereed]

     View Summary

    With the realization of broadband integrated service digital networks (B-ISDN), broadcast services will occupy a large part of the network traffic. In these services, the same information is distributed to many subscribers through the point-to-multipoint connection paths. This connection form is quite different from that of conventional point-to-point services. Since the conventional network structure is designed for point-to-point services, the current network topology may lower the quality of service or may increase construction costs. In this paper, the hierarchical broadcast network topology is optimized under certain assumptions: the cost functions, the population distribution, and the percentage of broadcast services are treated as parameters. The result shows that the ring-star-star or ring-ring-star topologies can be better than the conventional mesh-star topology in some cases, and can be much better when the viewing ratio of broadcast services increases. (C) 1998 Scripta Technica, Electron Comm Jpn Pt 1, 82(2): 48-56, 1999.

  • An Application of Delta-Star Topology to Multicast Network

    Takumi Miyoshi, Yoshiaki Tanaka, Kaoru Sezaki

    IEICE Transactions on Communications (Japanese Edition)   J81-B-I ( 12 ) 827 - 838  1998.12  [Refereed]

     View Summary

    Delta-Star topology may be effective for multicast network since it has a mixing form of the Ring topology, suitaable for multicast connections, with the Star topology, suitable for point-to-point connections. In this paper, network construction cost is examined by applying some topologies. The result shows Delta-Star topology is the most suitable for multicast network in many cases.

    CiNii

  • Multicast Routing in ATM Network

    Hisashi Kojima, Takumi Miyoshi, Yoshiaki Tanaka, Hideyoshi Tominaga

    IEICE Transactions on Communications (Japanese Edition)   J81-B-I ( 6 ) 362 - 370  1998.06  [Refereed]

     View Summary

    Since ATM networks have many virtual paths, the dynamic multicast routing will be complicated than that for the conventional network. This paper proposes a new dynamic multicast routing method which limits to use virtual paths. The result shows the proposed method is suitable for physically non-hierarchical ATM network.

    CiNii

  • Optimal Hierarchical Structure of Nationwide Multicast Network

    Takumi Miyoshi, Yoshiaki Tanaka, Kaoru Sezaki

    3rd Asia-Pacific Conference on Communications (APCC'97)   1   105 - 109  1997.12  [Refereed]

     View Summary

    In this paper, the hierarchical network topology is optimized under the assumption that the broadcast and multicast services account for a large part of the network traffic. The result shows that the Ring-Star-Star topology or the Ring-Ring-Star topology can be better than the conventional Mesh-Star topology in some cases.

  • Optimal Topology Design of the Integrated Telecommunication and Broadcast Network

    Takumi Miyoshi, Yoshiaki Tanaka, Kaoru Sezaki

    1997 Asia-Pacific Symposium on Information and Telecommunication Technologies (APSITT'97)   2   13.3.1 - 13.3.5  1997.03  [Refereed]

     View Summary

    In this paper, the new basic topology which combines Ring topology with Star topology is proposed, and the hierarchical network topology is optimized. The result is that the proposed topology is especially suited to achieving low switch cost.

    CiNii

  • N-1 CONNECTION SWITCHING-NETWORKS SUITED FOR TIME-DIVISION SWITCHING

    K SEZAKI, Y TANAKA, M AKIYAMA

    COMPUTER NETWORKS AND ISDN SYSTEMS   20 ( 1-5 ) 383 - 389  1990.12  [Refereed]

     View Summary

    Two types of n:1 non-blocking switching networks are proposed. One is the Cascade Clos Network, which is non-blocking under the condition of simultaneous origination of multiconnection calls. The other is the Cascade Benes Network, which is rearrangeable non-blocking. Then, both switching networks are applied to TSTST time division switching networks. Both networks can also be combined in TSTST configuration. This is very flexible and suitable for a multi-service switching network in broadband-ISDN.

    DOI

    Scopus

  • A noncongestion self‐routing control algorithm of generalized benes network

    Kaoru Sezaki, Yoshiaki Tanaka, Minoru Akiyama

    Electronics and Communications in Japan (Part I: Communications)   73 ( 11 ) 43 - 49  1990  [Refereed]

     View Summary

    Recently, to realize broadband ISDN, ATM has been studied vigorously. As the switching network for ATM, the delta network and other switching networks have been investigated by a number of researchers. The delta network performs the self‐routing based on the multistage connection of 2 × 2 sized matrix switches. However, this network has a problem in that the throughput is decreased drastically when the traffic imposed on the switching network is nonuniform. To avoid such a situation, a method is proposed to make the whole network a Benes network by placing a distribution network preceding the delta network to balance out the traffic. The addition of the distribution network, however, has only been investigated for the case where all matrix switches are of the same size. With this as the background, this paper discusses the switching network with several sizes of matrix switches. The method of placing the distribution network is discussed together with the characteristics, and application examples are presented. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company

    DOI

    Scopus

  • Tree configuration of n:1 multiconnection nonblocking switching networks

    Yoshiaki Tanaka, Kaoru Sezaki, Minoru Akiyama

    Electronics and Communications in Japan (Part I: Communications)   73 ( 8 ) 1 - 10  1990  [Refereed]

     View Summary

    With the widespread use of broadband communication, the nonblocking N:1 multiconnection switching network is required in video distribution and in other applications. In most of the N:1 multiconnection nonblocking switching networks, some rearrangements or simultaneous origination of multiconnection calls must be assumed. For the switching network which is nonblocking for any N:l multiconnections under no conditions, only a few studies have been made on the three‐stage switching network. This paper proposes an efficient method of constructing a switching network which can realize arbitrary nonblocking N:1 multi‐connections. First, the construction of a d:1 connection network is shown which serves as the fundamental component of the proposed structure. Then it is shown that by connecting several d:1 connection networks an N:1 multiconnection switching network which can realize arbitrary N:1 connection can be constructed. The number of crosspoints required in the switching network is calculated. Copyright © 1990 Wiley Periodicals, Inc., A Wiley Company

    DOI

    Scopus

▼display all

Misc

  • Auction Based Trading for Multiple Network Resources Using Relation between Failure Rate and Users’ Utility

    大石晴夫, 矢守恭子, 矢守恭子, ZHANG Cheng, 田中良明, 田中良明

    電子情報通信学会技術研究報告   119 ( 358(ICM2019 30-40)(Web) )  2020

    J-GLOBAL

  • Relation between Telecommunication Network Failure Rate and User’s Utility

    大石晴夫, 矢守恭子, 矢守恭子, ZHANG Cheng, 田中良明, 田中良明

    電子情報通信学会技術研究報告   119 ( 52(ICM2019 1-5)(Web) )  2019

    J-GLOBAL

  • B-6-111 Block-based Transmission with Adaptive Reliability Control for Ad Hoc Networks

    Sakaguchi Tomoaki, Yamazaki Taku, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2016 ( 2 ) 111 - 111  2016.03

    CiNii

  • BS-2-5 Load Reduction Method Based on Hop Count and Neighbour Relation in Opportunistic Routing

    Yamazaki Taku, Yamamoto Ryo, Miyoshi Takumi, Asaka Takuya, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2016 ( 2 ) "S - 6"-"S-7"  2016.03

    CiNii

  • BS-6-3 Automatic Test Case Generation for Web Applications through Page Object(BS-6.Network and service Design, Control and Management)

    Yu Bing, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2015 ( 2 ) "S - 21"-"S-22"  2015.08

    CiNii

  • BS-6-7 Advanced Principal-Agent Theory Based Packet Forwarding Incentive Strategy with Reinforcement Learning in Ad Hoc Networks(BS-6.Network and service Design, Control and Management)

    Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2015 ( 2 ) "S - 28"-"S-29"  2015.08

    CiNii

  • BS-6-12 An End-to-End Reliability Enhancement Scheme for DTN(BS-6.Network and service Design, Control and Management)

    San Saw David, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2015 ( 2 ) "S - 38"-"S-39"  2015.08

    CiNii

  • B-6-69 Retransmission Control Method Based on Forwarding Eligibility for Opportunistic Routing

    Yamazaki Taku, Yamamoto Ryo, Miyoshi Takumi, Asaka Takuya, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2015 ( 2 ) 69 - 69  2015.08

    CiNii

  • Opportunistic Routing Using Fixed Nodes for Load Balancing in Ad Hoc Networks

    SHIRAI Tatsuya, YAMAZAKI Taku, YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   114 ( 477 ) 13 - 18  2015.03

     View Summary

    Ad hoc network is regarded as an optimal solution to establish network on poor quality environments such as stricken areas due to its simple and low cost operation. However, conventional routing methods cause centralization of packet transmission load except for the occurrence of dynamic network topology changes. In this paper, we propose a novel location-based load balancing method that can decentralize packet transmission load of each node in the whole networks. The proposed method opportunistically selects a route for data transmission from several route candidates prepared for load balancing. The performance and the efficiency of the proposed method are also clarified by computer simulation.

    CiNii

  • BS-3-5 DTN Reliability Enhancement with Custody Transfer Retransmission(BS-3. Advanced Technologies in the Design, Management and Control for Future Innovative Communication Network)

    San Saw David, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2015 ( 2 ) "S - 18"-"S-19"  2015.02

    CiNii

  • BS-3-17 Load Balancing Opportunistic Routing Using Fixed Nodes for Ad Hoc Networks(BS-3. Advanced Technologies in the Design, Management and Control for Future Innovative Communication Network)

    Shirai Tatsuya, Yamazaki Taku, Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2015 ( 2 ) "S - 42"-"S-43"  2015.02

    CiNii

  • BS-3-47 Introduction and Simulation Analysis of a Novel LDoS Attack in Mobile Ad Hoc Networks(BS-3. Advanced Technologies in the Design, Management and Control for Future Innovative Communication Network)

    Yang Bo, Yu Bing, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2015 ( 2 ) "S - 97"-"S-98"  2015.02

    CiNii

  • BS-4-10 Opportunistic Routing Using Prioritized Forwarder and Hop-by-Hop Retransmission Control

    Yamazaki Taku, Yamamoto Ryo, Miyoshi Takumi, Asaka Takuya, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2015 ( 2 ) "S - 136"-"S-137"  2015.02

    CiNii

  • Performance Analysis of Opportunistic Routing Using Prioritized Forwarders and Hop-by-Hop Retransmission Control

    YAMAZAKI Taku, YAMAMOTO Ryo, MIYOSHI Takumi, ASAKA Takuya, TANAKA Yoshiaki

    IEICE technical report   114 ( 477 ) 19 - 24  2015.02

     View Summary

    In ad hoc networks, frequent packet losses and topological changes cause unstable communications. To solve this problem, OR (opportunistic routing) has been proposed. In OR, each terminal decides whether to forward a received packet based on a random backoff time. However, forwarder terminals must wait for the expiration of the random backoff timer before forwarding the packet. Moreover, it is difficult to obtain a transmission path diversity under a sparse environment. This paper proposes a forwarder selection method that uses the prioritized forwarders to reduce the backoff time. In addition, the proposed method also performs a retransmission control which is fit for the sparse environment. The performance and the effectiveness of the proposed method are clarified by computer simulation.

    CiNii

  • User Navigation Method for Access Point Selection Using Mobility Management

    YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   114 ( 298 ) 1 - 6  2014.11

     View Summary

    In a typical network service, the users request network resources so that their utility is maximized. On the other hand, the network operator assigns network resources to users without expecting the cooperation among users. This is a scramble for limited network resources, and it yields "tragedy of commons". Thus, the efficient allocation of network resources is a difficult problem. In this paper, we regard the resource allocation among users in the wireless network as a social dilemma, and propose a solving method based on the framework of mobility management.

    CiNii

  • Location-based Opportunistic Routing Using Fixed Nodes for Ad Hoc Networks

    SHIRAI Tatsuya, YAMAZAKI Taku, YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. CQ   114 ( 209 ) 53 - 58  2014.09

     View Summary

    To increase the availability of networks, there are a number of studies focusing on ensuring stable network environments on the unexpected occurrence of huge disaster. Above all, ad hoc networks are well suited for these situations due to its simple and rapid deployment of wireless networks at low costs. Several location-based routing protocols are proposed to enhance the performance by establishing stable transmission route. Scalability, however, are not taken into consideration due to the limitation of node mobility management on most location-based studies. In this paper, we propose a novel location-based routing method can improve communication efficiency by performing opportunistic link selections. Performance of the proposed method is verified by computer simulation.

    CiNii

  • BS-6-30 Reliable Message Transfer with Custodians in Delay Tolerant Networks(BS-6.Network and service Design, Control and Management)

    San Saw David, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2014 ( 2 ) "S - 94"-"S-95"  2014.09

    CiNii

  • BS-6-15 A Novel Battery-Aware Probabilistic Routing Protocol in Ad Hoc Networks(BS-6.Network and service Design, Control and Management)

    Huang Zhimu, Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2014 ( 2 ) "S - 64"-"S-65"  2014.09

    CiNii

  • BS-6-14 Passive Relay Suppression in Stochastic Broadcast for VANET(BS-6.Network and service Design, Control and Management)

    Fan Xing, Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2014 ( 2 ) "S - 62"-"S-63"  2014.09

    CiNii

  • BS-6-17 Incentive-Punishment Combined Bilateral Currency Framework against Dropping Packet Problem in Ad Hoc Networks(BS-6.Network and service Design, Control and Management)

    Yang Bo, Huang Zhimu, Fan Xing, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2014 ( 2 ) "S - 68"-"S-69"  2014.09

    CiNii

  • BS-6-18 Location-based Opportunistic Routing Using Fixed Nodes for Ad Hoc Networks(BS-6.Network and service Design, Control and Management)

    Shirai Tatsuya, Yamazaki Taku, Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2014 ( 2 ) "S - 70"-"S-71"  2014.09

    CiNii

  • BS-6-3 Efficient Association Control Algorithm for Wireless LANs Using Simulated Annealing(BS-6.Network and service Design, Control and Management)

    Yu Bing, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2014 ( 2 ) "S - 40"-"S-41"  2014.09

    CiNii

  • BS-3-4 Opportunistic Routing Using Prioritized Forwarder in Ad Hoc Networks

    Yamazaki Taku, Yamamoto Ryo, Miyoshi Takumi, Asaka Takuya, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2014 ( 2 ) "S - 5"-"S-6"  2014.09

    CiNii

  • A Novel Enhanced Max-Min Residual Battery-Aware Routing Protocol in Ad Hoc Networks

    HUANG Zhimu, YANG Bo, YAMAMOTO Ryo, TANAKA Yoshiaki

    IEICE technical report   114 ( 163 ) 149 - 154  2014.07

     View Summary

    An ad hoc network is characterized as a self-organized multi-hop wireless network. It does not rely on any pre-existing network infrastructures. Instead of this, each node can participate in the routing of packets to other nodes. However, each node in ad hoc networks is typically powered by batteries with a limited energy supply, and it is difficult to replace or to recharge them. Thus, it is crucial to consider how to conserve energy to maximize the network lifetime as an issue in the design of routing protocols. In conventional routing protocols, however, shortest-route algorithms are commonly used. Without considering energy consumption, nodes that are overused would drain their energy and the whole network would become partitioned. As concerns this problem, many battery-aware routing protocols have been proposed from a variety of perspectives. In this paper, we propose a novel enhanced max-min residual battery-aware routing protocol called EMAODV. It is expected to prolong the network lifetime by selecting an optimal route based on the battery conditions of the whole network. By EMAODV, the routes with insufficient battery energy are always avoided. If all the nodes in ad hoc networks have sufficient battery energy, a shortest route is selected. From the results of the performance evaluation, EMAODV shows a better performance in terms of prolonging the network lifetime.

    CiNii

  • B-6-95 QoE of Proactive Content Caching and Delivery Scheme Utilizing Transportation Systems

    Yamori Kyoko, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2014 ( 2 ) 95 - 95  2014.03

    CiNii

  • B-6-159 Opportunistic Routing Based on Forwarding History in Ad Hoc Networks

    Yamamoto Ryo, Yamazaki Taku, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2014 ( 2 ) 159 - 159  2014.03

    CiNii

  • BS-1-24 A Novel Packet Forwarding Incentive Strategy based on Principal-Agent Theory in Ad Hoc Networks(BS-1. Future Network Technologies for Advanced Information and Communications Society)

    Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2014 ( 2 ) "S - 46"-"S-47"  2014.03

    CiNii

  • BS-1-22 A Reliable Routing Method Using Local Repair for Ad Hoc Multicasting(BS-1. Future Network Technologies for Advanced Information and Communications Society)

    Shirai Tatsuya, Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2014 ( 2 ) "S - 42"-"S-43"  2014.03

    CiNii

  • BS-1-74 Reliability Enhancement for Stochastic Broadcast in VANET(BS-1. Future Network Technologies for Advanced Information and Communications Society)

    Fan Xing, Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2014 ( 2 ) "S - 139"-"S-140"  2014.03

    CiNii

  • BS-1-13 Parameter Selection Method for Accurate Available Bandwidth Estimation by pathChirp(BS-1. Future Network Technologies for Advanced Information and Communications Society)

    Dai Tianao, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2014 ( 2 ) "S - 25"-"S-26"  2014.03

    CiNii

  • B-11-17 User Navigation Service for Solving Access Point Selection Problem

    Suto Akifumi, Yamori Kyoko, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2014 ( 2 ) 465 - 465  2014.03

    CiNii

  • A Principal-Agent Theory based Game Theoretic Incentive Method for Packet Forwarding in Ad Hoc Networks

    YANG Bo, YAMAMOTO Ryo, TANAKA Yoshiaki

    Technical report of IEICE. CQ   113 ( 405 ) 11 - 16  2014.01

     View Summary

    Dropping packets is one of the most devastating threatens on a performance of ad hoc networks. Among various motivations of dropping packets, selfishness and malicious attack are the main two factors. However, there are still some other cases of dropping packets caused by networking context such as mobility, congestion, and traffic load. Incentive mechanism is a typical method to induce node to participate in relaying packets for other adjacent nodes. However, most of them neglect a noise of dropping packets by networking context or just omit this important factor for brevity. In this paper, a principal-agent theory based game theoretic incentive method is proposed for encouraging each node contributing into packet forwarding, which will result in a high performance cooperative network. Holmstrom-Milgrom model, which is a simplified principal-agent model with a linear reward scheme, is implemented to model the relationship between two adjacent nodes. In each two pair-wise nodes model, the node requests for relaying packets is seen as a principal node while the node forwarding packets is denoted as an agent node. A credit given by principal node to agent node as incentive compensation is the contract, which is designed by principal node based on agent node's effort in forwarding packets. Dropping packets by networking is also taken into consideration as an exogenous uncertainty. It is proven that there is an optimal incentive strategy can encourage packet forwarding even under noise effect. Numerical evaluations are also conducted to evaluate the performance of the proposed method.

    CiNii

  • Encouragement Talk : Routing Method with Local Repair for Ad Hoc Multicasting

    SHIRAI Tatsuya, YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   113 ( 360 ) 149 - 154  2013.12

     View Summary

    Due to the inherent broadcast nature of wireless communication, ad hoc networks are well suited for multicast that can more efficiently deliver information from source nodes to many client nodes simultaneously. In ad hoc networks, however, links are established and disconnected dynamically due to the transmission interference and node movement. In conventional multicast routing protocols, the topology dynamics cause route reconstruction, and it may lead delay increase and delivery ratio degradation. In this paper, a novel multicast routing protocol is proposed. This protocol can improve packet delivery rate of ODMRP(On-demand multicast routing protocol) by making use of link failure detection mechanism as well as nodes' mobility prediction based local repair mechanism. The performance and the efficiency of the proposed method are also clarified by computer simulation.

    CiNii

  • Implementation and Evaluation of Image Recommendation Based on Genre Learning in Social Network Services

    KAMIYA Yu, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   113 ( 208 ) 1 - 4  2013.09

     View Summary

    Most image recommendation services in SNS (Social Network Services) use collaborative filtering to calculate the similarity of contents. Collaborative filtering requires high computing power. It is difficult to calculate the recommendation indices immediately. In this paper, a new recommendation method is evaluated. It uses the genre information of the image content. The Web site application software is implemented to evaluate the accuracy of the recommendation.

    CiNii

  • BS-7-9 Direction-Based Relay Selection Scheme for Alert Message Broadcast in VANET

    Fan Xing, Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2013 ( 2 ) "S - 49"-"S-50"  2013.09

    CiNii

  • Evaluation of Image Recommendation Method Based on Genre Learning in Social Network Services

    Kamiya Yu, Yamori Kyoko, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2013 ( 2 ) 331 - 331  2013.09

    CiNii

  • Mobility-Based Opportunistic Routing for Ad Hoc Networks

    Yamamoto Ryo, Yamazaki Taku, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2013 ( 2 ) 66 - 66  2013.09

    CiNii

  • Opportunistic Routing Based on End-to-End Delay Estimation for MANET

    YAMAMOTO Ryo, YAMAZAKI Taku, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   112 ( 463 ) 325 - 330  2013.03

     View Summary

    In ad hoc networkserminals' mobility may cause dynamic change of network topology, which makes it difficult to establish stable transmission routes. As concerns this problem, opportunistic routing (OR), which does not rely on any specific route and forwards packets opportunistically using stable links, has been proposed. In order to achieve efficient packet forwarding in ad hoc networks, this paper proposes a new OR protocol based on the estimated end-to-end delay that is calculated from terminals' queue lengths and links' transmission success rates. The proposed method tries to use the terminals that have the shorter delay to the destination terminal as forwarders for realizing shorter end-to-end delay and higher throughput. The performance and the efficiency of the proposed method are also clarified by computer simulation.

    CiNii

  • B-6-139 Delay-Based Opportunistic Routing f<)r Ad Hoc Networks

    Yamamoto Ryo, Yamazaki Taku, Miyoshi Takumi, Tanaka Yoshiaki

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

    CiNii

  • B-11-8 An Effect of Parameter A(lj ustment of Resource Reservation Services for Corporate Users

    Okamoto Tsukasa, Miyake Kou, Yamori Kyoko, Tanaka Yoshiaki

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

    CiNii

  • BS-1-45 Game Theoretic Analysis of Reputation based IDS for Preventing Black Hole Attack in MANETs

    Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2013 ( 2 ) "S - 88"-"S-89"  2013.03

    CiNii

  • BS-5-37 A Novel Mitigation Strategy against Malicious Actions based on Risk Evaluation Aware Trust Management in MANETs(BS-5. Network and Service Design, Control and Management)

    Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2012 ( 2 ) "S - 98"-"S-99"  2012.08

    CiNii

  • B-6-16 Neighbour Traffic Based Routing Mechanism for Ad Hoc Networks

    Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2012 ( 2 ) 16 - 16  2012.08

    CiNii

  • Analysis of Relation between QoS and User's Moving Behaviour in Wireless Data Communication Services

    YAMORI Kyoko, YU Bing, YAMAGATA Shunsuke, TANAKA Yoshiaki

    Technical report of IEICE. CQ   112 ( 119 ) 11 - 16  2012.07

     View Summary

    By the rapid spread of smartphones, huge traffic data occurs in 3G networks. Traffic load is serious and becomes a big problem. A lot of researches have been done for the overload of the traffic. One of the approaches is the traffic control by using the user's bebaviour. If a user does not satisfy the network quality, he wants to move to the best access point to improve his utility. User guidance service navigates the best access point. Two incentive control methods are shown in this paper. The model of the user's moving behaviour is proposed. From the questionnaire, the relation between QoS and willingness to move is shown.

    CiNii

  • A Game Theoretic Framework for Bandwidth Allocation and Pricing in Federated Wireless Networks

    GU Bo, YAMORI Kyoko, XU Sugang, TANAKA Yoshiaki

      95 ( 4 ) 1109 - 1116  2012.04

    CiNii

  • Pricing for IPTV Based on Viewing Behaviour

    YAMORI Kyoko, TEZUKA Kazutaka, TANAKA Yoshiaki

    IEICE technical report. Information and communication management   111 ( 488 ) 95 - 100  2012.03

     View Summary

    IPTV services are becoming popular. However, the pricing methods for IPTV services have seldom been discussed. In our previous studies, we proposed the pricing methods for maximizing the social welfare and for maximizing the provider's profit in VOD-type IP broadcasts services. In this paper, the IPTV service models that defined by IPTV Form in Japan are shown. The viewing behaviours are modelled for each IPTV service model. The pricing methods for maximizing the user utility are discussed.

    CiNii

  • B-6-13 DDoS Attack Detection and Avoidance Method Based on Relay Priority for Ad Hoc Networks

    Wang Qi, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2012 ( 2 ) 13 - 13  2012.03

    CiNii

  • B-6-12 Autonomous Load Evaluation Method for Ad Hoc Networks

    Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2012 ( 2 ) 12 - 12  2012.03

    CiNii

  • B-11-1 Design Method of Resource Reservation Services for Corporate Users

    Okamoto Tsukasa, Miyake Kou, Yamori Kyoko, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2012 ( 2 ) 448 - 448  2012.03

    CiNii

  • BS-3-12 Mobile Agent Based Wormhole Attack Detection in MANET(BS-3. Management and Control Technologies for Innovative Networks)

    Yang Bo, Yamamoto Ryo, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2012 ( 2 ) "S - 23"-"S-24"  2012.03

    CiNii

  • Toward Distributed Translucent Wavelength Switched Optical Networks under GMPLS/PCE Architecture

    WANG Xin, CHAP Tithra, XU Sugang, TANAKA Yoshiaki

      95 ( 3 ) 740 - 751  2012.03

    CiNii

  • A Wormhole Attack Mitigation Strategy Based on Mobile Agent

    YANG Bo, YAMAMOTO Ryo, TANAKA Yoshiaki

    IEICE technical report   111 ( 468 ) 149 - 154  2012.03

     View Summary

    Mobile ad hoc network (MANET) is a self-organized, infrastructure less, multi-hop network, which is highly vulnerable to various attacks. Among various attacks, DoS (Denial of Service) attack that may lead to the collapse of the network performs as a disaster in the network. Wormhole attack, a particularly devastating DoS attack, is taken by two or more colluding nodes that create a virtual tunnel to do further malicious actions. The tunnel emulates shorter links in the network and can be employed to transport packets between end points of the tunnel. By using wormhole attack, malicious nodes can not only eavesdrop packet contents but also modify or drop legitimate packets. Wormhole attack is even more harmful than other kinds of DoS attacks for it can be launched even without getting any cryptographic keys or compromising the existing nodes. This paper proposes a mobile agent based strategy to overcome not only the closed wormhole attack but also the half open and open wormhole attack. Both wormhole using encapsulation and wormhole using out-of-band channel are taken into consideration and the proposed method shows a good performance in detecting the malicious nodes.

    CiNii

  • DDoS Attack Detection and Avoidance Mechanism Using Relay Priority for MANET

    WANG Qi, YAMAMOTO Ryo, TANAKA Yoshiaki

    IEICE technical report   111 ( 344 ) 149 - 152  2011.12

     View Summary

    DDoS attack is becoming a serious problem in mobile ad hoc networks. In the attack, widely distributed malicious nodes flood packets into the network, and exhaust resources of the network such as bandwidth, computing power, etc. As concerns this, some defence methods such as confirmation-based, traffic analysis-based methods are proposed to detect the malicious nodes. However, the conventional defence methods may cause delay increase and nodes' load increase. In order to solve these problems, this paper proposes a novel defence method against the DDoS attack which detects malicious nodes using relay priority based on time interval of route requests. The performance and the effectiveness of the proposed method are shown by computer simulation.

    CiNii

  • B-6-64 Load Balancing Method by Estimating Traffic Load in Ad Hoc Networks

    Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2011 ( 2 ) 64 - 64  2011.08

    CiNii

  • Routing Method by Estimating Traffic Load in Ad Hoc Networks

    YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   111 ( 144 ) 51 - 56  2011.07

     View Summary

    In ad hoc networks, terminals' mobility may cause dynamic changes of network topology and terminal density which may increase the traffic at a certain terminal or in a certain location. As concerns this problem, some routing-based load balancing methods which are based on traffic or transmission success rate have been proposed. However, these conventional methods consider only the load on the transmission route, and this may increase the load at neighbouring terminals of the route. In order to achieve efficient load balanced routing in ad hoc networks, this paper proposes a load balancing method based on an estimated traffic around each terminal. The proposed method monitors the neighbouring terminals' transmission and estimates a relative load based on it for better route selection. The performance and the efficiency of the proposed method are also clarified by computer simulation.

    CiNii

  • Neighbourhood-Traffic Adaptive Load Balancing Method in Ad Hoc Networks

    YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   111 ( 8 ) 19 - 24  2011.04

     View Summary

    In ad hoc networks, dynamic changes of the network topology caused by the terminals' mobility may increase the traffic load on a certain terminal or in a certain location. As concerns this problem, some traffic-based routing mechanisms to balance the load have been proposed. However, it is hard to adapt them to the environment where the traffic changes in a short period. Furthermore, these conventional methods do not consider the load on the neighbouring terminals of the transmission route. In order to achieve efficient load balancing in ad hoc networks, this paper proposes a load balancing method based on neighbouring terminals' traffic. The proposed method controls the transmission rate depending on the neighbouring terminals' load and the transmission route. The performance and the efficiency of the proposed method is also clarified by computer simulation.

    CiNii

  • Content Delivery Scheduling Based on Maximum Tolerable Waiting Time for Portable Devices

    TAKADA Yu, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   110 ( 455 ) 25 - 28  2011.02

     View Summary

    Tolerable waiting time for content download depends on content size and situations. It is because of the difference of user's utility. If EDF (Earliest Deadline First) is used instead of FIFO, users' utility will increase. However, it needs much processing. In order to avoid it, QEDF (Quasi Earliest Deadline First) is considered in this paper. It does not need much processing. Assuming that the portable devices are used for content download, users' utility of QEDF is almost the same as that of EDF.

    CiNii

  • B-6-85 Transmission Rate Control Based on Traffic Load in Ad Hoc Networks

    Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2011 ( 2 ) 85 - 85  2011.02

    CiNii

  • Wormhole Attack Detection and Avoidance Method Using Observation Report from Neighbour Nodes

    WANG Qi, YAMAMOTO Ryo, TANAKA Yoshiaki

    IEICE technical report   110 ( 448 ) 455 - 460  2011.02

     View Summary

    Wormhole attack is becoming a serious problem in ad hoc networks. In the attack, a pair of malicious nodes establishes a tunnel between two end points, and collects the transmission route of the neighbouring nodes. Therefore, the data on the route might be wiretapped, falsified, and annulled by the malicious nodes. To avoid the attack, some defence method is necessary to detect the malicious nodes. However, the conventional defence methods may cause delay increase, and their scalability is limited. In order to solve these problems, this paper proposes a novel defence method against the wormhole attack which detects neighbouring malicious nodes using observation report by normal nodes. The performance and the effectiveness of the proposed method are shown by computer simulation.

    CiNii

  • Load Balancing Method Based on Neighbouring Terminals' Activity in Ad Hoc Networks

    YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   110 ( 339 ) 79 - 84  2010.12

     View Summary

    In ad hoc networks, it is hard to realize the centralized management of network state, and dynamic changes of the network topology caused by the terminals' mobility may increase the traffic load on a certain terminal or in a certain location. As concerns this problem, some routing mechanisms to balance the network load have been proposed. However, it is hard to adapt them to the environment where the traffic changes in a short period. Furthermore, these conventional methods only consider the load on the transmission routes. For achieving efficient load balancing in ad hoc networks, this paper proposes a load balancing method based on the activity of neighbouring terminals. The proposed method controls the transmission rate depending on the states of the neighbouring terminals and of the transmission route. The performance and efficiency of the proposed method is also clarified by computer simulation.

    CiNii

  • QoS-based and QoE-based Evaluation of OSPF Routing

    SUN Lihua, YAMORI Kyoko, ZHANIKEEV Marat, TANAKA Yoshiaki

    Technical report of IEICE. CQ   110 ( 198 ) 43 - 48  2010.09

     View Summary

    The quality of network is actually ultimately evaluated by users who use the service supplied by it. Although the conception of QoE (Quality of Experience) has been proposed and considered important recently, it has not commonly used to evaluate the quality of network yet. QoE usually has a nonlinear relationship with QoS (Quality of Service) which is usually a set of objective indices for evaluation. In this paper, how the optimization of OSPF routing reflects in both QoS and QoE is discussed by using the example of content download, and it is shown that there is an improvement of 60% in QoS and 10% in QoE through the optimization of OSPF routing. From the viewpoint of users' utility, the complete optimization of OSPF routing is not necessary, and the quasi-optimization is enough.

    CiNii

  • B-6-73 Load Balancing Method with Transmission Rate Control on Ad Hoc Networks

    Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2010 ( 2 ) 73 - 73  2010.08

    CiNii

  • B-14-10 Point of Agreement between Users' Benefit and Provider's Revenue in Usage-based Rate VOD Type IPTV Services

    Tezuka Kazutaka, Yamori Kyoko, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2010 ( 2 ) 366 - 366  2010.08

    CiNii

  • Cross Layer Control of Transmission Rate for Ad Hoc Networks

    YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   110 ( 126 ) 41 - 46  2010.07

     View Summary

    In ad hoc networks, it is hard to unify the management of network state due to an autonomously decentralized manner for network construction mechanism by mobile terminals. Topological changes may increase the traffic load on a certain terminal or location, and thus that will degrade the fairness of the whole network. As concerns this problem, the methods that modify routing mechanisms to balance the traffic load have been proposed. However, they need extra control sequence for the route modification and hardly adapt to the environment where the traffic changes in a short period. In this paper, to balance the load efficiently in ad hoc networks, cross-layer transmission rate control method is proposed. The proposed method controls the transmission rate, by limiting the maximum, depending on the state of the transmission route, and thus avoids the concentrated traffic and collisions. The performance and efficiency of the proposed method is also clarified by computer simulation.

    CiNii

  • Conversion of QoS to QoE for Maximizing Users' Utility

    YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   110 ( 33 ) 59 - 64  2010.05

     View Summary

    The network service employs multiple transmission media to convey information to the users. The quality of experience (QoE) should be considered among different media that transfer service content. QoE of telecommunication services has been previously discussed by QoS mapping. While QoS is the ability to guarantee a certain level of performance to a data flow, QoE presents the degree of satisfaction of the user and can be often expressed by subjective evaluation such as the mean opinion score (MOS). From the viewpoint of network provider, it is possible to predict the user's bihaviour by QoE function. In this paper, we introduce the previous research of QoE measuring, show the priority control of contents delivery for the maximizing users' utility.

    CiNii

  • Conversion of QoS to QoE for Maximizing Users' Utility

    YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   110 ( 34 ) 59 - 64  2010.05

     View Summary

    The network service employs multiple transmission media to convey information to the users. The quality of experience (QoE) should be considered among different media that transfer service content. QoE of telecommunication services has been previously discussed by QoS mapping. While QoS is the ability to guarantee a certain level of performance to a data flow, QoE presents the degree of satisfaction of the user and can be often expressed by subjective evaluation such as the mean opinion score (MOS). From the viewpoint of network provider, it is possible to predict the user's bihaviour by QoE function. In this paper, we introduce the previous research of QoE measuring, show the priority control of contents delivery for the maximizing users' utility.

    CiNii

  • Optimum Pricing to Maximize Provider's Profit in VOD Type IPTV Services with Usage-based Rate

    TEZUKA Kazutaka, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   109 ( 463 ) 53 - 56  2010.03

     View Summary

    In VOD type IPTV services, if the number of users' requests is more than the server capacity (maximum number of streams), some users' requests will be blocked. If the viewing price is usage-based, the provider will lose the revenue as the blocking probability increases. The server capacity should be increased in order to decrease the blocking probability. However, if the cost to increase the server capacity is high, the viewing price will be high. Then, the number of users' requests will decrease, and the provider's revenue will decrease. Therefore, it is important to set the viewing price by considering both the server cost and the blocking probability. This paper analyzes this relation and shows the viewing price and the server capacity that maximize the provider's profit.

    CiNii

  • B-14-7 Optimum Pricing for VOD Type IPTV Services with Usage-based Rate

    Tezuka Kazutaka, Yamori Kyoko, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2010 ( 2 ) 539 - 539  2010.03

    CiNii

  • B-6-138 Load Balancing Method with Cross Layer Design on Ad Hoc Networks

    Yamamoto Ryo, Miyoshi Takumi, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2010 ( 2 ) 138 - 138  2010.03

    CiNii

  • Characteristic Analysis of RTT-based Window Control Method

    YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   109 ( 326 ) 79 - 84  2009.12

     View Summary

    In ad hoc networks, since each terminal transmits data using radio devices, segment loss frequently occurs owing to radio interference or node mobility. TCP Reno uses a segment loss to detect congestion and tries to avoid it by shrinking the congestion window size. In ad hoc networks, however, segment losses are caused by not only congestion but also interference and node mobility. Thus, unnecessary congestion avoidance decreases communication efficiency. As concern this, to improve communication efficiency, authors proposed RTT-based window control method. However, since a parameters for window control is a constant in the method, there is a possibility that the threshold would not be appropriate value for some cases. In this paper, the effect of the parameters on communication efficiency is analyzed to set the optimal parameters. This will yield better performance.

    CiNii

  • B-14-10 Provider's Profit of VOD Type IPTV Services with Usage-based Rate

    Tezuka Kazutaka, Yamori Kyoko, Tanaka Yoshiaki

    Proceedings of the Society Conference of IEICE   2009 ( 2 ) 341 - 341  2009.09

    CiNii

  • B-6-5 Window Control Method Considering Fairness for Ad Hoc Networks

    YAMAMOTO Ryo, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2009 ( 2 ) 5 - 5  2009.09

    CiNii

  • Pricing of Flat-Rate VOD Type IPTV Service Based on Users' Benefit and Provider's Profit

    TEZUKA Kazutaka, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   108 ( 481 ) 87 - 92  2009.03

     View Summary

    IPTV services are becoming popular in the Internet. However, the optimal pricing method for IPTV has seldom been discussed. In VOD type IPTV services, the maximum number of streams depends on the server capacity. If the number of users' requests is more than the maximum number of streams, users' requests will be blocked. If the number of subscribers increases, the provider's revenue will increase. However, the blocking probability will also increase, and the user's utility will decrease. In order to maintain QoS, the provider must have more server capacity. This means that the server cost will increase. This paper shows the relation between the viewing price and the users' benefit, and that between the viewing price and the provider's profit for various server capacity. The optimum viewing price for the users' benefit and that for the provider's profit are different. To solve this problem, Nash bargaining solution is calculated by using game theory.

    CiNii

  • B-14-1 Relation between Server Cost and Viewing Price in Flat-Rate VOD Type IPTV Services

    TEZUKA Kazutaka, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2009 ( 2 ) 532 - 532  2009.03

    CiNii

  • Multicast Routing with Multiple Servers for Content Delivery Services

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    The IEICE transactions on communications B   92 ( 3 ) 515 - 526  2009.03

    CiNii

  • 無線アドホック網における信頼性通信方式

    三好 匠, 田中 良明

    特別教育・研究報告集     182 - 185  2009

    CiNii

  • Relation between Viewing Purpose and QoE in Content Download by Portable Devices

    TAKADA Yu, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   108 ( 137 ) 5 - 8  2008.07

     View Summary

    Recently, the image content such as movie, news, etc. is distributed to portable telecommunication devices. In this case, the relation between image quality and utility, and that between image quality and waiting time allowance will depend on the viewing purpose. In this paper, such relation is analyzed by using subjective evaluation and questionnaire survey.

    CiNii

  • Block Transfer System for Multi-Server Multicast Routing

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   108 ( 134 ) 55 - 60  2008.07

     View Summary

    In a content download service, it is effective to perform both a high-speed delivery and a low-speed delivery simultaneously by multiple servers. However, in this distribution method, it is necessary to set a long delivery interval for all servers. In the previous research, it is shown that the optimal delivery interval depends on the delivery speed, and it is ideal to set a short delivery interval to a high-speed server. For this reason, the problem of this delivery method is that useless standby time occurs on the high-speed server. In this paper, a delivery method to solve this problem is suggested. Servers divide content into content blocks, and give a block number to each content block. Each delivery servers alternate the content block order between ascending order and descending order. The results prove that the proposed method can increase users' utility compared with conventional methods.

    CiNii

  • 定額制VOD形IP放送における事業者収入とユーザ便益の妥結点

    手塚 一貴, 別所 浩資, 矢守 恭子, 田中 良明

    情報処理学会研究報告. IOT, [インターネットと運用技術] = IPSJ SIG Technical Reports   1   127 - 132  2008.05

    CiNii

  • Point of Agreement between Provider's Revenue and User's Benefit in Flat-Rate VOD Type IP Broadcast Services

    TEZUKA Kazutaka, BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   108 ( 24 ) 127 - 132  2008.05

     View Summary

    IP broadcast services are becoming popular in the Internet. However, the optimal pricing method for IP broadcasting is not discussed. This paper analyses flat-rate price of VOD type IP broadcast services, and examines the point of agreement between provider's revenue and user's benefit by using the negotiation problem of game theory. This analysis pays attention to the request blocking rate as the quality of service. The negotiation model between user and provider is defined, and the points of agreement for various request blocking rates are obtained by the agent simulator. As a result, the optimal prices are shown.

    CiNii

  • Point of Agreement between Provider's Revenue and User's Benefit in Flat-Rate VOD Type IP Broadcast Services

    TEZUKA Kazutaka, BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    IPSJ SIG Technical Reports   2008 ( 37 ) 127 - 132  2008.05

     View Summary

    IP broadcast services are becoming popular in the Internet. However, the optimal pricing method for IP broadcasting is not discussed. This paper analyses flat-rate price of VOD type IP broadcast services, and examines the point of agreement between provider's revenue and user's benefit by using the negotiation problem of game theory. This analysis pays attention to the request blocking rate as the quality of service. The negotiation model between user and provider is defined, and the points of agreement for various request blocking rates are obtained by the agent simulator. As a result, the optimal prices are shown.

    CiNii

  • Point of Agreement between Provider's Revenue and User's Benefit in Flat-Rate VOD Type IP Broadcast Services

    TEZUKA Kazutaka, BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   108 ( 24 ) 127 - 132  2008.05

     View Summary

    IP broadcast services are becoming popular in the Internet. However, the optimal pricing method for IP broadcasting is not discussed. This paper analyses flat-rate price of VOD type IP broadcast services, and examines the point of agreement between provider's revenue and user's benefit by using the negotiation problem of game theory. This analysis pays attention to the request blocking rate as the quality of service. The negotiation model between user and provider is defined, and the points of agreement for various request blocking rates are obtained by the agent simulator. As a result, the optimal prices are shown.

    CiNii

  • BS-3-13 Stackelberg Game for Interconnection between Large ISPs and Small ISPs(BS-3. Network Management Technologies for Next Generation Network)

    Wang Jun, Yamori Kyoko, Tanaka Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) "S - 34"-"S-35"  2008.03

    CiNii

  • B-6-41 Fairness of Wavelength Assignment in Optical Packet Switching Networks

    HARA Shingo, ISHIKAWA Eiji, XU Sugang, TANAKA Yoshiaki, YANAGISAWA Masao

    Proceedings of the IEICE General Conference   2008 ( 2 ) 41 - 41  2008.03

    CiNii

  • B-6-42 Optimal FDL Slot Length in Optical Packet Switching with Fibre Delay Lines

    ISHIKAWA Eiji, XU Sugang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) 42 - 42  2008.03

    CiNii

  • B-6-52 Access Control Using Auction Protocol in Ad Hoc Networks

    KARASAWA Naoyuki, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) 52 - 52  2008.03

    CiNii

  • B-6-72 Relation between Tree Forming Threshold and Utility in Multicast Routing with Multiple Servers

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) 72 - 72  2008.03

    CiNii

  • B-11-5 Relation between Viewing Purpose and Waiting Time of Content Download on Portable Devices

    TAKADA Yu, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) 397 - 397  2008.03

    CiNii

  • B-11-6 Performance of Ad Hoc Network Routing Based on Willingness to Receive Reward for Relay

    DONKAI Kenji, KARASAWA Naoyuki, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) 398 - 398  2008.03

    CiNii

  • B-14-1 Point of Agreement between Provider's Revenue and User's Benefit in IP Broadcast Services

    TEZUKA Kazutaka, BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) 474 - 474  2008.03

    CiNii

  • B-14-2 Pricing Method for VOD Type IP Broadcast Services Based on Server Capacity

    BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) 475 - 475  2008.03

    CiNii

  • B-14-8 An Algorithm for Node Discovery in Large-Scale Networks

    OKADA Yoshiro, ZHANIKEEV Marat, TANAKA Yoshiaki, YANAGISAWA Masao

    Proceedings of the IEICE General Conference   2008 ( 2 ) 481 - 481  2008.03

    CiNii

  • B-19-15 Evaluation of Thread Tool for Model with Federated Personal Servers

    NOTOMI Ryoji, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2008 ( 2 ) 519 - 519  2008.03

    CiNii

  • Performance Comparison between Fixed Length Packets and Variable Length Packets in Optical Packet Switching

    ISHIKAWA Eiji, XU Sugang, TANAKA Yoshiaki

    IEICE technical report   107 ( 524 ) 83 - 88  2008.02

     View Summary

    Packet contention occurs at a switching node in optical packet switching networks. By using fibre delay line (FDL) buffers, packet contention can be avoided. In case of synchronous networks, if the length of FDLs is properly selected according to the fixed length of packets, no waste of FDL use will occur. FDL will be used efficiently to avoid packet contention. However, if the current Internet packets which have variable lengths are fragmented and embedded into the fixed length optical packet of synchronous networks, it is considered inefficient due to the waste within the last optical packet where the last fragmented payload is always shorter than the fixed optical packet size. This will degrade the performance. In this paper, through simulations, we quantitatively evaluate the performance between fixed length packets and variable length packets in optical packet switching. Our motivation in this paper is to observe the possible clues to improve the FDLs efficiency and system performance in both asynchronous and synchronous optical packet switching networks.

    CiNii

  • Ad Hoc Network Routing Scheme Based on Willingness to Receive Reward for Relay

    DONKAI Kenji, KARASAWA Naoyuki, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   107 ( 524 ) 423 - 428  2008.02

     View Summary

    In ad hoc networks, there is a concept of reward given to relay nodes to compensate for their loss of power. When implemented as a service, each node could be allowed to express its own willingness to receive reward, which could be used to discriminate nodes participating in an ad hoc network. If the total willingness to receive reward of relay nodes along the route is less than the charge, the connection will be successful. This paper proposes two routing algorithms to select the route by minimizing the total willingness to receive reward. One algorithm minimizes only the total willingness to receive reward, and another algorithm minimizes both the total willingness to receive reward and the hop count. The relation between the charge and the connection success probability, and that between the charge and the benefit of relay nodes are shown.

    CiNii

  • Relation between Server Capacity and Provider Revenue in VOD Type IP Broadcast Services

    BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   107 ( 483 ) 17 - 22  2008.02

     View Summary

    Recently, there is a remarkable growth in IP broadcast services, and various services have been provided. There are flat-rate and time-based pricing schemes, and it is an issue to obtain the optimal price depending on the pricing scheme and the services provided. An optimal price should exist for IP broadcast services based on several viewpoints such as maximizing the revenue of IP broadcast service provider, maximizing network efficiency, maximizing user's utility, etc. This paper assumes flat-rate pricing scheme for VOD type IP broadcast services, and shows the optimal price from the viewpoint of maximizing the revenue of IP broadcast service provider. Using the user model derived from questionnaire survey, the relation between revenue and price for each server capacity is obtained by simulation. The optimal price for each server capacity is shown. The dependence of the revenue on the server capacity is also shown.

    CiNii

  • Thread Tool for Communication Service with Federated Personal Servers

    NOTOMI Ryoji, TANAKA Yoshiaki

    IEICE technical report   107 ( 483 ) 87 - 92  2008.02

     View Summary

    Communication services using federated personal servers have been proposed. These services have merits to manage users who access personal servers and their own contents by using personal servers. This paper proposes a thread tool which behaves like bulletin boards as a communication tool for communication services with federated personal servers. Then, the scheme to implement the function of thread tool using the function sets of group management is described.

    CiNii

  • Communication Quality Control and Its Evaluation from the Viewpoint of User's Utility

    YAMORI Kyoko, TANAKA Yoshiaki

    The Journal of the Institute of Electronics, Information and Communication Engineers   91 ( 2 ) 98 - 101  2008.02

    CiNii

  • B-6-13 Effect of Multicast Routing with Multiple Content Servers

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2007 ( 2 ) 13 - 13  2007.08

    CiNii

  • B-6-27 Relation between Slot Length and Buffer Length of Optical Packet Switching Using FDL Buffers

    ISHIKAWA Eiji, XU Sugang, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2007 ( 2 ) 27 - 27  2007.08

    CiNii

  • B-14-9 Revenue of Flat-Rate VOD Type IP Broadcasting Based on User's Behaviour

    BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2007 ( 2 ) 338 - 338  2007.08

    CiNii

  • B-19-15 Group Member Management Synchronization System for Communication Service with Federated Personal Servers

    NOTOMI Ryoji, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2007 ( 2 ) 370 - 370  2007.08

    CiNii

  • Users' Behaviour and Pricing Method for Maximizing Provider's Revenue in VOD Type IP Broadcast Service

    BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   107 ( 146 ) 55 - 60  2007.07

     View Summary

    Recently, there is a remarkable growth in IP broadcast services. There are flat-rate and time-based pricing schemes, and it is a issue to obtain the optimal price depending on the pricing scheme and services provided. An optimal price should exist for IP broadcast services based on several viewpoints such as maximizing the revenue of IP broadcast service provider, maximizing network efficiency, maximizing user's utility, etc. The purpose of this paper is to clarify the optimal price based on maximizing the revenue of IP broadcast service provider. Two kinds of pricing schemes, that is flat-rate pricing and time-based pricing, and three kinds of price elasticity are considered for VOD type IP broadcast service. The relation between revenue and price for each scheme and each price elasticity are shown. From the simulation results, the optimal price that maximizes the revenue of IP broadcast service provider is obtained.

    CiNii

  • Characteristic Analysis of Willingness to Receive Reward for Relay in Ad Hoc Networks

    DONKAI Kenji, KARASAWA Naoyuki, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   107 ( 134 ) 49 - 54  2007.07

     View Summary

    In ad hoc network, it is necessary to increase the incentive for relaying. One idea is to give a reward for relaying, and it has been studied. The authors have discussed the relation between the willingness to receive reward and the residual battery power. In this paper, the curves obtained by the questionnaire survey are classified into several patterns. Most patterns have nonlinear shapes. For most users, the increase rate of willingness to receive reward increases according to the increase of battery power consumption (opposite of residual battery power). And, the willingness to receive reward depends on the user's sensitivity to the battery power consumption.

    CiNii

  • An Efficient Wavelength Assignment for Optical Packet Switching with Fibre Delay Line Buffers

    ISHIKAWA Eiji, XU Sugang, TANAKA Yoshiaki

    IEICE technical report   107 ( 88 ) 43 - 48  2007.06

     View Summary

    Packet contention occurs at a switching node ill optical packet switching networks. By using fibre delay line (FDL) buffers, packet contention can be avoided. However, the cost of a switching node with FDLs is high, and FDL introduces extra optical power loss. This paper proposes an effective wavelength assignment scheme with FDL buffers at a switching node. By suppressing the usage of FDLs, the required number of FDLs decreases, and the extra optical power loss decreases. It is shown that the proposed scheme is effective by computer simulations.

    CiNii

  • Multi-Server Multicast Routing Based on Users' Utility

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   107 ( 6 ) 13 - 18  2007.04

     View Summary

    From the viewpoint of users' utility of content download service, it will be more effective to construct the multicast tree on link bandwidth than to construct the tree based on link cost etc. This paper proposes a routing method to construct a multicast tree based on link bandwidth. And, this paper proposes a routing method that a high-speed delivery and a low-speed delivery are done simultaneously by multiple servers. It is shown that the users' utility increases by constructing a multicast tree based on link bandwidth, compared with MST algorithm based on link cost etc. Moreover, it is shown that multi-server routing is effective from the viewpoint of users' utility.

    CiNii

  • B-6-12 Pattern Analysis of Willingness to Receive Reword for Relay in Ad Hoc Networks

    DONKAI Kenji, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 12 - 12  2007.03

    CiNii

  • B-6-13 Access Control using Willingness to Receive Reward for Relay in Ad Hoc Networks

    KARASAWA Naoyuki, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 13 - 13  2007.03

    CiNii

  • B-6-21 Proximity of Mutual Connections of Pure P2P Traffic

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 21 - 21  2007.03

    CiNii

  • B-6-34 Effect of Multicast Routing with Link Selection Based on Link Bandwidth

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 34 - 34  2007.03

    CiNii

  • B-6-73 Effect of Fibre Delay Line Buffer for Packet Wavelength Assignment in Optical Packet Switching

    ISHIKAWA Eiji, XU Sugang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 73 - 73  2007.03

    CiNii

  • B-7-1 Many-to-Many Multicast Routing Algorithm Using Multiple Static Trees

    KARASAWA Hajime, TERADA Shinsuke, MIYOSHI Takumi, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 91 - 91  2007.03

    CiNii

  • B-11-19 Analysis of Users' Evaluation of Watching Image by Portable Terminals during Transfer

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 449 - 449  2007.03

    CiNii

  • B-14-1 Price and Provider's Revenue of Flat-Rate VOD Type IP Broadcasting

    BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 539 - 539  2007.03

    CiNii

  • B-14-2 Derivation of Price Elasticity in Content Distribution Services

    WADA Tetsuya, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 540 - 540  2007.03

    CiNii

  • B-14-3 Viewing Reward for Banner Advertisement in Ad Hoc Networks

    TAMAKI Yasuhiro, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 541 - 541  2007.03

    CiNii

  • B-14-8 Attack Host Detection Method Using IP Aggregation

    ITO Ken, ZHANIKEEV Marat, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 546 - 546  2007.03

    CiNii

  • B-19-18 Group Management in Communication System with Federated Personal Servers

    NOTOMI Ryoji, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2007 ( 2 ) 580 - 580  2007.03

    CiNii

  • Routing Algorithm Using Multiple Static Trees for Many-to-Many Multicast

    KARASAWA Hajime, TERADA Shinsuke, MIYOSHI Takumi, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 578 ) 149 - 154  2007.03

     View Summary

    Many-to-many communication such as teleconferencing or network game has to send and to receive large data on real time. Many-to-many multicasting is well suited for these communications since it makes efficient use of the network resources. In existing many-to-many multicast routing, mainly, there are two types of methods to construct multicast trees. One constructs different one-to-many multicast tree for every source. Since it constructs shortest-path trees for every source, the sources can send data with the lowest delay, however, the transmitting data increase. The other method constructs only one shared tree connected with all members. Though the delay becomes higher in this method, the transmitting data decrease. In this paper, we propose a routing algorithm using multiple static trees which can make low delay and low transmitting data many-to-many multicasting. As a result of our evaluation, by using a few static trees in the proposed algorithm, the delay performance becomes almost equal to hat of the method using shortest-path trees for every source. The proposed method can reduce the transmitting data compared with the method using one shared tree.

    CiNii

  • Communication Services using Federated Personal Servers with Group Management

    NOTOMI Ryoji, TANAKA Yoshiaki

    IEICE technical report   106 ( 577 ) 85 - 88  2007.03

     View Summary

    Recently, communication services using federated personal servers are being proposed. These services have merits to manage users who access to personal servers and to own contents by using personal servers. In this paper, communication services using federated personal servers are analyzed, and the function sets of group management which are necessary to provide the services are proposed. Also, the scheme to implement the function of group management personal servers is described.

    CiNii

  • Detection of Anomalous Communication Patterns Using IP Aggregation

    ITO Ken, ZHANIKEEV Marat, TANAKA Yoshiaki

    IEICE technical report   106 ( 577 ) 387 - 390  2007.03

     View Summary

    New network attacks are found in the Internet everyday. Hence, the necessity of attack detection at an early stage is also increasing. In this paper, a new network attack detection method using IP aggregation is proposed. This method uses the difference between communication patterns in normal state and that under a network attack. We analyze flow properties of each host using IP aggregation, which helps to detect anomalous communication patterns. By using this method, we can discriminate anomalous communication hosts from other hosts.

    CiNii

  • Method of P2P Traffic Discrimination Based on Interval Time Between Forward and Backward Connections

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    IEICE technical report   106 ( 577 ) 415 - 420  2007.03

     View Summary

    In recent years, the amount of network traffic is rapidly increasing. And, the personal information is flowing out by virus, which makes some P2P traffic control necessary in order to maintain the efficient and stable network. The P2P traffic discrimination technique based on decryption of payload part has already been available. It has some problems, such as processing load and protection of personal information. The authors have proposed a discrimination technique of Pure P2P file sharing traffic using only header information, without decoding payload part of monitored packets. However, we still have an issue of Pure P2P discrimination between Pure P2P and other P2P. In this paper, we pay our attention to the mutual connections, and characterize the Pure P2P file sharing traffic using interval time between forward and backward connections. Moreover, we propose a new discrimination technique of Pure P2P file sharing traffic by making use of approachability of mutual connections by short time calculation. In addition, this paper verifies the effectiveness of the proposed technique.

    CiNii

  • Analyzing Users' Evaluation of Portable Terminal Image Quality into Influence Factors

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 495 ) 61 - 66  2007.01

     View Summary

    Recently, watching image contents becomes easier using portable terminals. However, users' evaluation for watching image during movement has not been studied in detail. In this paper, we assume that the extra factors influence users' evaluation when users are watching image contents using portable terminals during movement. Then, the assumption is proved to be true by users' subjective evaluation experiment and multivariate analysis. As a result, the extra factors that influence user's evaluation are shown.

    CiNii

  • Analyzing Users' Evaluation of Portable Terminal Image Quality into Influence Factors

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 495 ) 61 - 66  2007.01

     View Summary

    Recently, watching image contents becomes easier using portable terminals. However, users' evaluation for watching image during movement has not been studied in detail. In this paper, we assume that the extra factors influence users' evaluation when users are watching image contents using portable terminals during movement. Then, the assumption is proved to be true by users' subjective evaluation experiment and multivariate analysis. As a result, the extra factors that influence user's evaluation are shown.

    CiNii

  • IPパケット統合転送方式の研究

    三好 匠, 田中 良明

    特別教育・研究報告集   2007   217 - 220  2007

    CiNii

  • Practical Models of User Behaviour Based on Utility and Price

    YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 420 ) 43 - 48  2006.12

     View Summary

    Recently, differentiated services are going to be used in telecommunication networks. The price of high quality class will be high, and the price of low quality class will be low. The traffic of each class depends on the price. Therefore, in order to analyze or to design the network, it is necessary to use both teletraffic theory and economics. In this paper, we introduce the pricing method for maximizing users' utility and provider's revenue. The prices are optimized to maximize the revenue in the guaranteed bandwidth service. Disaggregate behavioural model is applied to the user's behaviour, and the relation between the user's utility and the price is obtained by simulation.

    CiNii

  • A Method of Pure P2P Traffic Discrimination Based on Mutual Connections

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    IEICE technical report   106 ( 355 ) 61 - 66  2006.11

     View Summary

    In recent years, the amount of network traffic is rapidly increasing, which makes some traffic control necessary in order to maintain the efficient and stable network. Thus, the discrimination technique of Pure P2P traffic which occupies a large portion of present network traffic is important. Pure P2P file sharing traffic is dominant in the P2P traffic, and has become a hotbed of viruses and copyright problems. The authors have proposed a discrimination technique of Pure P2P file sharing traffic using only header information, without decoding payload part of monitored packets. In this paper, we propose a new discrimination technique of Pure P2P file sharing traffic by making use of new concepts of connection direction and Mutual Connections, for the purpose of further improvement of discrimination technique the authors have proposed. In addition, this paper verifies the effectiveness of the proposed technique by comparing it with the discrimination technique based on payload decipherment.

    CiNii

  • Fitting Curves of Willingness to Receive Reward for Relay in Ad Hoc Networks

    KARASAWA Naoyuki, DONKAI Kenji, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 310 ) 99 - 104  2006.10

     View Summary

    In ad hoc networks, relay nodes use their limited resources such as battery power, CPU power, buffer, etc. for other nodes' communications. This fact discourages a user to join the ad hoc network and to become a relay node. However, if a user can receive a reward for relay, he will be encouraged to join. This research focuses on battery power consumption, residual battery power, and the time while AC power supply is not available. And, the willingness to receive reward for relay in ad hoc networks was investigated by questionnaire survey. In this paper, the relation between such factors and the willingness to receive reward for relay is analysed quantitatively. In particular, some models of willingness to receive reward for relay are estimated.

    CiNii

  • Network Attack Detection Method Using IP Aggregation

    ITO Ken, ZHANIKEEV Marat, TANAKA Yoshiaki

    IEICE technical report   106 ( 310 ) 125 - 128  2006.10

     View Summary

    Recently, various threats appear in network. In this paper, a network attack detection method using IP aggregation is proposed. Each network attack has a peculiar communication pattern. Therefore, there is a difference between network attack communication pattern and normal communication pattern. We analyse communication patterns at every host collected by IP aggregation, and then detect network attacks. By using this method, we can discriminate worm-infected hosts from other hosts.

    CiNii

  • Characteristic Analysis of Single-Rooted Multicast Tree for Many-to-Many Communications Using Multiple Linear Regression Analysis

    KARASAWA Hajime, TERADA Shinsuke, MIYOSHI Takumi, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 280 ) 31 - 36  2006.10

     View Summary

    In core based multicast routing, the location of the core affects the efficiency of the multicast tree. This paper analyzes core based single-rooted many-to-many multicast tree by using multiple linear regression analysis, and examines how the best location of the core and its characteristics change when the number of multicast members changes. As a result, it is shown that there are four main indices which affect the delay performance of the tree. They are the maximum hop counts to any node from the core, the average of hop counts to all nodes from the core, the variance of hop counts to all nodes from the core, and the variance of the value of (node degree)/(hop counts from the core) of all nodes except the core. The result also shows that the index which mostly affects the performance of the tree depends on the number of multicast members.

    CiNii

  • ユーザ志向に基づく移動端末での映像視聴の目的と場所の関係

    須田 洋平, 矢守 恭子, 田中 良明

    映像情報メディア学会技術報告   30 ( 45 ) 47 - 50  2006.09

    CiNii

  • ユーザ志向に基づく移動端末での映像視聴の目的と場所の関係

    須田 洋平, 矢守 恭子, 田中 良明

    電気学会研究会資料. CMN, 通信研究会   2006 ( 24 ) 47 - 50  2006.09

    CiNii

  • BS-15-2 A Two Stage Heuristic Topology Design Approach for WDM Grid Computing Networks(BS-15.Network Planning, Control, and Management,ENGLISH SESSION)

    LEE Galy, XU Sugang, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2006 ( 2 ) "SE - 3"-"SE-4"  2006.09

    CiNii

  • Topology Design Strategy for WDM Grid Computing Networks

    LEE Galy, XU Sugang, TANAKA Yoshiaki

    IEICE technical report   106 ( 237 ) 1 - 6  2006.09

     View Summary

    Requirement for powerful ultra high-performance computer system pushes the research and development of technologies for large-scale distributed grid systems. Besides the computer systems, networks play an important role, as well. With an efficient underlying network in terms of bandwidth and delay, the performance of the whole system will be improved significantly. In the previous researches, for distributed parallel computations, for example, using Message-Passing Interface (MPI), normally the underlying network is given, then process mapping problem is resolved. In this paper, we propose an approach to design an optimized underlying lightpath network combined with a processes/processors mapping to support the large-scale parallel computing applications.

    CiNii

  • Relation between Purpose and Place in Users' Preference for Watching Mobile Terminal

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 239 ) 47 - 50  2006.09

     View Summary

    Recently, we can watch image contents such as news, movies, etc. anywhere by the ubiquitous telecommunication technology. The user's satisfaction to watch image contents has been evaluated by image quality and sound quality. However, in case of mobile terminal, the user's satisfaction will depend on the purpose and the place to watch the contents. This paper studies the users' preference to watch image contents by mobile terminals. The relation between the purpose and the place is analyzed by factor analysis. It is shown that the users' preference has 5 factors.

    CiNii

  • トラヒック特徴量解析とアプリケーション弁別(VPN, NAT,ネットワークセキュリティ,DDoS, P2P及び一般)

    中村文隆, 松田崇, 若原恭, 田中良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   106 ( 236 ) 57 - 62  2006.09

     View Summary

    TCP/IP通信において、パケットの第4層以下の情報を統計的に処理することによって得られる特徴量から、第5層以上の情報により定義されるパケット分類を推定する弁別手法について、我々がこれまでに行ってきた提案とその評価について紹介する。また、分散的に構成され、かつ明確な弁別が困難とされるP2Pネットワークの例としてWinnyをとりあげ、閉鎖ネットワーク内でWinnyのみによるP2Pネットワークを構成してノイズのないデータを採取する試みを行ったのでそれについても紹介する。

    CiNii

  • Relation between Purpose and Place in Users' Preference for Watching Mobile Terminal

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 241 ) 47 - 50  2006.09

     View Summary

    Recently, we can watch image contents such as news, movies, etc. anywhere by the ubiquitous telecommunication technology. The user's satisfaction to watch image contents has been evaluated by image quality and sound quality. However, in case of mobile terminal, the user's satisfaction will depend on the purpose and the place to watch the contents. This paper studies the users' preference to watch image contents by mobile terminals. The relation between the purpose and the place is analyzed by factor analysis. It is shown that the users' preference has 5 factors.

    CiNii

  • ユーザ志向に基づく移動端末での映像視聴の目的と場所の関係(品質評価,オフィスにおけるマルチメディア通信,IP放送/映像サービスの品質及び一般)

    須田洋平, 矢守恭子, 田中良明

    電子情報通信学会技術研究報告. IE, 画像工学   106 ( 243 ) 47 - 50  2006.09

     View Summary

    携帯形の移動通信端末の発展により,どのような場所でも映像コンテンツの視聴が可能となりつつある.これまで,映像視聴に対するユーザの満足度は,画質や音質などの指標を用いて評価されてきたが,移動通信端末での視聴を考えた場合,ユーザの視聴目的や視聴場所によっては,映像品質のユーザ評価が異なると予想される.本稿では,携帯形の移動通信端末を用いた映像の視聴におけるユーザ志向について検討し,視聴目的と視聴場所の組合せとそれに応じたユーザ志向を因子分析により分析している.その結果,ユーザ志向には五つの因子があることを明らかにしている.

    CiNii

  • トラヒック特徴量解析とアプリケーション弁別(オーバーレイネットワーク,VPN,NAT,ネットワークセキュリティ,DDoS,P2P及び一般)

    中村文隆, 松田崇, 若原恭, 田中良明

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   106 ( 237 ) 67 - 72  2006.09

     View Summary

    TCP/IP通信において、パケットの第4層以下の情報を統計的に処理することによって得られる特徴量から、第5層以上の情報により定義されるパケット分類を推定する弁別手法について、我々がこれまでに行ってきた提案とその評価について紹介する。また、分散的に構成され、かつ明確な弁別が困難とされるP2Pネットワークの例としてWinnyをとりあげ、閉鎖ネットワーク内でWinnyのみによるP2Pネットワークを構成してノイズのないデータを採取する試みを行ったのでそれについても紹介する。

    CiNii

  • Traffic feature analysis and application discrimination

    NAKAMURA Fumitaka, MATSUDA Takashi, WAKAHARA Yasushi, TANAKA Yoshiaki

    IEICE technical report   106 ( 238 ) 25 - 30  2006.09

     View Summary

    In this paper, We introduce packet discrimination method and its evaluation which we have proposed and presented. The method enables to speculate TCP/IP packet class denned by information embeded in layer-5 or above with using information in layer-4 or below. We also present our experiment performed in a closed network, which includes pure Winny P2P network to get noiseless data generated by a representative P2P application in Japan.

    CiNii

  • B-6-1 A Method of P2P Traffic Discrimination Based on Server Ports

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2006 ( 2 ) 1 - 1  2006.09

    CiNii

  • B-6-5 Regression Analysis of Willingness to Receive Reward for Relay in Ad Hoc Networks

    KARASAWA Naoyuki, DONKAI Kenji, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2006 ( 2 ) 5 - 5  2006.09

    CiNii

  • B-6-6 アドホックネットワークにおける中継謝金受取意思額関数の推定(B-6.ネットワークシステム,一般講演)

    呑海賢次, 柄沢直之, 矢守恭子, 田中良明

    電子情報通信学会ソサイエティ大会講演論文集   2006 ( 2 )  2006.09

    CiNii

  • B-6-21 Survey of User's Utility against Call Blocking Probability in Content Download Services

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2006 ( 2 ) 21 - 21  2006.09

    CiNii

  • B-7-27 A Study on Core Selection of Many-to-Many Multicast Routing Trees Using Multiple Linear Regression Analysis

    KARASAWA Hajime, TERADA Shinsuke, MIYOSHI Takumi, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2006 ( 2 ) 87 - 87  2006.09

    CiNii

  • B-11-15 Factor Analysis of Place and Purpose in Video Viewing by Mobile Terminals

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2006 ( 2 ) 275 - 275  2006.09

    CiNii

  • B-14-3 Characteristics of Packet Arrival Interval of Blaster.C Worm

    ITO Ken, ZHANIKEEV Marat, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2006 ( 2 ) 348 - 348  2006.09

    CiNii

  • 秘密情報配布の方法

    岡本 学, 田中 良明

    電子情報通信学会論文誌. A, 基礎・境界   89 ( 8 ) 662 - 670  2006.08

    CiNii

  • Survey and Analysis of Willingness to Receive Reward for Relay in Ad Hoc Networks

    KARASAWA Naoyuki, DONKAI Kenji, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 167 ) 41 - 44  2006.07

     View Summary

    In ad hoc networks, the relay nodes use their limited resources such as battery power, CPU power, buffer, etc. for other nodes' communications. This fact discourages a user to join the ad hoc network and to become a relay node. However, if a user can receive a reward for relay, he will be encouraged to join. In this paper, willingness to receive reward for relay in ad hoc networks is investigated by questionnaire survey. In particular, this paper focuses on battery power consumption, residual battery power, and the time while AC power supply is not available. Then, the relation between such factors and willingness to receive reward to relay is analysed.

    CiNii

  • Relation between Call Blocking Probability and Willingness to Pay in Content Download Services

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 117 ) 5 - 8  2006.06

     View Summary

    In content download services, it is ideal to deliver contents to all users, whether the network is congested or not. However, in the real network services, there are a lot of situations where the servers or links are congested, and it is difficult to deliver contents to users immediately. On these situations, it is effective to reject users' requests to avoid extreme load. On the other hand, if the server rejects users' requests frequently, users' utility will decrease, and many users will leave the service. By questionnaire survey, we investigated willingness to pay of content download service which has a possibility to reject users' requests according to network congestion. This paper analyses the results of questionnaire survey, and shows the relation between call blocking probability and willingness to pay.

    CiNii

  • Pricing Methods for VOD Type IP Broadcast Services Based on Watching Style

    BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   106 ( 117 ) 9 - 12  2006.06

     View Summary

    Recently, IP broadcast services are becoming popular with the advance of broadband telecommunication networks. Pricing scheme is dependent on IP broadcast service providers, and most providers employ flat-rate pricing. However, time-based pricing will also be used commonly in the near future. This paper analyses time-based pricing of IP broadcast services. User behaviour in VOD type IP broadcast is divided into two viewing styles. From the simulation results, the optimal price that maximises the revenue of the IP broadcast service provider is shown.

    CiNii

  • Packet Wavelength Assignment Based on Traffic in Optical Packet Switching Network

    ISHIKAWA Eiji, XU Sugang, TANAKA Yoshiaki

    IEICE technical report   106 ( 14 ) 5 - 8  2006.04

     View Summary

    In optical packet switching networks, packet contention occurs at a switching node whenever two or more packets try to reach the same output port of the node at the same wavelength, consequently network performance decreases. Previous works on optical packet switching flourishingly adopted wavelength conversion, optical buffering, or deflection routing to avoid packet loss. However, systems cost and control complexity is high. This paper proposes an effective wavelength assignment scheme to decrease packet contention. It is shown that the proposed scheme is effective through computer simulations.

    CiNii

  • BS-8-2 A Tabu Search Method of Logical Topology Design for Wavelength Routed IP Networks(BS-8. Technology and Architecture for Ubiquitous Network Systems,ENGLISH SESSION)

    LEE Galy, XU Sugang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) "SE - 3"-"SE-4"  2006.03

    CiNii

  • B-6-1 Packet Control Method of Hierarchical Mobile IPv6 Multicast for Multi-Layered MAP

    KATO Yasuaki, YUAN Bin, ATSUMI Akiyoshi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 1 - 1  2006.03

    CiNii

  • B-6-15 Nearly Optimal Wavelength Assignment Method in OPS Networks

    ISHIKAWA Eiji, XU Sugang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 15 - 15  2006.03

    CiNii

  • B-6-35 Routing Information Exchange Method for μSEcast

    KONO Motoyuki, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 35 - 35  2006.03

    CiNii

  • B-6-62 A Study on Controlling P2P Traffic

    OSAKI Jun, IIZUKA Tadashi, KATO Kei, CHIDA Koichi, MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 62 - 62  2006.03

    CiNii

  • B-6-63 Role of Initial Node Table in Pure P2P Application

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki, OSAKI Jun, CHIDA Koichi, KATO Kei, IIZUKA Tadashi

    Proceedings of the IEICE General Conference   2006 ( 2 ) 63 - 63  2006.03

    CiNii

  • B-6-64 Influence of Band Composition to Traffic Characteristics in P2P

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki, OSAKI Jun, CHIDA Koichi, KATO Kei, IIZUKA Tadashi

    Proceedings of the IEICE General Conference   2006 ( 2 ) 64 - 64  2006.03

    CiNii

  • B-6-92 Some Methods to Deal with Slow Link Users in Multicast and their Effects versus User Ratio

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 92 - 92  2006.03

    CiNii

  • B-7-183 Delay Performance Evaluation of Many-to-Many Multicast Routing Trees

    KARASAWA Hajime, TERADA Shinsuke, MIYOSHI Takumi, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 279 - 279  2006.03

    CiNii

  • B-11-23 Correlations in Viewing Environment and Content

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 427 - 427  2006.03

    CiNii

  • B-11-30 Analysis of Willingness to Pay in Content Download Services

    ITO Shunsuke, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 434 - 434  2006.03

    CiNii

  • B-14-4 Load Balancing Method for Multi-layered MAP in Hierarchical Mobile IPv6

    ITO Ken, ATSUMI Akiyoshi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 526 - 526  2006.03

    CiNii

  • B-14-8 Pricing Methods for IP Broadcast Services Considering User Behaviour

    BESSHO Hiroshi, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 530 - 530  2006.03

    CiNii

  • B-19-1 Coverage Evaluation of Test Item Extraction Tool for Test-Driven Software Development

    GOH Hirokazu, MIZUNO Osamu, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 542 - 542  2006.03

    CiNii

  • B-21-43 Analysis of Willingness to Receive Reward for Relay in Ad Hoc Networks

    DONKAI Kenji, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 603 - 603  2006.03

    CiNii

  • B-21-57 Access Control using Benefit in Ad-hoc and Cellular Cooperative Network

    KARASAWA Naoyuki, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2006 ( 2 ) 617 - 617  2006.03

    CiNii

  • Relation between Minimum Guaranteed Bandwidth and Willingness to Pay in Multiple Class Services

    YAMORI Kyoko, TANAKA Yoshiaki

    The transactions of the Institute of Electronics, Information and Communication Engineers. B   89 ( 3 ) 390 - 394  2006.03

    CiNii

  • Test Item Extraction Tool for Test-Driven Software Development of SIP Services

    GOH Hirokazu, MIZUNO Osamu, TANAKA Yoshiaki

    IEICE technical report   105 ( 627 ) 33 - 36  2006.02

     View Summary

    The test-driven software development method will make specification change easy compared with the conventional water fall model. The software release of the former will be done shortly compared with the latter. However, the quality assurance is difficult, because it is necessary to extract the test case without the source code. Thus, an algorithm is proposed to extract the test case from the specification, and the test case extraction tool using this algorithm is also proposed. It is shown that this tool can extract test cases for the state-less model appropriately. This paper considers whether the proposed method can be applied to the state transition model to extract test cases of actual SIP media server. The result shows that the test cases can be extracted appropriately by considering two or more possibilities for one item to estimate the output for each input.

    CiNii

  • Characteristics Analysis of PureP2P File-Sharing Traffic

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki, OSAKI Jun, CHIDA Koichi, KATO Kei, IIZUKA Tadashi

    IEICE technical report   105 ( 627 ) 133 - 136  2006.02

     View Summary

    In recent years, development of the technique of discriminating PureP2P traffic by network traffic observation is progressing. We paid our attention to the technique not from payload part but from header information. We have shown possibility that discrimination by "New Connection Rate" is useful. In order to apply "New Connection Rate" to general PureP2P, the elucidation of the principle based on the characteristic of PureP2P traffic is important. Then, we performed the file-sharing simulation using 200 machines in the Hokuriku IT Development Support Center in order to solve the principle of traffic by PureP2P file-sharing software. Especially, we focused on the influence of the network constitution of P2P to traffic characteristics, and paid our attention to the existence of initial nodes and band composition ratio in a network. This showed that the existence of initial nodes and the band composition ratio caused the increase in the number of connection nodes.

    CiNii

  • A Study on Controlling P2P Traffic : Discrimination of P2P Traffic in Bearer Layer

    OSAKI Jun, IIZUKA Tadashi, KATO Kei, CHIDA Koichi, MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    IEICE technical report   105 ( 627 ) 145 - 147  2006.02

     View Summary

    This study provides a solution for discriminating P2P traffic below transport layer and handling the traffic appropriately.

    CiNii

  • Characteristic Analysis of Many-to-Many Multicast Routing Trees Using Multiple Linear Regression Analysis

    KARASAWA Hajime, TERADA Shinsuke, MIYOSHI Takumi, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   105 ( 472 ) 25 - 30  2005.12

     View Summary

    If a static multicast tree is used for one-to-many multicast, the most efficient tree depends on the characteristics of the receivers such as the number of receivers. And, the efficiency of the tree has already been analyzed. However, as for many-to-many multicast, the efficiency of the tree has not been analyzed. This paper analyzes how various components affect the efficiency of the many-to-many multicast tree. As a result, it is shown that the most efficient many-to-many multicast tree does not depend on the number of multicast members. The performance of the tree depends mostly on the diameter of the tree, the variance of node degrees, and the number of leaf nodes.

    CiNii

  • A Tabu Search Method of Logical Topology Design in IP over WDM Networks

    LEE Galy, XU Sugang, TANAKA Yoshiaki

    IEICE technical report. Information networks   105 ( 323 ) 1 - 6  2005.10

     View Summary

    Given a static traffic condition, the motivation of logical topology design in IP over WDM networks is to optimize the network resource utilization to improve network performance. When it is necessary, the network can dynamically change its logical topology corresponding to the changing traffic conditions. Besides the traffic pattern changing, other network events may also need the logical topology to be reconfigured, such as the physical topology changes. Here, a faster near optimal reconfiguration can keep up with the changes of the network and bring a better system utilization compared to the long running time optimization for an exact solution. A fast reconfiguration needs a fast logical topology design tool. In this paper, a Tabu search (TS) method to resolve the logical topology design problem is proposed. The motivation is to find a feasible tool of logical topology design for network operators to re-optimize the network utilization within a shorter endurable computation time.

    CiNii

  • Optimal Delivery Interval and Call Admission Control for Multicast Contents Delivery Based on Users' Utility

    KAJITA Takehiro, TAKAHASHI Eiji, YAMORI Kyoko, TANAKA Yoshiaki

    The IEICE transactions on communications B   88 ( 10 ) 2042 - 2051  2005.10

    CiNii

  • Users' Benefit and Provider's Revenue of Content Delivery Services with Priority Control

    ITO Shunsuke, YAMORI Kyoko, TANAKA Yoshiaki

    ITE technical report   29 ( 51 ) 77 - 80  2005.09

    CiNii

  • 優先制御コンテンツ配信におけるユーザ便益と事業者収益(マルチメディアシステムの品質, 一般)

    伊藤俊輔, 矢守恭子, 田中良明

    電子情報通信学会技術研究報告. OIS, オフィスインフォメーションシステム   105 ( 284 ) 77 - 80  2005.09

     View Summary

    近年, インターネットのブロードバンド化に伴い大容量のコンテンツ配信サービスが注目されてきている.また, ユーザのニーズが多様化していることから, 優先制御を用いて複数クラスの品質を提供する差別化サービスが新たなサービスとして検討されている.このようなサービスでは, ユーザのニーズを予測し, それに合わせたサービスを提供することが非常に重要である.本稿では, 優先制御コンテンツ配信におけるユーザの行動を支払意思額によりモデル化し, ユーザ便益・事業者収益を最適とする条件をシミュレーションにより評価している.その結果, ユーザのための最適な料金設定と, 事業者のための最適な料金設定が異なることを明らかにしている.

    CiNii

  • 優先制御コンテンツ配信におけるユーザ便益と事業者収益(マルチメディアシステムの品質, 一般)

    伊藤俊輔, 矢守恭子, 田中良明

    電子情報通信学会技術研究報告. IE, 画像工学   105 ( 286 ) 77 - 80  2005.09

     View Summary

    近年, インターネットのブロードバンド化に伴い大容量のコンテンツ配信サービスが注目されてきている.また, ユーザのニーズが多様化していることから, 優先制御を用いて複数クラスの品質を提供する差別化サービスが新たなサービスとして検討されている.このようなサービスでは, ユーザのニーズを予測し, それに合わせたサービスを提供することが非常に重要である.本稿では, 優先制御コンテンツ配信におけるユーザの行動を支払意思額によりモデル化し, ユーザ便益・事業者収益を最適とする条件をシミュレーションにより評価している.その結果, ユーザのための最適な料金設定と, 事業者のための最適な料金設定が異なることを明らかにしている.

    CiNii

  • Users' Benefit and Provider's Revenue of Content Delivery Services with Priority Control

    ITO Shunsuke, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   105 ( 282 ) 77 - 80  2005.09

     View Summary

    Recently, large-size contents are delivered to users by content delivery service through broadband networks. The necessity for the service which guarantees quality is increasing in the Internet, because users' requirements are diversified. In such services, it is important to predict users' needs and to provide the services matching up to it. In this paper, the user's behaviour in content delivery service with priority control is modeled by using willingness to pay, and the users' benefit and the provider's revenue are maximized. As a result, it is shown that the optimal pricing for users and that for the provider are different.

    CiNii

  • Multicast Content Delivery with Multiple Speeds Based on Users' Utility

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   105 ( 278 ) 79 - 82  2005.09

     View Summary

    Multicast technology is expected to become widely used, since its link sharing capability makes it well suited to large size content delivery services. In multicast content delivery services, the speed of content delivery is adjusted to the slowest user's speed in the multicast tree. Therefore, it is effective to separate slow users from fast users according to users' available rate. This paper compares the users' utility of the delivery with multiple speeds and that of the delivery with blocking slow link users. It is shown that the delivery with multiple speeds is more effective when the users are not so sensitive to the waiting time to get the content.

    CiNii

  • BS-10-11 A Logical Topology Optimization with Tabu Search in IP over WDM Networks(BS-10. Network Planning, Control, and Management)

    LEE Galy, XU Sugang, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2005 ( 2 ) "SE - 31"-"SE-32"  2005.09

    CiNii

  • B-6-3 A Method of Estimating the Number of TCP Flows Using Traffic Properties

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

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

    CiNii

  • B-6-8 Users' Utility of Multicast Content Delivery with Multiple Speeds

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

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

    CiNii

  • B-11-9 Maximization of Provider's Benefit in Streaming and Download Using Priority Control

    ITO Shunsuke, YAMORI Kyoko, TANAKA Yoshiaki

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

    CiNii

  • B-14-4 Optimal MAP Selection with Scoring in Hierarchical Mobile IPv6

    ATSUMI Akiyoshi, TANAKA Yoshiaki

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

    CiNii

  • B-19-2 Test Case Extraction Tool Applying Test-Driven Communication Service Software Development

    GOH Hirokazu, MIZUNO Osamu, TANAKA Yoshiaki

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

    CiNii

  • B-21-2 Access Control in Ad-hoc and Cellular Cooperative Network

    KARASAWA Naoyuki, TANAKA Yoshiaki

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

    CiNii

  • ユーザ指向タイムクリティカルネットワークにおける多体多マルチキャストツリーの特性評価

    唐澤肇, 寺田真介, 三好匠, 田中良明, 矢守恭子, 山田茂樹, 上岡英史, 井手口哲夫, 奥田隆史, 福田晃, 北須賀輝明

    情報学ワークショップ2005論文集     255 - 260  2005.09

    Research paper, summary (international conference)  

  • Load Balancing by Scoring for Hierarchical Mobile IPv6

    ITO Ken, ATSUMI Akiyoshi, TANAKA Yoshiaki

    IEICE technical report   105 ( 195 ) 37 - 40  2005.07

     View Summary

    HMIPv6 (Hierarchical Mobile IPv6) protocol introduces MAP (Mobility Anchor Point) which relays all packets between HA (Home Agent) and MN (Mobile Node). This method can reduce the amount of signaling traffic and improve the handover speed. Since very high loads are concentrated in a MAP and the load of MAP possibly influences the communication quality, the load balancing method by suitable policy is needed in multi-layered MAP network. This paper proposes the load balancing method with score calculated according to attributes of mobile nodes, such as handover frequency and holding time. Simulation results show that this proposed method can reduce the load of whole network while achieving the load balancing on multi-layered MAP in HMIPv6 network.

    CiNii

  • Content Clustering Method Based on User's Subjective Evaluation

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   105 ( 179 ) 31 - 36  2005.07

     View Summary

    User's demand of the quality of streaming service depends on the intrinsic characteristics of the content. Various things can be considered as the characteristic. In this paper, it is considered that intensity based on sound or image quality is characteristics. The subjective evaluation experiment was done for several kinds of content. The relation between content characteristics and content types is shown by using principal component analysis. Then, based on the image quality and the sound quality, the contents are divided into several groups by cluster analysis.

    CiNii

  • Certainty in Network Management Decisions

    ZHANIKEEV Marat, TANAKA Yoshiaki

    Technical report of IEICE. TM   105 ( 163 ) 39 - 44  2005.06

     View Summary

    In network management, decisions are based on online analysis of monitoring data. In order for such decisions to be effective, analysis of monitoring data should have high validity. Unfortunately, due to the time constraints complicated analysis of large volumes of performance data is impossible. In this paper we introduce a variable that estimates the certainty of analysis of limited data volumes. The proposed certainty variable is tested with various sources of monitoring data.

    CiNii

  • Content Delivery System by Using Market-Based Priority Control

    TAKAHASHI Eiji, YAGI Noriyuki, YAMORI Kyoko, TANAKA Yoshiaki

    The IEICE transactions on communications B   88 ( 6 ) 1047 - 1057  2005.06

    CiNii

  • Proposal of Traffic Features for P2P Discrimination

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    IEICE technical report   105 ( 12 ) 5 - 8  2005.04

     View Summary

    With the rapid development of the Internet, the P2P communication technology which does not use any servers has kept advancing apace. However, the progress of the P2P network has lead to the illegal file sharing in addition to the rapid growth of network traffic. Thus, this research aims to discriminate users of pureP2P file sharing application from other users. This paper proposes some features including "new connection rate" which are useful for the P2P user discrimination. To automate discrimination processing, SVM(Support-Vector-Machine) is applied to this discrimination, and its accuracy is evaluated based on some experiments.

    CiNii

  • BS-10-8 Meta-Heuristic Logical Topology Optimization in IP over WDM Networks(BS-10. Network Controls for High-Quality Communications)

    XU Sugang, LEE Galy, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) "SE - 14"-"SE-15"  2005.03

    CiNii

  • BS-10-7 WDM Node Architectures with Limited Range Wavelength Converter Sharing(BS-10. Network Controls for High-Quality Communications)

    RASHID Mohammad Mamunur, XU Sugang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) "SE - 12"-"SE-13"  2005.03

    CiNii

  • B-6-24 Optimal MAP Selection with Scoring in Hierarchical Mobile IPv6

    ATSUMI Akiyoshi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 24 - 24  2005.03

    CiNii

  • B-6-94 An Implementation of Application-Assisted Adaptive Multicast

    TETSUHASHI Hideaki, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 94 - 94  2005.03

    CiNii

  • B-6-121 P2P Traffic Discrimination Technique based on TCP Session Statistics

    MATSUDA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 121 - 121  2005.03

    CiNii

  • B-6-128 Effect of Tuning Time and Adaptive Wavelength Allocation for WDM Single-Hop Networks

    OHGIYA Jun, XU Sugang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 128 - 128  2005.03

    CiNii

  • B-6-129 Optical Switching Selection Method According to the Type of Contents

    KAGIYAMA Wataru, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 129 - 129  2005.03

    CiNii

  • B-11-27 Picture Contents Clustering Method According to its Attributes

    SUDA Yohei, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 431 - 431  2005.03

    CiNii

  • B-11-28 Optimum Price of Guaranteed Bandwidth Service for Maximizing Revenue

    ITO Hiroyuki, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 432 - 432  2005.03

    CiNii

  • B-14-2 Wavelength Layer Selection Method for Multi-Layered Grid MAN

    YAMAI Yoshikazu, XU Sugang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 494 - 494  2005.03

    CiNii

  • B-19-32 Test Item Extraction Method Applying Test-Driven Communication Service Software Development

    GOH Hirokazu, MIZUNO Osamu, SHIRAGA Akinori, ABE Tsuyoshi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) 566 - 566  2005.03

    CiNii

  • B-21-21 Users' Utility in Ad-hoc and Cellular Cooperative Network

    KARASAWA Naoyuki, TANAKA Yoshiaki, MASE Kenichi

    Proceedings of the IEICE General Conference   2005 ( 2 ) 610 - 610  2005.03

    CiNii

  • BS-6-1 Relation between Price and Users' Benefits in Multiple Class Streaming Service

    ITO Shunsuke, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) "S - 50"  2005.03

    CiNii

  • BS-8-4 Load Balancing Method with the Attribute of Mobile Nodes in Hierarchical Mobile IPv6

    ITO Ken, ATSUMI Akiyoshi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) "S - 73"  2005.03

    CiNii

  • BS-8-5 Precision of Shared Topology Detection Method

    MATSUTOMO Kosuke, ZHANIKEEV Marat, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2005 ( 2 ) "S - 74"-"S-75"  2005.03

    CiNii

  • 積極的監視データ活用による先取り管理

    ザニケエフ マラット, 田中 良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   104 ( 707 ) 37 - 42  2005.03

    CiNii

  • Usability of Monitoring Data in Proactive Management

    ZHANIKEEV Marat, TANAKA Yoshiaki

    Technical report of IEICE. TM   104 ( 707 ) 37 - 42  2005.03

     View Summary

    Although management paradigms have lived through a number of major changes in the last 10 years, most of them are not proactive and very weakly depend on current state of managed network domain. Up to the day, monit oring and management activities are executed separately and quite often have independent infrastructures within the same network domain. This paper looks into the possibility of using online monitoring data, both passive. as well as obtained by active measurements, in order to perform management activities online. The usability of various sources of data are tested by neural network predictions.

    CiNii

  • 移動端末属性に応じた最適MAP選択方式

    渥美 章佳, 田中 良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   104 ( 706 ) 1 - 6  2005.03

    CiNii

  • Optimal MAP Selection with Attribute of Mobile Nodes in Hierarchical Mobile IPv6

    ATSUMI Akiyoshi, TANAKA Yoshiaki

    Technical report of IEICE. TM   104 ( 706 ) 1 - 6  2005.03

     View Summary

    Mobile IPv6 allows a mobile node to move from one link to another without changing the mobile node's address. And the Hierarchical Mobile IP Mobility Management (HMIPv6) proposes to reduce the amount of signallinig traffic and improve the performance of Mobile IPv6 in terms of handoff speed. HMIPv6 allows multiple Mobility Anchor Points located at any level in hierarchical network. However, there are no effective method to determine the MAP which a mobile node use. This paper presents optimal MAP selection method based on the attribute of mobile nodes. Simulation results show that this method greatly reduces the amount of signallinig traffic and achieve the load balancing in Hierarchical Mobile IPv6 network.

    CiNii

  • Dynamic Wavelength Assignment Based on Distributed Traffic Analysis in WDM Single-Hop Networks

    OHGIYA Jun, XU Sugang, TANAKA Yoshiaki

    IEICE technical report   104 ( 690 ) 317 - 320  2005.02

     View Summary

    WDM optical networks represent the direction to the future high capacity access network applications. Here, we investigate a single-hop WDM star network. It is based on a passive star-coupled configuration. In this paper, we investigate the influence of long tuning latency on the performance of one slow tunable transmitter and multiple fixed receivers architecture. Assuming the existence of traffic pattern in certain time period, two heuristic dynamic channel allocation algorithms based on distributed traffic analysis are proposed. To investigate the performance, evaluation through simulations is done in terms of network throughput and packet delay. It is shown that the proposals are efficient to optimize the wavelength channel utilization.

    CiNii

  • 分散制御トラヒック推定によるWDMシングルホップネットワーク動的波長割当

    扇谷 潤, 徐 蘇鋼, 田中 良明

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   104 ( 692 ) 317 - 320  2005.02

    CiNii

  • Maximizing Users' Utility of Multicast Contents Delivery by Setting Delivery Interval Based on Each Content's Popularity

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   104 ( 690 ) 171 - 174  2005.02

     View Summary

    In multicast contents delivery services, the waiting time of users will decrease if the contents delivery interval becomes shorter. However, if we set all contents' delivery intervals too short, it will cause network congestion. Therefore, it seems effective to set short delivery intervals to popular contents and set long delivery intervals to unpopular contents. In this paper, we show it is able to increase users' utility to set delivery interval based on each content's popularity. And, we noticed that setting delivery interval based on each content's popularity is more effective in situations where many users want to obtain contents as quickly as possible.

    CiNii

  • Dynamic Wavelength Assignment Based on Distributed Traffic Analysis in WDM Single-Hop Networks

    OHGIYA Jun, XU Sugang, TANAKA Yoshiaki

    IEICE technical report   104 ( 690 ) 317 - 320  2005.02

     View Summary

    WDM optical networks represent the direction to the future high capacity access network applications. Here, we investigate a single-hop WDM star network. It is based on a passive star-coupled configuration. In this paper, we investigate the influence of long tuning latency on the performance of one slow tunable transmitter and multiple fixed receivers architecture. Assuming the existence of traffic pattern in certain time period, two heuristic dynamic channel allocation algorithms based on distributed traffic analysis are proposed. To investigate the performance, evaluation through simulations is done in terms of network throughput and packet delay. It is shown that the proposals are efficient to optimize the wavelength channel utilization.

    CiNii

  • Switching System Selection Method According to Types of Contents in Optical Networks

    KAGIYAMA Wataru, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   104 ( 690 ) 461 - 464  2005.02

     View Summary

    Recently, much attention has been given to high-speed optical networks as the Internet becomes popular and has large traffic. It is now expected to realize the optical network techniques : wavelength routing, optical burst switching, and optical packet switching. Considering the characteristics of these technologies, it is more desirable that users can choose various switching systems depending on the provided contents. For example, wavelength routing that is circuit switching system in optical network is most suitable for real-time data. This paper proposes not only effective but also high-quality content delivery method that switches both wavelength routing and optical burst switching according to the types of contents. The performance of the proposed method is evaluated by computer simulation.

    CiNii

  • Maximizing Users' Utility of Multicast Contents Delivery by Setting Delivery Interval Based on Each Content's Popularity

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   104 ( 692 ) 171 - 174  2005.02

     View Summary

    In multicast contents delivery services, the waiting time of users will decrease if the contents delivery interval becomes shorter. However, if we set all contents' delivery intervals too short, it will cause network congestion. Therefore, it seems effective to set short delivery intervals to popular contents and set long delivery intervals to unpopular contents. In this paper, we show it is able to increase users' utility to set delivery interval based on each content's popularity. And, we noticed that setting delivery interval based on each content's popularity is more effective in situations where many users want to obtain contents as quickly as possible.

    CiNii

  • Dynamic Wavelength Assignment Based on Distributed Traffic Analysis in WDM Single-Hop Networks

    OHGIYA Jun, XU Sugang, TANAKA Yoshiaki

    IEICE technical report   104 ( 692 ) 317 - 320  2005.02

     View Summary

    WDM optical networks represent the direction to the future high capacity access network applications. Here, we investigate a single-hop WDM star network. It is based on a passive star-coupled configuration. In this paper, we investigate the influence of long tuning latency on the performance of one slow tunable transmitter and multiple fixed receivers architecture. Assuming the existence of traffic pattern in certain time period, two heuristic dynamic channel allocation algorithms based on distributed traffic analysis are proposed. To investigate the performance, evaluation through simulations is done in terms of network throughput and packet delay. It is shown that the proposals are efficient to optimize the wavelength channel utilization.

    CiNii

  • Switching System Selection Method According to Types of Contents in Optical Networks

    KAGIYAMA Wataru, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   104 ( 692 ) 461 - 464  2005.02

     View Summary

    Recently, much attention has been given to high-speed optical networks as the Internet becomes popular and has large traffic. It is now expected to realize the optical network techniques : wavelength routing, optical burst switching, and optical packet switching. Considering the characteristics of these technologies, it is more desirable that users can choose various switching systems depending on the provided contents. For example, wavelength routing that is circuit switching system in optical network is most suitable for real-time data. This paper proposes not only effective but also high-quality content delivery method that switches both wavelength routing and optical burst switching according to the types of contents. The performance of the proposed method is evaluated by computer simulation.

    CiNii

  • Optimum Pricing Method Using Service Choice Behaviour Model in Guaranteed Bandwidth Service

    ITO Hiroyuki, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   104 ( 689 ) 13 - 16  2005.02

     View Summary

    Differentiated services, which have multiple classes using priority control, have recently been introduced as a new service. In this paper, the prices are optimized to maximize the revenue in the guaranteed bandwidth service with flat monthly rate. Disaggregate behavioural model is applied to the user's behaviour, and the relation between the user's utility and the price is obtained by simulation. The optimum pricing function is estimated as a power function.

    CiNii

  • Application Model and Evaluation of Test-Driven Development to Communication Software

    GOH Hirokazu, MIZUNO Osamu, SHIRAGA Akinori, ABE Tsuyoshi, TANAKA Yoshiaki

    IEICE technical report   104 ( 689 ) 201 - 204  2005.02

     View Summary

    Soft release in short term can be expected to be achieved by applying the test-driven development technique to communication software. However, it is necessary to extract test items in the situation before coding programs to be tested. The test items are extracted by three steps ; covering extraction of input system, forecast of output, and generation of test program. Especially, the first step is difficult. To solve this problem, this paper proposes an algorithm that pulls out parameters from specifications and extracts the input system by paying attention within range where parameters can be taken. Applying this algorithm to the development of reverse proxy software, which has plural classes, 15 test items were extracted from class I and 37 test items were extracted from class II.

    CiNii

  • Optimum Pricing Method Using Service Choice Behaviour Model in Guaranteed Bandwidth Service

    ITO Hiroyuki, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   104 ( 691 ) 13 - 16  2005.02

     View Summary

    Differentiated services, which have multiple classes using priority control, have recently been introduced as a new service. In this paper, the prices are optimized to maximize the revenue in the guaranteed bandwidth service with flat monthly rate. Disaggregate behavioural model is applied to the user's behaviour, and the relation between the user's utility and the price is obtained by simulation. The optimum pricing function is estimated as a power function.

    CiNii

  • Application Model and Evaluation of Test-Driven Development to Communication Software

    GOH Hirokazu, MIZUNO Osamu, SHIRAGA Akinori, ABE Tsuyoshi, TANAKA Yoshiaki

    IEICE technical report   104 ( 691 ) 201 - 204  2005.02

     View Summary

    Soft release in short term can be expected to be achieved by applying the test-driven development technique to communication software. However, it is necessary to extract test items in the situation before coding programs to be tested. The test items are extracted by three steps ; covering extraction of input system, forecast of output, and generation of test program. Especially, the first step is difficult. To solve this problem, this paper proposes an algorithm that pulls out parameters from specifications and extracts the input system by paying attention within range where parameters can be taken. Applying this algorithm to the development of reverse proxy software, which has plural classes, 15 test items were extracted from class I and 37 test items were extracted from class II.

    CiNii

  • WDM Node Architectures with Limited Range Wavelength Converter

    RASHID Mohammad Mamunur, XU Sugang, TANAKA Yoshiaki

      104 ( 617 ) 25 - 28  2005.01

    CiNii

  • WDM Node Architectures with Limited Range Wavelength Converter

    RASHID Mohammad Mamunur, XU Sugang, TANAKA Yoshiaki

      104 ( 617 ) 25 - 28  2005.01

    CiNii

  • Meta-Heuristic Logical Topology Design for Link Failures in IP over WDM Networks

    XU Sugang, TANAKA Yoshiaki

    IEICE technical report   104 ( 617 ) 29 - 32  2005.01

     View Summary

    WDM optical networks represent the direction to future high capacity wide-area network applications. By creating optical paths between nodes in the core networks, logical topology can be created over the physical topology. In this paper we consider the method of designing logical topology in wavelength routed IP networks. For a network operator to achieve logical topology design especially for the fast restoration from large network failures after disasters such as earthquake where logical topology reconfiguration is required, comparing to the performance requirement the computing time of a feasible solution is critical. The exact formulation of the logical topology problem is usually given as Mixed Integer Linear Programming, but it grows intractable with increasing network size. For a fast design we have proposed a new simulated annealing approach to determine a better logical topology within a shorter time. For further study on fast logical topology design using meta-heuristics, here we compare simulated annealing with a genetic algorithm. Through performance comparisons, we show that our proposed simulated annealing approach can design a better logical topology in a shorter time comparing to previous simulated annealing and genetic approaches.

    CiNii

  • WDM Node Architectures with Limited Range Wavelength Converter

    RASHID Mohammad Mamunur, XU Sugang, TANAKA Yoshiaki

      104 ( 619 ) 25 - 28  2005.01

    CiNii

  • Meta-Heuristic Logical Topology Design for Link Failures in IP over WDM Networks

    XU Sugang, TANAKA Yoshiaki

    IEICE technical report   104 ( 619 ) 29 - 32  2005.01

     View Summary

    WDM optical networks represent the direction to future high capacity wide-area network applications. By creating optical paths between nodes in the core networks, logical topology can be created over the physical topology. In this paper we consider the method of designing logical topology in wavelength routed IP networks. For a network operator to achieve logical topology design especially for the fast restoration from large network failures after disasters such as earthquake where logical topology reconfiguration is required, comparing to the performance requirement the computing time of a feasible solution is critical. The exact formulation of the logical topology problem is usually given as Mixed Integer Linear Programming, but it grows intractable with increasing network size. For a fast design we have proposed a new simulated annealing approach to determine a better logical topology within a shorter time. For further study on fast logical topology design using meta-heuristics, here we compare simulated annealing with a genetic algorithm. Through performance comparisons, we show that our proposed simulated annealing approach can design a better logical topology in a shorter time comparing to previous simulated annealing and genetic approaches.

    CiNii

  • An Architecture of Application-Assisted Adaptive Multicast and Its Evaluation

    TETSUHASHI Hideaki, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report. Office Information Systems   104 ( 567 ) 67 - 72  2005.01

     View Summary

    Multicast communication is a remarkable technology that can substantially decrease network traffic and can save network resources and transmission costs. In multicasting, the transmission speed must be set to the lowest one among the available capacities of links in the multicast tree. This characteristic increases the data transmission time, and accordingly the content could not be delivered efficiently. We have studied an adaptive delivery system to dynamically select multicasting and store-and-forward transferring. This system was proved as an effective system in best-effort networks. In this paper, we put remarkable points on transmission control and a store-and-forward fanction, after considering link capacities. Experimental results show that the implemented system realizes effective data delivery with expected behavior in a test network, we have implemented application-assisted adaptive multicast with transmission control.

    CiNii

  • アプリケーション支援による適応形マルチキャストの構成とその評価(オフィスアプリケーション・ネットワーキング・マネジメント及び一般)

    鉄橋英明, 三好匠, 田中良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   104 ( 567 ) 67 - 72  2005.01

     View Summary

    マルチキャストはネットワークのトラヒックを減らし, ネットワークリソースと通信コストを節約することのできる非常に優れた技術である.マルチキャストを使用する場合, その通信速度はマルチキャストツリー内で最小の使用可能帯域に合わせる必要がある.この特徴はデータの配信時間を増大させ, コンテンツの効果的な配信を妨げるものである.筆者らは途中ルータに搭載したアプリケーションによって, マルチキャストと蓄積配信を動的に選択する適応形マルチキャストシステムの開発を行っている.このシステムはベストエフォートのネットワークにおいて効果的であることが証明されている.本稿では, ネットワークの輻輳状況を判断した後の送信制御機能および蓄積再配信機能に重点をおいた開発を行い, 作成したアプリケーションの動作確認を行っている.その結果, 実験ネットワークにおいて, 適切に送信制御された蓄積配信を実現している.

    CiNii

  • An Architecture of Application-Assisted Adaptive Multicast and Its Evaluation

    TETSUHASHI Hideaki, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report. Office Information Systems   104 ( 569 ) 67 - 72  2005.01

     View Summary

    Multicast communication is a remarkable technology that can substantially decrease network traffic and can save network resources and transmission costs. In multicasting, the transmission speed must be set to the lowest one among the available capacities of links in the multicast tree. This characteristic increases the data transmission time, and accordingly the content could not be delivered efficiently. We have studied an adaptive delivery system to dynamically select multicasting and store-and-forward transferring. This system was proved as an effective system in best-effort networks. In this paper, we put remarkable points on transmission control and a store-and-forward fanction, after considering link capacities. Experimental results show that the implemented system realizes effective data delivery with expected behavior in a test network, we have implemented application-assisted adaptive multicast with transmission control.

    CiNii

  • An Architecture of Application-Assisted Adaptive Multicast and Its Evaluation

    TETSUHASHI Hideaki, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report. Office Information Systems   104 ( 565 ) 67 - 72  2005.01

     View Summary

    Multicast communication is a remarkable technology that can substantially decrease network traffic and can save network resources and transmission costs. In multicasting, the transmission speed must be set to the lowest one among the available capacities of links in the multicast tree. This characteristic increases the data transmission time, and accordingly the content could not be delivered efficiently. We have studied an adaptive delivery system to dynamically select multicasting and store-and-forward transferring. This system was proved as an effective system in best-effort networks. In this paper, we put remarkable points on transmission control and a store-and-forward fanction, after considering link capacities. Experimental results show that the implemented system realizes effective data delivery with expected behavior in a test network, we have implemented application-assisted adaptive multicast with transmission control.

    CiNii

  • Network Information Management Method for Multi-Layered Grid Topology MAN

    YAMAI Yoshikazu, XU Sugang, YANAKA Yoshiaki

      104 ( 568 ) 43 - 48  2005.01

    CiNii

  • Network Information Management Method for Multi-Layered Grid Topology MAN

    YAMAI Yoshikazu, XU Sugang, YANAKA Yoshiaki

      104 ( 564 ) 43 - 48  2005.01

    CiNii

  • 多面構成格子形MANにおけるネットワーク情報管理手法(オフィスアプリケーション・ネットワーキング・マネジメント及び一般)

    山井美和, 徐蘇鋼, 田中良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   104 ( 566 ) 43 - 48  2005.01

     View Summary

    都市部におけるMANは格子形であることが多い.そのようなMANにおけるスパニングツリーの形状としては, 障害復旧の観点を重視すると, 渦巻形が適している.本稿では, MANの格子形構造の特徴に着目した表現方法を定義し, 多面構成された渦巻形スパニングツリーの形状の類似性を比較する.それによりリンク障害の影響度や冗長面確保のための類似度を評価する管理手法を提案し, 渦巻形スパニングツリーによる多面構成格子形MANの評価を行う.

    CiNii

  • 多面構成格子形MANにおけるネットワーク情報管理手法(オフィスアプリケーション・ネットワーキング・マネジメント及び一般)

    山井美和, 徐蘇鋼, 田中良明

    電子情報通信学会技術研究報告. OIS, オフィスインフォメーションシステム   104 ( 568 ) 43 - 48  2005.01

     View Summary

    都市部におけるMANは格子形であることが多い.そのようなMANにおけるスパニングツリーの形状としては, 障害復旧の観点を重視すると, 渦巻形が適している.本稿では, MANの格子形構造の特徴に着目した表現方法を定義し, 多面構成された渦巻形スパニングツリーの形状の類似性を比較する.それによりリンク障害の影響度や冗長面確保のための類似度を評価する管理手法を提案し, 渦巻形スパニングツリーによる多面構成格子形MANの評価を行う.

    CiNii

  • Network Information Management Method for Multi-Layered Grid Topology MAN

    YAMAI Yoshikazu, XU Sugang, YANAKA Yoshiaki

      104 ( 564 ) 43 - 48  2005.01

    CiNii

  • Adaptive Wavelength Allocation for Single-Hop WDM Networks with Slow Tunable Transmitter

    OHGIYA Jun, XU Sugang, TANAKA Yoshiaki

    IEICE technical report   104 ( 515 ) 7 - 10  2004.12

     View Summary

    WDM optical networks represent the direction to the future high capacity access network applications. Here, we investigate a single-hop WDM star network. It is based on a passive star-coupled configuration. Employing slow tunable transceivers means low system cost, in this paper we investigate the influence of long tuning latency on the performance of one slow tunable transmitter and multiple fixed receivers architecture. Assuming the existence of traffic pattern in certain time period, two heuristic optimal channel allocation algorithms for slotted ALOHA protocol are proposed. To investigate the performance, evaluation through simulations is done in terms of network throughput, packet delay. We show that the proposals are efficient to optimize the wavelength channel utilization.

    CiNii

  • 低速波長切換送信機を用いたWDMシングルホップネットワークにおける適応的波長割当(フォトニックネットワークシステム,光ルーチング,一般)

    扇谷潤, 徐蘇鋼, 田中良明

    電子情報通信学会技術研究報告. PN, フォトニックネットワーク   104 ( 517 ) 7 - 10  2004.12

     View Summary

    WDMシングルホップネットワークの構成要素として,各ノード一つの低速波長切換送信機と,各ノード波長数分の固定波長受信機を仮定する.これらのデバイスはいずれも安価なものである.このようなネットワークにおいて,トラヒック変動が起こったときは,波長割当を変更することになる.波長の変更に要する時間は送信機を使用できないので,波長切換を行うノード数がなるべく少なくなるように波長割当を行うと,スループット及び遅延特性が改善される.本稿では,その方式を提案し,特性を求めている.

    CiNii

  • Analysis of Quality Evaluation of Guaranteed Minimum Bandwidth and Willingness to Pay

    YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   104 ( 443 ) 25 - 28  2004.11

     View Summary

    To offer the guaranteed multiple-priority services, we should know what quality is needed and what price is appropriate. The willingness to pay (WTP) would change according to the maximum bandwidth which can be used during non-busy period, even if the minimum guaranteed bandwidth is fixed. This paper shows the relation between the maximum bandwidth and the willingness to pay of multiple-priority classes, by subjective evaluation experiment and questionnaire survey. Using the WTP, the price of the minimum guaranteed bandwidth is quantified.

    CiNii

  • 最低保証帯域幅の主観品質評価と支払意思額の分析(モバイルサービス,サービス品質,一般)

    矢守恭子, 田中良明

    電子情報通信学会技術研究報告. CQ, コミュニケーションクオリティ   104 ( 441 ) 25 - 28  2004.11

     View Summary

    近年,優先制御を用いて複数クラスの品質を提供する差別化サービスが新たなサービスとして検討されており,品質に対する料金設定が問題となっている.本稿では,二つのアプリケーションの帯域幅による品質の違いを提示し,それぞれの最低保証帯域幅に対する支払意思額や,サービス品質に対する満足度を主観評価実験により調査した.そして,最低保証帯域幅の主観品質評価と支払意思額の関係を定量的に明らかにした.

    CiNii

  • Multicast Call Admission Control Based on Users' Utility

    KAJITA Takehiro, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report   104 ( 354 ) 9 - 12  2004.10

     View Summary

    In the download type contents delivery service using multicast, the delivery speed must be adjusted to the minimum bandwidth of the multicast tree. The user's utility depends on the waiting time, and the waiting time depends on the minimum bandwidth. Therefore, from the viewpoint of user's utility, it will be effective to block slow link user's call by using call admission control (CAC). However, by using CAC, the total number of users will decrease, and the total users' utility may decrease. This paper studies the relation between the delivery interval and the total users' utility, and that between the blocking probability and the total users' utility.

    CiNii

  • A Restoration Method by Using Spiral Spanning Tree in Grid Topology MAN

    YAMAI Yoshikazu, XU Sugang, YANAKA Yoshiaki

    IEICE technical report. Information networks   104 ( 340 ) 65 - 70  2004.10

     View Summary

    In order to build MAN, it is important to consider existing building structures. By using spanning tree for broadcast communication on all-optical MAN, it will be possible to improve reliability. Spiral spanning tree is fit for this purpose. The restoration procedure is very simple, and it is fast to recover from link failure. This method can be applied to multi-layered configuration using WDM technology for future enhancement.

    CiNii

  • Packet Control Method for Mobile IP Multicast with HMIPv6

    YUAN Bin, ATSUMI Akiyoshi, TANAKA Yoshiaki

    IEICE technical report. Information networks   104 ( 340 ) 71 - 76  2004.10

     View Summary

    In present mobile communications, hand-over may often cause packet loss andre-ordering. In case of multicast this can be a serious problem, as lost UDP packets are not retransmitted. This is also the reason of considerable deterioration of quality in video streaming services. This paper is considering a method of avoiding packet loss. It is based on existing HMIPv6(Hierarchical Mobile IPv6)+FMIPv6(Fast Handover for Mobile IPv6) methods. The complete extermination of packet loss is implemented through providing abilities to transmit packets to intermidiate router (Mobility Anchor Point: MAP), buffer them, and control multicast groups.

    CiNii

  • Proposal of Link Aggregation by Duplication and Unification of Packets and Its Application to TCP Traffic

    SONODA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    The Transactions of the Institute of Electronics, Information and Communication Engineers B   87 ( 10 ) 1668 - 1677  2004.10

    CiNii

  • Effective Detection of Network Performance Properties

    ZHANIKEEV Marat, TANAKA Yoshiaki

    Technical report of IEICE. TM   104 ( 326 ) 13 - 18  2004.09

     View Summary

    Recent advent of QoS requirements at higher application layers and increasing complexity of network routing technologies demand higher reliability and comprehensiveness from network performance management system. We propose an effective framework of network performance monitoring that can be vised to obtain relatively short-term properties of network performance or as a part of automatic management systems.

    CiNii

  • Muximizing Users' Utility by Limited Preemptive Priority Control

    ITO Shunsuke, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   104 ( 188 ) 29 - 34  2004.07

     View Summary

    Contents delivery will become more popular in the near future, and its traffic is expected to become dominant in the network. Generally, the user's utility (satisfaction) decreases as the waiting time for acquisition of contents increases. The total users' utility can be maximized by using priority control in consideration of user's behaviour. This paper studies the priority control based on various types of utility function. The formula for estimating the mean waiting time is derived for priority control available in packet switching systems. The optimal condition is defined in terms of the traffic load and the waiting time for high and low priority classes, respectively. Finally, the optimal condition for priority and non-priority classes is analysed using numerical examples.

    CiNii

  • Optimization Method for Hierarchical Routing Group with Traffic Impact

    ATSUMI Akiyoshi, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. TM   104 ( 165 ) 25 - 30  2004.07

     View Summary

    With the rapid growth of the computer network, it is becoming difficult for routers to handle growing amount of routing data. Hierarchical routing is one of the solutions to this problem. In the current hierarchical routing architecture, an administrator must decide routing groups and properly assign a static metric to each link manually. This process is complicated. Furthermore, to maintain the routing performance, dynamic metrics such as traffic should be considered in constructing hierarchical groups. This paper proposes optimization method that introduces traffic information into the decision of hierarchical routing groups. This method can be applied to a random network, and thus it can reduce the administrative process. Futhermore, this method can decide the effective hierarchical routing groups considering traffic impact. The obtained results show that our method can greatly reduce the size of routing data while keeping low average delay in the network.

    CiNii

  • NOMS2004国際会議報告(設備管理,ネットワーク管理,及び一般)

    井上正輝, 棚瀬章文, 桐葉佳明, 田中良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   104 ( 164 ) 31 - 36  2004.07

    CiNii

  • Electronic Voting Schemes with Anonymous Distribution

    OKAMOTO Manabu, TANAKA Yoshiaki

    The Transactions of the Institute of Electronics, Information and Communication Engineers A   87 ( 7 ) 958 - 966  2004.07

    CiNii

  • 通信・放送機構 直轄研究「ロバスト情報配信プラットホームに関する研究開発プロジェクト」

    翁長 健治, 田中 良明, 宮城 隼夫, 屋比久 友秀, 矢守 恭子, 根路銘 もえ子

    画像電子学会誌 = Imaging & Visual Computing The Journal of the Institute of Image Electronics Engineers of Japan   33 ( 2 ) 294 - 297  2004.03

    CiNii

  • B-6-8 Multicast Contents Delivery Interval and Server Selection

    KAJITA Takehiro, TAKAHASHI Eiji, TANAKA Yoshiaki

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

    CiNii

  • B-6-10 A Proposal of Data Delivery Table for Adaptive Multicast

    TETSUHASHI Hideaki, MIYOSHI Takumi, TANAKA Yoshiaki

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

    CiNii

  • B-6-26 Multicast Network Design Method with Small World

    SUZUKI Takashi, MIYOSHI Takumi, TANAKA Yoshiaki

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

    CiNii

  • B-6-50 Packet Loss Avoidance Method for Multicast on Hierarchical Mobile IPv6

    YUAN Bin, ATSUMI Akiyoshi, TANAKA Yoshiaki

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

    CiNii

  • B-6-100 Efficiency of Contents Delivery and User's Service Selection

    YAGI Noriyuki, TAKAHASHI Eiji, YAMORI Kyoko, TANAKA Yoshiaki

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

    CiNii

  • B-6-102 Optimum Condition for Guaranteed Bandwidth and Best Effort Services with Maximum Revenue

    ITO Hiroyuki, YAMORI Kyoko, TANAKA Yoshiaki

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

    CiNii

  • B-6-104 Maximum User's Utility of Limited Preemptive Priority Control for Data Delivery

    ITO Shunsuke, YAMORI Kyoko, TANAKA Yoshiaki

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

    CiNii

  • B-6-159 Multi-Layered Grid MAN Using WDM

    YAMAI Yoshikazu, XU Sugang, TANAKA Yoshiaki

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

    CiNii

  • B-6-161 A Wavelength Allocation Method for Single-Hop WDM Networks with Multiple Receivers

    OHGIYA Jun, XU Sugang, TANAKA Yoshiaki

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

    CiNii

  • B-6-169 Contents Transport Method in Photonic Networks

    KAGIYAMA Wataru, MIYOSHI Takumi, TANAKA Yoshiaki

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

    CiNii

  • B-11-3 Analysis of General Willingness to Pay with Guaranteed Minimum Bandwidth

    HIRAYAMA Jun, YAMORI Kyoko, TANAKA Yoshiaki

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

    CiNii

  • B-14-11 Hierarchical Measurement-Based CAC with Scalability for VoIP

    LU Yan, TANAKA Yoshiaki

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

    CiNii

  • SB-6-2 Evaluation of Link Aggregation by Duplication and Unification of Packets for TCP Traffic in Burst Loss Model

    SONODA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2004 ( 2 ) "S - 53"-"S-54"  2004.03

    CiNii

  • Topological Performance Analysis for Hierarchical Mobile IPv6

    ATSUMI Akiyoshi, TANAKA Yoshiaki

    Technical report of IEICE. TM   103 ( 701 ) 55 - 60  2004.03

     View Summary

    Mobile IPv6 allows a mobile node to move from one link to another without changing the mobile node's address. And the Hierarchical Mobile IP Mobility Management (HMIP) proposes to reduce the amount of signallinig traffic and improve the performance of Mobile IPv6 in terms of handoff speed. HMIPv6 allows multiple Mobility Anchor Points located at any level in hierarchical network. However, there are no method to determine the number of MAPs or their location in the network. This paper presents optimal location based on the results of analysis of load under several different network topologies.

    CiNii

  • Photonic Transport Selection Method for Effective Content Delivery

    KAGIYAMA Wataru, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. TM   103 ( 701 ) 79 - 84  2004.03

     View Summary

    Recently, much attention has been given to high-speed optical networks as the Internet becomes popular and has large traffic. It is now expected to realize wavelength routing, optical burst switching, and optical packet switching as optical network techniques. Considering the characteristics of these technologies, it is more desirable for users to choose various transport networks according to provided services. This paper proposes an effective content delivery method that switches the three optical techniques depending on the content size. The performance of the proposed method is evaluated by computer simulation.

    CiNii

  • Lightweight Management in High-Speed Networks

    ZHANIKEEV Marat, TANAKA Yoshiaki

    Technical report of IEICE. TM   103 ( 700 ) 7 - 12  2004.03

     View Summary

    The increase of trasfer capacity in modern networks does not necessarily mean better performance as interactions of a large number of simultaneous flows can lead to unpredictable traffic conditions that can finally result in drastic performance deterioration. Traffic modeling itself still faces great challenges in creating the model of traffic in today's Internet, and with greately increased traffic in high-speed networks this problem becomes only worse. Thus, performance monitoring becomes the most important part of managing such networks. This paper proposes a lightweight monitoring solution by distributed active measurement that overcomes shortcomings of currently popular managment paradigms.

    CiNii

  • Hierarchical Measurement-Based CAC for VoIP

    LU Yan, TANAKA Yoshiaki

    Technical report of IEICE. TM   103 ( 700 ) 25 - 30  2004.03

     View Summary

    Measurement-based CAC Call Admission Control) is widely recognized as a scheme to guarantee QoS of VoIP. PSTN Fallback, which is a measurement-based CAC scheme, has already been implemented in routers for practical use. Scalability is a problem of PSTN Fallback, because SAA (Security Assurance Agent) probes are transmitted o all destination IP addresses. In particular, it is almost impossible to transmit probes to thousands of destination IP addresses in a large-scale network. In this paper, a hierarchical measurement-based CAC is proposed to solve the problem of scalability. Then, the probe measurement mechanism is modeled, and the measurement success probability is calculated. Furthermore, from the viewpoint of SAA probe traffic, the most suitable hierarchy is examined.

    CiNii

  • Evaluation of Link Aggregation by Duplication and Unification of Packets for TCP Traffic

    SONODA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    IEICE technical report. Information networks   103 ( 690 ) 171 - 174  2004.02

     View Summary

    With the rapid development of communication technology, we now have various kinds of access circuits for IP connection based on Ethernet (wired or wireless), cellular phone or PHS. Since each circuit is available at relatively low cost, it is easy to use multiple circuits simultaneously. But bit error rate of some circuits can be unacceptably high under bad conditions. In this paper, we propose a new link aggregation method called LADUP (Link Aggregation by Duplication and Unification of Packets) to achieve high TCP throughput with effective use of multiple circuits. The packets duplicated in LADUP depends on the quality related conditions of the circuits and they are defined as either only ACK packets or all the packets in this paper. The application conditions of these two alternatives are demonstrated based on their throughput evaluation results in burst and random packet loss models.

    CiNii

  • Network Design based on SmallWorld and its Performance Comparison

    SUZUKI Takashi, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report. Information networks   103 ( 690 ) 345 - 350  2004.02

     View Summary

    SmallWorld that represents human behaviour and psychology is widely noticed. As telecommunication networks are used by human beings, SmallWorld topology will be effective for them. This paper studies the network design method using SmallWorld. First, a new topology design method is proposed. Then, the performance is compared with other topologies. It is shown that the design method using SmallWorld is effective.

    CiNii

  • Traffic Control with User's Service Selection for Contents Delivery

    YAGI Noriyuki, TAKAHASHI Eiji, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report. Information networks   103 ( 690 ) 373 - 376  2004.02

     View Summary

    To cope with the congestion generated by intensive demand of large size contents delivery, it will be effective to introduce multiple quality classes. When a user requests a content, a table of several combinations of the delivery time and the price is shown to the user, and the service class is chosen by the user appropriately. It becomes possible to decrease the load at peak usage hours efficiently, and to use the resource of off-peak hours effectively. In this paper, although the case of a single link model is examined, how to extend the proposed system to multiple link model and its effect are also shown. Furthermore, even if there is an error between the traffic pattern predicted for setting price and the actual traffic pattern, the proposed method is effective.

    CiNii

  • Evaluation of Link Aggregation by Duplication and Unification of Packets for TCP Traffic

    SONODA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    IEICE technical report. Information networks   103 ( 692 ) 171 - 174  2004.02

     View Summary

    With the rapid development of communication technology, we now have various kinds of access circuits for IP connection based on Ethernet (wired or wireless), cellular phone or PHS. Since each circuit is available at relatively low cost, it is easy to use multiple circuits simultaneously. But bit error rate of some circuits can be unacceptably high under bad conditions. In this paper, we propose a new link aggregation method called LADUP (Link Aggregation by Duplication and Unification of Packets) to achieve high TCP throughput with effective use of multiple circuits. The packets duplicated in LADUP depends on the quality related conditions of the circuits and they are defined as either only ACK packets or all the packets in this paper. The application conditions of these two alternatives are demonstrated based on their throughput evaluation results in burst and random packet loss models.

    CiNii

  • Network Design based on SmallWorld and its Performance Comparison

    SUZUKI Takashi, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report. Information networks   103 ( 692 ) 345 - 350  2004.02

     View Summary

    SmallWorld that represents human behaviour and psychology is widely noticed. As telecommunication networks are used by human beings, SmallWorld topology will be effective for them. This paper studies the network design method using SmallWorld. First, a new topology design method is proposed. Then, the performance is compared with other topologies. It is shown that the design method using SmallWorld is effective.

    CiNii

  • Traffic Control with User's Service Selection for Contents Delivery

    YAGI Noriyuki, TAKAHASHI Eiji, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report. Information networks   103 ( 692 ) 373 - 376  2004.02

     View Summary

    To cope with the congestion generated by intensive demand of large size contents delivery, it will be effective to introduce multiple quality classes. When a user requests a content, a table of several combinations of the delivery time and the price is shown to the user, and the service class is chosen by the user appropriately. It becomes possible to decrease the load at peak usage hours efficiently, and to use the resource of off-peak hours effectively. In this paper, although the case of a single link model is examined, how to extend the proposed system to multiple link model and its effect are also shown. Furthermore, even if there is an error between the traffic pattern predicted for setting price and the actual traffic pattern, the proposed method is effective.

    CiNii

  • 帯域保証サービスにおける最適料金設定法(セッション2)

    伊藤博礼, 矢守恭子, 田中良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   103 ( 689 ) 85 - 88  2004.02

     View Summary

    近年,インターネツトでは品質を確保したサービスの必要性が高まってきており,優先制御を用いて複数クラスのサービスを提供する差別化サービスが検討されている.差別化サービスを提供する場合,品質をどの程度確保したらよいのか,またその料金をどのように設定すればよいのかが問題となる.そこで本稿では,支払い意思額に基づくユーザ行動を用いたISP収入最大化のための最適料金設定法について検討する.

    CiNii

  • Optimum Pricing Methods for Guaranteed Bandwidth Service

    ITO Hiroyuki, YAMORI Kyoko, TANAKA Yoshiaki

    IEICE technical report. Information networks   103 ( 691 ) 85 - 88  2004.02

     View Summary

    In recent years, the necessity of quality guaranteed services is increasing in the Internet. The differentiated services, which have multiple classes using priority control, are being introduced. To offer the differentiated services, we should know what quality is needed and what price is appropriate. In this paper, the user based optimum pricing method is shown for maximizing the revenue of ISP by using the willingness to pay function.

    CiNii

  • Effects of Maximum Bandwidth on the Relation between Minimum Guaranteed Bandwidth and Willingness to Pay

    HIRAYAMA Jun, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   103 ( 662 ) 23 - 26  2004.02

     View Summary

    To offer the differentiated services, which have multiple classes using priority control, we should know what quality is needed and what price is appropriate. And, the willingness to pay would change according to the maximum bandwidth which can be used during non-busy period, even if the minimum guaranteed bandwidth is fixed. This paper shows the effect of the maximum bandwidth on the relation between the minimum guaranteed bandwidth and the willingness to pay of differentiated services, by subjective evaluation experiment and questionnaire survey.

    CiNii

  • Effects of Maximum Bandwidth on the Relation between Minimum Guaranteed Bandwidth and Willingness to Pay

    HIRAYAMA Jun, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   103 ( 660 ) 23 - 26  2004.02

     View Summary

    To offer the differentiated services, which have multiple classes using priority control, we should know what quality is needed and what price is appropriate. And, the willingness to pay would change according to the maximum bandwidth which can be used during non-busy period, even if the minimum guaranteed bandwidth is fixed. This paper shows the effect of the maximum bandwidth on the relation between the minimum guaranteed bandwidth and the willingness to pay of differentiated services, by subjective evaluation experiment and questionnaire survey.

    CiNii

  • An Intelligent State-Dependent Routing Scheme for Multicast Traffic

    PHAM VAN Tien, TANAKA Yoshiaki

      103 ( 506 ) 17 - 20  2003.12

     View Summary

    This study introduces Reinforcement Learning (RL) to solve the problem of Call Admission Control (CAC) and Routing for multicast connections in networks serving multiple service classes. The network system is trained to find out the optimal control policy that brings up the highest amount of reward in long-run. For a manageable solution and realizable training time, decomposition is carried out. To demonstrate the prominence of RL-based routing against MOSPF (Multicast extension to Open Shortest Path First) protocol, which is a routing protocol with high performance among available ones, we consider different criteria, including reward rate and call drop rate in simulations.

    CiNii

  • An Intelligent State-Dependent Routing Scheme for Multicast Traffic

    PHAM VAN Tien, TANAKA Yoshiaki

      103 ( 508 ) 17 - 20  2003.12

     View Summary

    This study introduces Reinforcement Learning (RL) to solve the problem of Call Admission Control (CAC) and Routing for multicast connections in networks serving multiple service classes. The network system is trained to find out the optimal control policy that brings up the highest amount of reward in long-run. For a manageable solution and realizable training time, decomposition is carried out. To demonstrate the prominence of RL-based routing against MOSPF (Multicast extension to Open Shortest Path First) protocol, which is a routing protocol with high performance among available ones, we consider different criteria, including reward rate and call drop rate in simulations.

    CiNii

  • ネットワーク管理におけるエンドツーエンド測定とMIBデータ収集の比較

    ザニケエフ マラット, 田中 良明

    電子情報通信学会技術研究報告. CQ, コミュニケーションクオリティ   103 ( 445 ) 131 - 136  2003.11

    CiNii

  • ネットワーク管理におけるエンドツーエンド測定とMIBデータ収集の比較(NW性能管理,品質とコスト,品質と感性,一般)

    ザニケエフマラット, 田中良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   103 ( 447 ) 131 - 136  2003.11

     View Summary

    ネットワーク管理は,従来,ネットワークの状態監視や障害処理に限定されたものであった.しかし,現在は,要求が多様化して,ネットワーク内のさまざまなパラメータの監視が必要となり,またそれはルーチング機能などとも関わってくるようになってきている.SNMPは極めて単純にできており,メーカが工場で製造する段階でルータに組み込むことができる標準化された限られたMIBのリストを利用している.しかしながら,SNMPでは,MIBの遠隔監視(RMON)において,大量の監視トラヒックが生じ,また集めた情報を集中処理することがボトルネックになることもある.このような問題は,MIBに基づく監視を行うことにより生ずるものである.そこで,エンドツーエンドでの動的な測定により必要な情報を得る方法があり得る.この方法を用いれば,MIBを用いる方法と比べて,トラヒックが減少して問題点が解決し,より柔軟にネットワークのオペレーションや管理を行える可能性がある.本稿は,その可能性の検討を行ったものである.

    CiNii

  • ネットワーク管理におけるエンドツーエンド測定とMIBデータ収集の比較(NW性能管理,品質とコスト,品質と感性,一般)

    ザニケエフマラット, 田中良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   103 ( 443 ) 131 - 136  2003.11

     View Summary

    ネットワーク管理は,従来,ネットワークの状態監視や障害処理に限定されたものであった.しかし,現在は,要求が多様化して,ネットワーク内のさまざまなパラメータの監視が必要となり,またそれはルーチング機能などとも関わってくるようになってきている.SNMPは極めて単純にできており,メーカが工場で製造する段階でルータに組み込むことができる標準化された限られたMIBのリストを利用している.しかしながら,SNMPでは,MIBの遠隔監視(RMON)において,大量の監視トラヒックが生じ,また集めた情報を集中処理することがボトルネックになることもある.このような問題は,MIBに基づく監視を行うことにより生ずるものである.そこで,エンドツーエンドでの動的な測定により必要な情報を得る方法があり得る.この方法を用いれば,MIBを用いる方法と比べて,トラヒックが減少して問題点が解決し,より柔軟にネットワークのオペレーションや管理を行える可能性がある.本稿は,その可能性の検討を行ったものである.

    CiNii

  • End-to-End Measurements versus MIB-based Data Pulling

    ZHANIKEEV Marat, TANAKA Yoshiaki

    Technical report of IEICE. CQ   103 ( 445 ) 131 - 136  2003.11

     View Summary

    Network management has been only for network troubleshooting and status-reading. Requirements evolved and now management is in very close relation with monitoring of various parameters in the network, including its core routing functionality. SNMP was devised to be extremely simple, with a limited standardized list of MIBs that vendors can implement in routers at the factory. However, due to the nature of SNMP that did not change its operation since the emergence of remote monitoring MIBs (RMON), monitoring produces considerable traffic, and bottleneck both in the network and at processing center. There is a possibility that low performance of MIB-based monitoring can be improved by stand-alone end-to-end active measurement, that will cause little overhead, offer much more flexible control over operation, and can serve as a basis for creating intelligent event-driven management. This paper looks studies this possibility.

    CiNii

  • 差別化サービスの最低保証帯域と支払い意思額の関係(NW性能管理,品質とコスト,品質と感性,一般)

    平山純, 矢守恭子, 田中良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   103 ( 446 ) 17 - 20  2003.11

     View Summary

    近年,インターネットでは品質を確保したサービスの必要性が高まってきており,優先制御を用いて複数クラスのサービスを提供する差別化サービスが検討されている.差別化サービスを提供する場合,品質をどの程度確保したらよいのか,またその料金をどのように設定すればよいのかが問題となる.本稿では,ストリーミング配信用コンテンツを使用した主観評価実験と,ダウンロードの待ち時間を提示したアンケート調査により,差別化サービスにおける最低保証帯域とその帯域に対する支払い意思額の関係を求めている.

    CiNii

  • Relation between Guaranteed Minimum Bandwidth of Differentiated Services and Willingness to Pay

    HIRAYAMA Jun, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   103 ( 442 ) 17 - 20  2003.11

     View Summary

    In recent years, the necessity of quality guaranteed services is increasing in the Internet. The differentiated services, which have multiple classes using priority control, are being introduced. To offer the differentiated services, we should know what quality is needed and what price is appropriate. In this paper, the quantitative relation between the guaranteed minimum bandwidth and the willingness to pay is shown by the subjective experiment of streaming contents and by the questionnaire survey of the waiting time for download.

    CiNii

  • Relation between Guaranteed Minimum Bandwidth of Differentiated Services and Willingness to Pay

    HIRAYAMA Jun, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   103 ( 444 ) 17 - 20  2003.11

     View Summary

    In recent years, the necessity of quality guaranteed services is increasing in the Internet. The differentiated services, which have multiple classes using priority control, are being introduced. To offer the differentiated services, we should know what quality is needed and what price is appropriate. In this paper, the quantitative relation between the guaranteed minimum bandwidth and the willingness to pay is shown by the subjective experiment of streaming contents and by the questionnaire survey of the waiting time for download.

    CiNii

  • TCPの効率的な転送を可能とするレイヤ2重複転送アグリゲーション方式

    園田 隆史, 中村 文隆, 若原 恭, 田中 良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   103 ( 388 ) 9 - 12  2003.10

    CiNii

  • Mobile IPv6における学習形拡張バインディングキャッシュ方式

    松原 大典, 田中 良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   103 ( 388 ) 37 - 40  2003.10

    CiNii

  • Efficient Layer 2 Duplicate Transfer Aggregation for TCP Traffic

    SONODA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    IEICE technical report   103 ( 386 ) 9 - 12  2003.10

     View Summary

    In recent years, various kinds of circuits such as wired LAN, wireless LAN, cellular phone and PHS have become available due to the rapid development of communication technology. Since there is such a large choice of circuits, multiple communication circuits can be used simultaneously easily. The objective of this paper is to propose and study a method to transfer duplicated data packets through multiple physical circuits of various quality in order to construct high throughput and robust network system.

    CiNii

  • Extended Binding Cache Scheme with Learning for Mobile IPv6

    MATSUBARA Daisuke, TANAKA Yoshiaki

    IEICE technical report   103 ( 386 ) 37 - 40  2003.10

     View Summary

    In Mobile IPv6, the binding cache is updated by the binding update sent by the mobile node. The binding update is sent to the home agent and the present correspondent node. Most correspondent nodes do not know the care of address of the mobile node before starting communication. Therefore, most correspondent nodes have to send the packets to the home agent of the mobile node at first. This paper proposes to extend the binding cache function. In the proposed scheme, the mobile node sends the binding update to the home agent, and the home agent re-sends it to some agents which the mobile node often communicates with. By this, most correspondent nodes do not have to send the packets to the home agent at first, and they can send the packets directly to the care of address of the mobile node. Then, the delay of the first packet decreases, and it is fit for delay critical services such as VoIP.

    CiNii

  • スモールワールドに基づくマルチキャスト通信網構成法

    鈴木 貴士, 三好 匠, 田中 良明

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   103 ( 365 ) 73 - 78  2003.10

    CiNii

  • Multicast Network Design Method Based on SmallWorld

    SUZUKI Takashi, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report. Information networks   103 ( 365 ) 73 - 78  2003.10

     View Summary

    Multicast is going to be popular as a multipoint communication mechanism for effective transmission of network traffic. However, conventional telecommunication networks are not suited for multicast since it is supposed that only unicast traffic is transmitted. It is therefore important to consider multicast network design. On the other hand, SmallWorld that represents human behaviour and psychology is widely noticed. As telecommunication networks are used by people, SmallWorld topology will be effective for them. This paper examines the costs for network construction in case where SmallWorld is applied to the future network that supports both multicast and unicast traffic.

    CiNii

  • Maximizing Users' Utility for Data Transfer with Priority Control

    YAMORI Kyoko, TANAKA Yoshiaki

    The Transactions of the Institute of Electronics, Information and Communication Engineers B   86 ( 10 ) 2041 - 2052  2003.10

    CiNii

  • Confirmation Protocol for Circulating Notice

    OKAMOTO Manabu, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2003   142 - 142  2003.09

    CiNii

  • Efficient Contents Delivery Control by Dynamic Pricing

    YAGI Noriyuki, TAKAHASHI Eiji, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2003 ( 2 ) 10 - 10  2003.09

    CiNii

  • Effective Evaluation Method for Multicast Routing Trees

    MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2003 ( 2 ) 22 - 22  2003.09

    CiNii

  • MobileIPv6 Routing with Extended Binding Cache System

    MATSUBARA Daisuke, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2003 ( 2 ) 51 - 51  2003.09

    CiNii

  • Analysis of Willingness to Pay of Guaranteed Minimum Bandwidth Service

    HIRAYAMA Jun, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2003 ( 2 ) 440 - 440  2003.09

    CiNii

  • Delay-Constrained Grouping Method on Hierarchical Routing

    ATSUMI Akiyoshi, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2003 ( 2 ) 489 - 489  2003.09

    CiNii

  • B-14-9 VoIP の階層化 CAC 方式

    呂岩, 田中良明

    電子情報通信学会ソサイエティ大会講演論文集   2003 ( 2 )  2003.09

    CiNii

  • Efficient Layer 2 Duplicate Transfer Aggregation for TCP Traffic

    SONODA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2003 ( 2 ) "S - 7"-"S-8"  2003.09

    CiNii

  • コンテンツ属性を用いた多クラス優先制御配信の効用最大化(CQセッション1)(モバイルビデオ,QoS制御,サービス品質,一般)

    富田健, 矢守恭子, 田中良明

    電子情報通信学会技術研究報告. MoMuC, モバイルマルチメディア通信   103 ( 291 ) 11 - 14  2003.08

     View Summary

    コンテンツ配信において,その効用は待ち時間に対し非線形に減少する.また,コンテンツ取得までの待ち時間に対するユーザ効用は,コンテンツの属性に応じて異なると予想される.本稿では,待ち時間感度の違うコンテンツを配信した場合の多クラス優先制御によるユーザ効用の最大化について検討する.

    CiNii

  • Maximizing Utility of Multi-Class Priority-Controlled Contents Delivery Considering their Attributes

    TOMITA Takeru, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   103 ( 289 ) 11 - 14  2003.08

     View Summary

    In the contents delivery service, the user's utility depends on the waiting time to get the contents. According to the former studies, the utility decreases nonlinearly in accordance with the increase of the waiting time. In the contents delivery network, various kinds of contents are delivered, and they have various attributes. The decreasing rate of the utility against the increase of the waiting time will depend on the content attribute. In this paper, a multi-class priority control based on the waiting time sensitivity is proposed in order to make the total users' utility maximum.

    CiNii

  • [奨励論文]焼きなまし法による光波長ルーチングネットワーク論理トポロジー再構築手法(有線無線シームレス,モバイルネットワーキング,Mobile IP,無線通信,ネットワーク制御,一般)

    徐蘇鋼, 小山修宏, 田中良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   103 ( 202 ) 45 - 48  2003.07

     View Summary

    本稿は,光波長ルーチングネットワークにおける論理トポロジーの再構築手法について検討を行っている.動的に変化するトラヒックに対して,現時点でのトラヒックに大きな混乱を与えないような論理トポロジーの再構築が必要とされている.頻繁に再構築が行われる際,より短時間で論理トポロジーを設計する必要がある.多くの場合混合整数線形計画法から得ることができるが,厳密に論理トポロジーを形成すれば,ネットワークが大きくなるにつれて急速に計算量が増大し,計算処理は困難になる.そこで,メタヒューリスティック手法を用いて,より少ない計算回数で論理トポロジー構築を行う高速焼きなまし手法を提案している.

    CiNii

  • Adaptive Contents Delivery Protocol Considering Link Capacities

    TETSUHASHI Hideaki, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. RCS   103 ( 202 ) 49 - 52  2003.07

     View Summary

    Multicast communication is a remarkable technology that can substantially decrease network traffic and can save network resources and transmission costs. In multicasting, the transmission speed must be set to the lowest one among the available capacities of links in the multicast tree. This characteristic increases the data transmission time, and accordingly the content could not be delivered efficiently. We have studied an adaptive delivery system to dynamically select multicasting and store- and-forward transferring. This system was proved as an effective system in best-effort networks. This paper proposes the implementation methods of the adaptive content delivery system fit for the Internet considering the current IP multicast routing protocol.

    CiNii

  • 優先制御コンテンツ配信における動的料金設定の効果(有線無線シームレス,モバイルネットワーキング,Mobile IP,無線通信,ネットワーク制御,一般)

    八木規行, 高橋英士, 矢守恭子, 田中良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   103 ( 202 ) 53 - 56  2003.07

     View Summary

    コンテンツ配信ネットワークでは,大容量コンテンツの配信時に,集中的な輻輳が発生することが予想される.本稿では,この問題に対処する方法として,配信待ち時間に関して複数品質クラスを設け,料金に差を付ける方式について検討している.料金は優先度に応じて設定し,更にピーク時には各クラスの料金をより高くする.特に,優先度の高いクラスの料金は低いクラスよりも大きく上げる.ユーザに,必要の度合いに応じて適切に品質クラスを選択させることで,ピーク時の負荷をオフピーク時に誘導し,一日のトラヒックを平準化することが可能となる.本稿では,ユーザの効用の観点からこのシステムの効果を評価している.

    CiNii

  • A Fast Logical Topology Reconfiguration Method with Simulated Annealing in Wavelength Routed Optical Networks

    XU Sugang, KOYAMA Nobuhiro, TANAKA Yoshiaki

    Technical report of IEICE. RCS   103 ( 204 ) 45 - 48  2003.07

     View Summary

    WDM optical networks represent the direction to the future high capacity wide-area network applications. By creating the optical paths between several nodes in the core networks, logical topology can be created over the physical topology. Reconfiguration of logical topology is necessary for efficient network resource utilization due to the changing traffic. Fast logical topology reconfigurations will be needed to keep up with the traffic pattern changing. At the first place, a fast logical topology design algorithm is necessary to find an optimal or near optimal solution in a short time. In this paper we consider the method of designing logical topology in wavelength routed IP networks when reconfiguration is needed. The exact formulation of the logical topology design problem is usually given as a Mixed Integer Linear Programming, but it grows intractable with increasing size of network. Metaheuristic approaches have been proposed, here we propose a different simulated annealing approach to determine better logical topology within shorter time period, and compare it with other methods.

    CiNii

  • Adaptive Contents Delivery Protocol Considering Link Capacities

    TETSUHASHI Hideaki, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. RCS   103 ( 204 ) 49 - 52  2003.07

     View Summary

    Multicast communication is a remarkable technology that can substantially decrease network traffic and can save network resources and transmission costs. In multicasting, the transmission speed must be set to the lowest one among the available capacities of links in the multicast tree. This characteristic increases the data transmission time, and accordingly the content could not be delivered efficiently. We have studied an adaptive delivery system to dynamically select multicasting and store- and-forward transferring. This system was proved as an effective system in best-effort networks. This paper proposes the implementation methods of the adaptive content delivery system fit for the Internet considering the current IP multicast routing protocol.

    CiNii

  • Effectiveness of Dynamic Pricing in Priority Controled Contents Delivery

    YAGI Noriyuki, TAKAHASHI Eiji, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. RCS   103 ( 204 ) 53 - 56  2003.07

     View Summary

    In contents delivery networks, the traffic of large-size contents will cause heavy congestion especially at peak usage hours. One method to cope with this problem is to use a time-dependent multi-class tariff. The price of high priority class is high, and that of low priority class is low. At peak usage hours, the prices will be higher, especially the price of high priority class will be much higher. This leads users to off-peak usage hours, and the traffic of the day will be smoothed. This paper evaluates the effectiveness of this system from the viewpoint of users' utility.

    CiNii

  • Proposal of Service-Adaptive Selection Method for Multiple Transport Networks and Its Evaluation

    KAGIYAMA Wataru, MIYOSHI Takumi, TANAKA Yoshiaki, YASUDA Yasuhiko

    Technical report of IEICE. TM   103 ( 180 ) 7 - 12  2003.07

     View Summary

    Everything over IP, the concept on which all types of traffic are sent using the Internet Protocol, has been advancing to our lives. Considering the increase of the future traffic and the expansion of its required bandwidth, however, it is inefficient to divide information into many small IP packets. It is thus more desirable for users to choose various transport networks according to the provided services. This paper proposes a new network architecture that supports both the packet-switched network and the circuit-switched network for the next generation networks and evaluates its performance.

    CiNii

  • Analysis of Willingness To Pay of Guaranteed Bandwidth Service with Flat Rate Pricing

    ITO Hiroyuki, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. CQ   103 ( 178 ) 29 - 32  2003.07

     View Summary

    In recent years, the communication network environment has changed dramatically. Many carriers are beginning to offer various new communication services, besides conventional services. One of the most attractive services is the differentiated QoS service with multiple priority control. In this paper, assuming the guaranteed bandwidth service with flat rate pricing, the quantitative relation between the guaranteed bandwidth and the user's willingness to pay is analysed. From the questionnaire survey, the relationship between the quality and the user's willingness to pay is obtained. Using the least squares method, the relationship between the quality and the willingness to pay is estimated. Finally, the factors that affect willingness to pay are shown by using the methods of regression analysis and quantification theory I.

    CiNii

  • Effective Bandwidth Allocation Mechanism by Using Generalized Vickrey Auction

    TAKAHASHI Eiji, TANAKA Yoshiaki

    The Transactions of the Institute of Electronics, Information and Communication Engineers B   86 ( 7 ) 1268 - 1277  2003.07

    CiNii

  • Multicast Contents Delivery-Interval versus Users' Utility

    KAJITA Takehiro, TAKAHASHI Eiji, TANAKA Yoshiaki, YASUDA Yasuhiko

    IEICE technical report   103 ( 122 ) 53 - 56  2003.06

     View Summary

    Multicast technology is expected to become widely used, since its link sharing capability makes it well suited to large size contents delivery services. In multicast contents delivery services, the waiting time of users will decrease if the contents delivery interval becomes shorter, However, if the contents delivery interval is too short, links will be congested and the waiting time of users will increase. The user's utility on a contents download service depends on the waiting time: the time between his request for the content and the completion of its download. This paper describes how to set the delivery intervals adaptively from the viewpoint of the sun total of users' utility. It is shown that there is an aptimal value of the ocntents delivery interval.

    CiNii

  • Routing Group Management with Traffic Impact on Hierarchical Routing

    ATSUMI Akiyoshi, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. TM   103 ( 42 ) 7 - 12  2003.05

     View Summary

    With the rapid growth of the computer network, it is becoming difficult for routers to handle growing amount of routing data. Hierarchical Routing is one of the solutions to this problem. In the hierarchical routing, all nodes are divided into groups in which each node holds simplified data. As the result of simplification, however, it is more difficult for each node to recognize detailed network topology and to select efficient route. Thus, there exists a trade-off relationship between simplification of routing data and its efficiency. In addition, hierarchical grouping of nodes should include consideration of traffic on each link. This paper proposes grouping management method that introduces traffic information into the process of creation of a set of evaluated hierarchical routing groups. The method allows to greatly reduce the size of routing data while keeping low average delay in the network.

    CiNii

  • Bandwidth Allocation in Consideration of Resource Utilization and Users'Utility

    TAKAHASHI Eiji, TANAKA Yoshiaki

    IEICE technical report   103 ( 9 ) 9 - 12  2003.04

     View Summary

    Auctions have been proposed and applied to perform resource allocation in reservation-based networks. The methods proposed by these works perceive resources as single items with multiple units and place importance on a limited efficiency inside each node. However, a user does not evaluate each required resource one by one, but evaluates a whole set of required resources. Therefore, the economical efficiency of the overall network cannot be achieved by these methods. To solve this problem, we propose a bandwidth allocation system using Generalized Vickrey Auction. Network resources, which are composed of many links at various bandwidths, are regarded by the proposed method as multiple items with multiple units. We evaluate the efficiency of the proposed method from the viewpoints of the resource utilization and users' utility.

    CiNii

  • Anonymous Exchange Protocol

    OKAMOTO Manabu, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003   174 - 174  2003.03

    CiNii

  • Wavelength Assignment Method for Optical Packet Switching Ring Networks

    HIRAYAMA Jun, XU Su gang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 2 - 2  2003.03

    CiNii

  • Utility Quantification for a Charge Setup of Differentiated Services

    ITO Hiroyuki, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 35 - 35  2003.03

    CiNii

  • Logical Topology Design of WDM Optical Network by Swap Method

    KOYAMA Nobuhiro, XU Su gang, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 60 - 60  2003.03

    CiNii

  • Adaptive Contents Delivery Protocol on the Internet

    TETSUHASHI Hideaki, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 75 - 75  2003.03

    CiNii

  • Multicast Contents Delivery Scheduling in Consideration of Users' Utility

    KAJITA Takehiro, TAKAHASHI Eiji, TANAKA Yoshiaki, YASUDA Yasuhiko

    Proceedings of the IEICE General Conference   2003 ( 2 ) 76 - 76  2003.03

    CiNii

  • Multicast Network Design Based on SmallWorld

    SUZUKI Takashi, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 77 - 77  2003.03

    CiNii

  • Differential Multicast Pricing by Divided Group

    OHARA Takaaki, TAKAHASHI Eiji, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 78 - 78  2003.03

    CiNii

  • Rerouting Algorithm for Dynamic Multicast in Stratospheric Platform Networks

    KAWADA Hiroyuki, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 83 - 83  2003.03

    CiNii

  • Traffic-based Optimization of Grouping Configuration on Hierarchical Routing

    ATSUMI Akiyoshi, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 96 - 96  2003.03

    CiNii

  • Bandwidth Allocation Method in Consideration of Users' Valuation

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 115 - 115  2003.03

    CiNii

  • Dynamic Priority Control Algorithm for Video Streaming Distribution

    NOMURA Kazutomo, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 120 - 120  2003.03

    CiNii

  • Maximizing Utility of Multi-Contents Delivery Considering their Attributes

    TOMITA Takeru, YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 174 - 174  2003.03

    CiNii

  • Contents Delivery Priority Control by the Use of Pricing

    YAGI Noriyuki, YAMORI Kyoko, TAKAHASHI Eiji, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 175 - 175  2003.03

    CiNii

  • Dynamic Link Aggregation with Variable Quality Circuits

    SONODA Takashi, NAKAMURA Fumitaka, WAKAHARA Yasushi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 204 - 204  2003.03

    CiNii

  • An Efficient MobileIPv6 Routing with Expansion of Binding Cache Function

    MATSUBARA Daisuke, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) 215 - 215  2003.03

    CiNii

  • Relation between Content Attribute and Utility for Delivery Waiting Time

    YAMORI Kyoko, NOMURA Kazutomo, TOMITA Takeru, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2003 ( 2 ) "S - 37"-"S-38"  2003.03

    CiNii

  • 波長ルーチング光ネットワークにおける論理トポロジー再構築法

    徐蘇鋼, 瀬崎薫, 田中良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   102 ( 647 ) 17 - 20  2003.02

     View Summary

    波長ルーチング光ネットワークでは,適切な論理トポロジー設計方法を用いると,遅延を軽減し,ネットワークのスループットを向上させることができる.また,動的に変化するトラヒックに対して,現時点でのトラヒックに大きな混乱を与えないような論理トポロジーの再構築が必要とされている.理想的な論理トポロジーは,多くの場合混合整数線形計画法から得ることができるが,これはネットワークサイズが大きくなるにつれて急速に計算量が増大し,計算不能に陥る.本稿では,ヒューリスティック手法を提案し,論理トポロジーの性能向上と再構築の際のオペレーションの低減を目指している.

    CiNii

  • Rerouting Algorithm for Dynamic Multicast in Stratospheric Platform Networks

    KAWADA Hiroyuki, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. OCS   102 ( 647 ) 25 - 28  2003.02

     View Summary

    Stratospheric platform (SPF) networks can realize efficient multicast service by utilizing multiple address function or inter-links among SPFs. Conventional multicast routing algorithms, however, cannot efficiently operate in SPF networks owing to high cost of multicast trees, much consumption of network resource, or underutilizing the SPF's characteristics. We have developed a new multicast routing algorithm for SPF networks. The algorithm periodically reroutes the multicast trees in each SPF's coverage area. We also evaluated the proposed algorithm. The results show that the proposed algorithm can operate more effeciently than conventional algorithms in SPF networks.

    CiNii

  • Reward-Maximized CAC and Routing for Multi-Point Connections

    TIEN PHAM VAN, TANAKA Yoshiaki

    Technical report of IEICE. OCS   102 ( 647 ) 29 - 32  2003.02

     View Summary

    This study introduces Reinforcement Learning (RL) to solve call admission control and routing problem for multi-point connections in networks serving multiple service classes. It presents a model formulating the CAC (Call Admission Control) and Routing as a problem of control, then decomposition is implemented to make the solution manageable. Finally, simulation results demonstrate the prominence of RL-based routing in comparison to MOSPF (Multicast extension to Open Shortest Path First) protocol.

    CiNii

  • ストリーミング配信におけるパケット優先度動的変更方式

    野村一智, 矢守恭子, 田中良明

    電子情報通信学会技術研究報告. NS, ネットワークシステム   102 ( 647 ) 37 - 40  2003.02

     View Summary

    近年,動画像のストリーミング再生が広く行われるようになってきたが,幅輳によりその安定した再生が困難になる場合がある.そこで,ストリーミング配信に優先制御を適用し,受信バッファ内のパケット数の多寡によりパケット優先度を動的に変更する方式を提案している.この方式を用いることにより,網の幅輳状況にかかわらず品質の高い配信が行えることをシミュレーションにより明らかにしている,

    CiNii

  • Logical Topology Reconfiguration Method in Wavelength Routed Optical Networks

    XU Sugang, SEZAKI Kaoru, TANAKA Yoshiaki

    Technical report of IEICE. OCS   102 ( 649 ) 17 - 20  2003.02

     View Summary

    In this paper, we consider the method of logical topology reconfiguration in wavelength routed optical networks. The exact formulation of the logical topology problem grows intractable with increasing size of network. Here we proposed a heuristic approach to determine the logical topology reconfiguration with small logical topology changes.

    CiNii

  • Rerouting Algorithm for Dynamic Multicast in Stratospheric Platform Networks

    KAWADA Hiroyuki, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. OCS   102 ( 649 ) 25 - 28  2003.02

     View Summary

    Stratospheric platform (SPF) networks can realize efficient multicast service by utilizing multiple address function or inter-links among SPFs. Conventional multicast routing algorithms, however, cannot efficiently operate in SPF networks owing to high cost of multicast trees, much consumption of network resource, or underutilizing the SPF's characteristics. We have developed a new multicast routing algorithm for SPF networks. The algorithm periodically reroutes the multicast trees in each SPF's coverage area. We also evaluated the proposed algorithm. The results show that the proposed algorithm can operate more effeciently than conventional algorithms in SPF networks.

    CiNii

  • Reward-Maximized CAC and Routing for Multi-Point Connections

    TIEN PHAM VAN, TANAKA Yoshiaki

    Technical report of IEICE. OCS   102 ( 649 ) 29 - 32  2003.02

     View Summary

    This study introduces Reinforcement Learning (RL) to solve call admission control and routing problem for multi-point connections in networks serving multiple service classes. It presents a model formulating the CAC (Call Admission Control) and Routing as a problem of control, then decomposition is implemented to make the solution manageable. Finally, simulation results demonstrate the prominence of RL-based routing in comparison to MOSPF (Multicast extension to Open Shortest Path First) protocol.

    CiNii

  • Dynamic Priority Control Algorithm for Video Streaming Distribution

    NOMURA Kazutomo, YAMORI Kyoko, TANAKA Yoshiaki

    Technical report of IEICE. OCS   102 ( 649 ) 37 - 40  2003.02

     View Summary

    In video streaming distribution services, the video streams often lose the smoothness because of network congestion. In this paper, an effective algorithm to keep the smoothness is proposed. In this algorithm, the priority of packets is dynamically changed according to the number of packets in a receiving buffer. The computer simulation shows the proposed algorithm is effective.

    CiNii

  • A Dynamic Load Balancing Method Considering Fairness in Core Networks

    TAKEDA Tomonori, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    The Transactions of the Institute of Electronics,Information and Communication Engineers B   86 ( 2 ) 174 - 186  2003.02

    CiNii

  • Optimal Multicast Pricing Based on Users' Behaviour

    OHARA Takaaki, TAKAHASHI Eiji, TANAKA Yoshiaki

    IEICE technical report. Information networks   102 ( 563 ) 25 - 29  2003.01

     View Summary

    Multicast technology is expected to become widely used, since its link sharing capability makes it well suited to broadband streaming services. However, multicast services have not become popular. One of the main reasons for the unpopularity of multicast is the lack of a good business model and effective pricing mechanism, as the cost structure of network usage is quite different from that of unicast services. This paper discusses optimal multicast pricing mechanism which maximizes the sender's profits or the networks carrier's profits, when each users behave only to maximize their own benefits. Then, the optimal multicast pricing method is analyzed by computer simulation, which shows the effectiveness of the method.

    CiNii

  • Optimal Multicast Pricing Based on Users' Behaviour

    OHARA Takaaki, TAKAHASHI Eiji, TANAKA Yoshiaki

    IEICE technical report. Information networks   102 ( 565 ) 25 - 29  2003.01

     View Summary

    Multicast technology is expected to become widely used, since its link sharing capability makes it well suited to broadband streaming services. However, multicast services have not become popular. One of the main reasons for the unpopularity of multicast is the lack of a good business model and effective pricing mechanism, as the cost structure of network usage is quite different from that of unicast services. This paper discusses optimal multicast pricing mechanism which maximizes the sender's profits or the networks carrier's profits, when each users behave only to maximize their own benefits. Then, the optimal multicast pricing method is analyzed by computer simulation, which shows the effectiveness of the method.

    CiNii

  • Optimal Multicast Pricing Based on Users' Behaviour

    OHARA Takaaki, TAKAHASHI Eiji, TANAKA Yoshiaki

    IEICE technical report. Information networks   102 ( 561 ) 25 - 29  2003.01

     View Summary

    Multicast technology is expected to become widely used, since its link sharing capability makes it well suited to broadband streaming services. However, multicast services have not become popular. One of the main reasons for the unpopularity of multicast is the lack of a good business model and effective pricing mechanism, as the cost structure of network usage is quite different from that of unicast services. This paper discusses optimal multicast pricing mechanism which maximizes the sender's profits or the networks carrier's profits, when each users behave only to maximize their own benefits. Then, the optimal multicast pricing method is analyzed by computer simulation, which shows the effectiveness of the method.

    CiNii

  • Dynamic Estimation of Bottleneck Bandwidth

    ZHANIKEEV Marat, TANAKA Yoshiaki

    Technical report of IEICE. PS   102 ( 514 ) 37 - 40  2002.12

     View Summary

    The demand for the QoS in the Internet, growing heterogeneity of networks, development of more complex routing protocols, various network-based multimedia applications, require knowledge of the bandwidth to be able to operate. Routing devices and protocols are devised with the requirement of prompt forwarding of packets and cannot bear the overhead of including bandwidth information in headers or perform any extra operations with it. Therefore, probing is required to learn of the bottlenecks along a defined path. We defined a dynamic method that probes a path to learn of its bottleneck bandwidth and strives to impose no extra overhead by changing probing parameters, such as packet size and probing frequency. Simulated results are studied and compared with other major works in the field.

    CiNii

  • Dynamic Estimation of Bottleneck Bandwidth

    ZHANIKEEV Marat, TANAKA Yoshiaki

    Technical report of IEICE. PS   102 ( 512 ) 37 - 40  2002.12

     View Summary

    The demand for the QoS in the Internet, growing heterogeneity of networks, development of more complex routing protocols, various network-based multimedia applications, require knowledge of the bandwidth to be able to operate. Routing devices and protocols are devised with the requirement of prompt forwarding of packets and cannot bear the overhead of including bandwidth information in headers or perform any extra operations with it. Therefore, probing is required to learn of the bottlenecks along a defined path. We defined a dynamic method that probes a path to learn of its bottleneck bandwidth and strives to impose no extra overhead by changing probing parameters, such as packet size and probing frequency. Simulated results are studied and compared with other major works in the field.

    CiNii

  • 配信待ち時間と効用の関係におけるコンテンツ属性の主要因分析

    矢守恭子, 野村一智, 富田健, 田中良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   102 ( 462 ) 49 - 52  2002.11

     View Summary

    コンテンツ配信において,データ取得までの待ち時間の増加に伴ないユーザ効用は減少する.また,効用の減少の割合はコンテンツの属性に応じて異なると考えられる.そこで,本研究では配信するコンテンツの属性と待ち時間の関係をアンケート調査より明らかにする.そして,効用の変化の主要因となるコンテンツ属性を示す.

    CiNii

  • Key Factor Analysis of a Contents Attribute in the Relation between Waiting Time and Utility

    YAMORI Kyoko, NOMURA Kazutomo, TOMITA Takeru, TANAKA Yoshiaki

    Technical report of IEICE. CQ   102 ( 458 ) 49 - 52  2002.11

     View Summary

    In contents delivery service, user utility decreases with the increase in waiting time to get the contents data. The decreasing rate of utility differs according to the contents attribute. In this paper, the relation between the contents attribute and the waiting time to get the contents is clarified by the questionnaire, and the attribute used as the key factor of change of utility is shown.

    CiNii

  • Key Factor Analysis of a Contents Attribute in the Relation between Waiting Time and Utility

    YAMORI Kyoko, NOMURA Kazutomo, TOMITA Takeru, TANAKA Yoshiaki

    Technical report of IEICE. CQ   102 ( 460 ) 49 - 52  2002.11

     View Summary

    In contents delivery service, user utility decreases with the increase in waiting time to get the contents data. The decreasing rate of utility differs according to the contents attribute. In this paper, the relation between the contents attribute and the waiting time to get the contents is clarified by the questionnaire, and the attribute used as the key factor of change of utility is shown.

    CiNii

  • Electronic Voting Schemes Using Anonymous Distribution of Encrypted PIN Numbers

    OKAMOTO Manabu, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2002   140 - 140  2002.08

    CiNii

  • A Configuration of Ultra High Speed Router Using SFQ Banyan Network

    YOSHIOKA Hirotaka, TANAKA Yoshiaki

    Technical report of IEICE. RCS   102 ( 202 ) 63 - 66  2002.07

     View Summary

    SFQ(Single Flux Quantum) technology has been improved, and various logic circuits using SFQ can be made. Ultra high speed packet switching can be done by using SFQ logic circuits. This paper proposes an architecture of ultra high speed router using SFQ banyan network. This system can deal with variable length IP packets without any additional processing. The performance of banyan network is compared with a simple VOQ (Virtual Output Queuing) packet switch by computer simulation. As a result, the banyan network is more efficient than the simple VOQ.

    CiNii

  • A Configuration of Ultra High Speed Router Using SFQ Banyan Network

    YOSHIOKA Hirotaka, TANAKA Yoshiaki

    Technical report of IEICE. RCS   102 ( 205 ) 63 - 66  2002.07

     View Summary

    SFQ(Single Flux Quantum) technology has been improved, and various logic circuits using SFQ can be made. Ultra high speed packet switching can be done by using SFQ logic circuits. This paper proposes an architecture of ultra high speed router using SFQ banyan network. This system can deal with variable length IP packets without any additional processing. The performance of banyan network is compared with a simple VOQ (Virtual Output Queuing) packet switch by computer simulation. As a result, the banyan network is more efficient than the simple VOQ.

    CiNii

  • Pricing Method for Multicast Streaming Services

    OHARA Takaaki, TAKAHASHI Eiji, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   102 ( 130 ) 35 - 38  2002.06

     View Summary

    Variable kinds of services are expected by a realization of the broadband network. In future, the service which transmit large data is going to increase. Therefore, multicast technology, which ensures the network resource and decrease the transmission cost, is expected. Therefore, pricing is one of the issues for a realization of these services. In multicast, users share the telecommunication links. The question is how the charge of users reflects the fee for the link usage. In this paper, we define multicast cost sharing methods and disucuss the cost shared among users in a multicast-type streaming services.

    CiNii

  • Optimal Grouping Method on Hierarchical Routing for Reduction of Routing Database

    ATSUMI Akiyoshi, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. TM   102 ( 74 ) 41 - 46  2002.05

     View Summary

    The computer network is growing rapidly, and is going to be very large. Because of this growth, some problems loomed up. They are too much information for routing, excessive flow of the control traffic, etc. Hierarchical routing is one of the methods to solve the problem of too much routing information. In the hierarchical routing, all nodes are divided into some groups which compose a logical network, and each logical node has simplified information for routing. Simplifying information, however, makes it difficult that each node recognizes the whole network topology and selects the efficient route. Accordingly, the simplification of information and the efficient routing have a trade-off relationship. Therefore, this paper focuses on the grouping methods, and the optimal grouping methods for the hierarchical routing are proposed.

    CiNii

  • Pricing Control for Scheduling in Contents Delivery Networks

    YAGI Noriyuki, YAMORI Kyoko, TAKAHASHI Eiji, TANAKA Yoshiaki

    IEICE technical report   102 ( 19 ) 21 - 24  2002.04

     View Summary

    In contents delivery networks (CDN), contents often have large-size data. Such large data causes heavy congestion in the network. Traffic load can be balanced by users' choosing priority classes with accordance of a price table, which shows contents delivery time and price list reflecting network conditions. This paper proposes a traffic load balancing method to show the price table and a scheduling algorithm for completely sending the contents by the promised delivery time.

    CiNii

  • リライアブルマルチキャストを考慮したマルチキャストネットワーク階層構成

    伊藤準, 三好匠, 田中良明

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   101 ( 717 ) 215 - 220  2002.03

     View Summary

    近い将来,マルチキャスト通信がネットワークトラヒックのかなりの部分を占めると考えられる.現在,インターネット上においてもIPマルチキャストの利用が始まっているが,これはIPと同様にベストエフォート形プロトコルであり,パケット損失の通知,再送,及びパケットの順序保証などの信頼性は保証されていない.IPマルチキャストだけでなく,将来のマルチキャスト通信においても,信頼性の保証は重要な課題となる.そのため,多くのリライアブルマルチキャストプロトコルが提案されている.本稿では,リライアブルマルチキャストにおける再送方式に着目している.これらのプロトコルは,ネットワークトポロジーによって性能が異なると考えられる.そこで,基本的なネットワークトポロジーを組み合わせた階層構成ネットワークにおいて,再送パケットを含めたトラヒック量に基づくネットワーク構成コストによる比較を行うことで,各再送方式を用いた場合の性能評価を行う.

    CiNii

  • Hierarchically Structured Network for Multicast Communication Considering Reliable Multicast Protocols

    ITO Jun, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   101 ( 715 ) 215 - 220  2002.03

     View Summary

    Multicast communication will occupy large proportion of the network traffic in the near future. IP multicast has begun to be used on the present Internet. It is a best-effort-type protocol similar to IP and cannot guarantee the packet loss notification, retransmission, and ordered packet delivery. Guaranteeing such reliabilities is a problem to be solved not only on IP multicast but also on the future multicast network. For that purpose, many reliable multicast protocols have been proposed. Several ways of retransmissions for implementing reliable multicast mechanisms, using unicast or multicast, have already been applied. This paper focuses on the retransmission methods for reliable multicasting. The characteristics of these methods will depend on the network. This paper discusses the suitable retransmission methods on hierarchically structured networks by comparing network costs based on traffic volume including retransmission packets.

    CiNii

  • Anonymous Distribution by Homomorphic Encrypt System

    OKAMOTO Manabu, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2002   211 - 211  2002.03

    CiNii

  • B-6-4 一般化ビックレイオークションを用いた通信リソース配分方式

    高橋英士, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-16 専用線料金変動を考慮したロバスト企業網設計

    毛利景正, 三好匠, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-69 階層化ルーチングにおける最適グループ構成法

    渥美章佳, 三好匠, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-125 セルラIPにおけるマルチゲートウェイサポートアルゴリズムの提案

    西田克利, 田中良明, 淺谷耕一, 富永英義

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-141 2.4GHz無線回線とバックアップ有線回線の効率的切換えの一方式

    園田隆史, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-164 コンテンツ配信における伝送コスト当たりの効用

    矢守恭子, 田中良明, 秋丸春夫

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-165 動的料金設定によるコンテンツ配信トラヒック制御

    八木規行, 矢守恭子, 高橋英士, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-173 受信状況に応じたマルチキャストツリー構築法

    坂野啓一, 三好匠, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-174 マルチキャストツリー評価手法の提案

    三好匠, 矢守恭子, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-177 成層圏プラットホームにおける階層符号化マルチキャスト ビデオ配信のためのルーチングアルゴリズム

    河田浩行, 三好匠, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-180 ランダムネットワークにおけるリライアブルマルチキャスト再送方式の比較

    伊藤準, 三好匠, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-184 マルチキャストサービスにおける料金設定法

    小原孝昭, 高橋英士, 三好匠, 田中良明

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • B-6-187 光パケットスイッチングの波長選択によるサービス品質差別化

    可児島隆, 田中良明, 淺谷耕一, 富永英義

    電子情報通信学会総合大会講演論文集   2002 ( 2 )  2002.03

    CiNii

  • Management of Enterprise Network Configuration Considering Diverse Tariff Structures

    MOURI Kagemasa, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. TM   101 ( 705 ) 25 - 30  2002.03

     View Summary

    Tariff structures for leased line services have been drastically changing, and this aspect will have strong influence on topological policies to design enterprise networks. Otis effective to construct the enterprise networks in consideration of diverse tariff structures in the future. This paper studies the robust enterprise networks, with simulated annealing, against diverse tariff structures considering the future trend. The obtained results show that the best topology at the gravity center in the area of the predicted cost parameters is the most robust topology against those tariff structures.

    CiNii

  • Bandwidth Allocation Using the Number of Receivers in IP Multicast

    MIYAUCHI Masahisa, TANAKA Yoshiaki, ASATANI Koichi, TOMINAGA Hideyoshi

    IEICE technical report. Information networks   101 ( 639 ) 17 - 24  2002.02

     View Summary

    Recently, the Internet is used not only for conventional applications such as Web and E-mail, but also for new applications such as network meeting and contents delivery. IP multicast is studied for such demands from various points of view. However, IP multicast is not popular now. It is pointed out that there is no incentive to use IP multicast for receivers. In the present IP multicast, unicast packets and multicast packets are treated equally in routers. However, multicast packets should be more weighted than unicast packets, because multicast packets are sent to many receivers. The aim of this study is to improve the characteristics of packet loss and delay in a whole network by performing the control according to the number of receivers of a packet, and to increase the incentive to use IP multicast for receivers. For this control, it is necessary that each router knows the number of receivers of a packet and allocates the bandwidth according to the number of receivers. This paper proposes IP multicast protocol that the router can know the number of receivers, and the bandwidth allocation method using the number of receivers. The simulation results show the good performance of this method.

    CiNii

  • Gateway Load Balancing Algorithm in Robust Mobile Network with Cellular IP

    NISHIDA Katsutoshi, TANAKA Yoshiaki, ASATANI Koichi, TOMINAGA Hideyoshi

    Technical report of IEICE. OFC   101 ( 561 ) 39 - 44  2002.01

     View Summary

    Recently, IP micoro mobility protocols, such as Hierarchical Mobile IP or CellularIP, have been discussed in the IETF Mobile IP Working Group. However, these protocols are designed for environments where the network is a simple tree structure and only one gateway is deployed. Therefore, when we implement these protocols into real mobile networks which have multiple gateways, we need to add a function which can support a load barancing algorithm for multipule gateways to increase credibility against impediments of the network and reduce delay of packet arrival. In this article, we focus on Cellular IP and propose a load balancing algorithm for robust mobile networks which have multiple gateways. Also, we show simulation results and confirm our proposed method is effective.

    CiNii

  • Gateway Load Balancing Algorithm in Robust Mobile Network with Cellular IP

    NISHIDA Katsutoshi, TANAKA Yoshiaki, ASATANI Koichi, TOMINAGA Hideyoshi

    Technical report of IEICE. OFC   101 ( 559 ) 39 - 44  2002.01

     View Summary

    Recently, IP micoro mobility protocols, such as Hierarchical Mobile IP or CellularIP, have been discussed in the IETF Mobile IP Working Group. However, these protocols are designed for environments where the network is a simple tree structure and only one gateway is deployed. Therefore, when we implement these protocols into real mobile networks which have multiple gateways, we need to add a function which can support a load barancing algorithm for multipule gateways to increase credibility against impediments of the network and reduce delay of packet arrival. In this article, we focus on Cellular IP and propose a load balancing algorithm for robust mobile networks which have multiple gateways. Also, we show simulation results and confirm our proposed method is effective.

    CiNii

  • Gateway Load Balancing Algorithm in Robust Mobile Network with Cellular IP

    NISHIDA Katsutoshi, TANAKA Yoshiaki, ASATANI Koichi, TOMINAGA Hideyoshi

    Technical report of IEICE. OFC   101 ( 563 ) 39 - 44  2002.01

     View Summary

    Recently, IP micoro mobility protocols, such as Hierarchical Mobile IP or CellularIP, have been discussed in the IETF Mobile IP Working Group. However, these protocols are designed for environments where the network is a simple tree structure and only one gateway is deployed. Therefore, when we implement these protocols into real mobile networks which have multiple gateways, we need to add a function which can support a load barancing algorithm for multipule gateways to increase credibility against impediments of the network and reduce delay of packet arrival. In this article, we focus on Cellular IP and propose a load balancing algorithm for robust mobile networks which have multiple gateways. Also, we show simulation results and confirm our proposed method is effective.

    CiNii

  • Differentiated Selective Wavelength Scheme for Optical Packet Switching

    KANISHIMA Ryu, TANAKA Yoshiaki, ASATANI Koichi, TOMINAGA Hideyoshi

    IEICE technical report   101 ( 508 ) 55 - 60  2001.12

     View Summary

    In a packet network, contentions occur at a switching node, which might cause packet blocking. Previous works on optical packet switching adopted optical delay lines, deflection routing, or wavelength conversion to resolve contention, but they have problems. This paper proposes a new contention resolution scheme that resolves contention by selecting a wavelength of a packet at the edge node, and a new differentiated service scheme that is based on Selective Wavelength Scheme. Their performance level is analyzed by simulation. It is shown that the proposed differentiated selective wavelength scheme is an effective scheme for resolving contention and differentiated service.

    CiNii

  • 光パケットスイッチングにおける差別化波長選択方式

    可児島隆, 田中良明, 淺谷耕一, 富永英義

    電子情報通信学会技術研究報告. PS, 光スイッチング   101 ( 510 ) 55 - 60  2001.12

     View Summary

    光パケットスイッチングでは, スイッチノードにおいて競合が起こり, パケットが廃棄されてしまうという問題がある.遅延線や波長変換装置を用いた方式や迂回ルーチングを行うなどの競合回避方法が従来検討されているが, それらには問題点もある.そこで, 送信ノードで光パケットに対する波長を選択することによって競合回避を行う方式を検討し, 更に波長選択によりサービスクラスごとに品質の差別化を行う差別化波長選択方式を提案する.シミュレーションによる評価により, 差別化波長選択方式が競合回避や品質の差別化に有効であることを示す.

    CiNii

  • User's Behaviour and Efficiency in Bid-based Bandwidth Allocation Method

    TAKAHASHI Eiji, TANAKA Yoshiaki

    IEICE technical report. Information networks   101 ( 492 ) 73 - 79  2001.12

     View Summary

    Network resources, which are composed of many links at various bandwidth, can be regarded as multiple items with multiple units. Auctions are known as an effective approach for allocating multiple items with multiple units. Therefore auctions have been proposed and applied to perform contract negotiation and resource allocation in reservation-based networks. However, users' behaviours strongly affect the results of auctions in their efficiency. This paper considers the effectiveness of bandwidth allocation systems by using simultaneous one-round auctions from the viewpoint of users' behaviours.

    CiNii

  • コンテンツ配信の優先制御クラス数と最適料金設定法

    矢守恭子, 田中良明, 秋丸春夫

    電子情報通信学会技術研究報告. NS, ネットワークシステム   101 ( 442 ) 59 - 64  2001.11

     View Summary

    コンテンツ配信において, 優先度に応じた料金を設定するサービスが考えられる.本稿では, 複数クラスを設けた場合の優先制御における効用と料金に着目した.効用の測度として支払意思額(Willingness to Pay:WTP)を用い, ユーザ全体の効用最大化と通信事業者の収入最大化の最適条件について検討する.また, 複数クラスを設けた場合の各クラスのトラヒックと待ち時間の最適値を示し, 最適な優先クラス数について考察する.

    CiNii

  • コンテンツ配信の優先制御クラス数と最適料金設定法

    矢守恭子, 田中良明, 秋丸春夫

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   101 ( 446 ) 59 - 64  2001.11

     View Summary

    コンテンツ配信において, 優先度に応じた料金を設定するサービスが考えられる.本稿では, 複数クラスを設けた場合の優先制御における効用と料金に着目した.効用の測度として支払意思額(Willingness to Pay:WTP)を用い, ユーザ全体の効用最大化と通信事業者の収入最大化の最適条件について検討する.また, 複数クラスを設けた場合の各クラスのトラヒックと待ち時間の最適値を示し, 最適な優先クラス数について考察する.

    CiNii

  • Priority Classes and Optimum Pricing for Contents Delivery Systems

    YAMORI Kyoko, TANAKA Yoshiaki, AKIMARU Haruo

    Technical report of IEICE. CQ   101 ( 444 ) 59 - 64  2001.11

     View Summary

    For contents delivery systems, the service is considered in which the price depends on each priority class. This paper deals with the multiple priority classes of the contents delivery system from the viewpoint of the utility and pricing. The willingness-to-pay (WTP) is introduced as a measure of utility, which is regarded as the price, and the optimum condition is analyzed to maximize the user's utility as well as the provider's revenue. For the system with multiple priority classes, the optimum condition is given in terms of the traffic load, waiting time for service and price for each priority class. The optimum number of priority classes is also discussed.

    CiNii

  • Retransmission Methods for Reliable Multicast versus Network Topologies

    ITO Jun, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   101 ( 355 ) 1 - 6  2001.10

     View Summary

    Reliable multicast has got much attention as a technology on information delivery systems for the next generation. It guarantees information deliveries without errors on the large-scale multicasting. Several ways of retransmissions for implementing reliable multicast mechanisms, using unicast, multicast, and subcast, have already been proposed. Their characteristics will be changed according to network topologies. This paper focuses on the relation between retransmission method of reliabel multicast and network topology. Namely, this paper discusses the suitable combination of a network topology and a retransmission method by comparing network cost based on traffic volume including retransmission packets.

    CiNii

  • Optimal Design of Enterprise Networks with Non-linear Cost Functions

    MOURI Kagemasa, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   101 ( 355 ) 25 - 30  2001.10

     View Summary

    Rapid technological growth is bringing about price reductions of network components and drastic change of the tariff structures for leased line services. The tariff structure of leased line service has become non-linear cost function for distance and capacity. This paper studies the optimal method to minimize the whole enterprise network cost considering topological connectivity and routing for non-linear cost functions.

    CiNii

  • A Secret Ballot System Using Card Distribution

    OKAMOTO Manabu, TANAKA Yoshiaki

    Technical report of IEICE. ISEC   101 ( 311 ) 111 - 116  2001.09

     View Summary

    In electronic ballot, there are problems of security, such as double votes, alterations of votes, etc. In addition, the organization to add up the votes may leak the result unfairly during its operation. Some methods to prevent them have already been proposed. However, in these methods, voters have to do troublesome operations, or two or more organizations to add up the votes are necessary. In this paper, a new system is proposed. The election administration committee creates the cards that show the PIN numbers, and distributes them to voters randomly and anonymously. The voter submits the card corresponding to the candidate, whom he wants to vote.

    CiNii

  • Robust Enterprise Network Design with Simulated Annealing

    MOURI Kagemasa, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 90 - 90  2001.08

    CiNii

  • Multicast Network Topology Versus Local Recovery Performance

    ITO Jun, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 91 - 91  2001.08

    CiNii

  • IP Multicast Considering the Number of Receivers

    MIYAUCHI Masahisa, TANAKA Yoshiaki, ASATANI Koichi, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 92 - 92  2001.08

    CiNii

  • Introduction of Numerical Suitability for Multicast Routing Tree According to Multicast Group

    MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 93 - 93  2001.08

    CiNii

  • Selective Wavelength Method for Contention Resolution in Optical Packet Switching

    KANISHIMA Ryu, TANAKA Yoshiaki, ASATANI Koichi, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 123 - 123  2001.08

    CiNii

  • A Study on Application of Cellular IP to Robust Mobile Networks

    NISHIDA Katsutoshi, TANAKA Yoshiaki, ASATAN Koichi, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 160 - 160  2001.08

    CiNii

  • Influence of Users' Behaviour in BandWidth Allocation Method Based on Users' Bidding

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 178 - 178  2001.08

    CiNii

  • Contents Delivery with Priority Control Considering Utility and Request Rate

    YAMORI Kyoko, TANAKA Yoshiaki, AKIMARU Haruo

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 527 - 528  2001.08

    CiNii

  • Subjective Evaluation Experiment of Waiting Time versus Utility and Priority Control Based on its Results

    NOMURA Kazutomo, YAMORI Kyoko, TAKAHASHI Eiji, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2001 ( 2 ) 529 - 530  2001.08

    CiNii

  • Electronic Voting Schemes with Distribution of PIN Numbers

    OKAMOTO Manabu, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2001   157 - 157  2001.08

    CiNii

  • Waiting Time versus Utility to Download Images and its Application to Priority Control

    NOMURA Kazutomo, YAMORI Kyoko, TAKAHASHI Eiji, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. RCS   101 ( 194 ) 63 - 68  2001.07

     View Summary

    In the contents delivery network, its utility depends on the waiting time. This paper deals with the priority control of the contents delivery network from the viewpoint of utility. First, the subjective evaluation experiment of image download is done to obtain the relation between the waiting time and the utility. From the results, the function of utility versus the waiting time is estimated. Then, this function is applied to the optimization of priority control of the image delivery system. This system has two classes, and it is analyzed by using computer simulation. The ratio of high priority packets to low priority packets is changed as a parameter, and the total utility of all users is maximized. It is shown that the total utility of two class system can be higher than that of one class system.

    CiNii

  • Waiting Time versus Utility to Download Images and its Application to Priority Control

    NOMURA Kazutomo, YAMORI Kyoko, TAKAHASHI Eiji, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. RCS   101 ( 196 ) 63 - 68  2001.07

     View Summary

    In the contents delivery network, its utility depends on the waiting time. This paper deals with the priority control of the contents delivery network from the viewpoint of utility. First, the subjective evaluation experiment of image download is done to obtain the relation between the waiting time and the utility. From the results, the function of utility versus the waiting time is estimated. Then, this function is applied to the optimization of priority control of the image delivery system. This system has two classes, and it is analyzed by using computer simulation. The ratio of high priority packets to low priority packets is changed as a parameter, and the total utility of all users is maximized. It is shown that the total utility of two class system can be higher than that of one class system.

    CiNii

  • Pricing Method for Contents Delivery with Priority Considering Request Rate

    YAMORI Kyoko, TANAKA Yoshiaki, AKIMARU Haruo

    IEICE technical report   101 ( 120 ) 31 - 36  2001.06

     View Summary

    For data delivery systems with priority classes, an optimum design has been proposed to maximize the utility of the users. As a result, it has been shown that there exist optimum ratios of priority and non-priority traffic and the waiting times [1]. In this paper, we use the willingness to pay(WTP) as a measure of utility, and examine the optimum design to propose the optimum pricing methods. The optimum condition for the service grade (waiting time for service) and pricing for priority and non-priority classes is discussed, considering the request rate which is constant and varying with the utility.

    CiNii

  • Network Extension Method Considering Increase of Multicast Traffic

    MIYOSHI Takumi, TANAKA Yoshiaki, SEZAKI Kaoru

    The Transactions of the Institute of Electronics,Information and Communication Engineers B   84 ( 6 ) 1010 - 1024  2001.06

    CiNii

  • Optimal Grouping Method on Hierarchical Routing

    ATSUMI Akiyoshi, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   101 ( 74 ) 25 - 30  2001.05

     View Summary

    The computer network is growing rapidly, and is going to be very large. Because of this growth, some problems loomed up. They are too much information for routing, excessive flow of the control traffic, etc. Hierarchical routing is one method to deal with the problem of information for routing easily. This paper proposes the optimal grouping method on hierarchical routing.

    CiNii

  • Cost Share Methods for Multicast Service and Probability Distribution of Shared Cost

    OHARA Takaaki, TAKAHASHI Eiji, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report   101 ( 9 ) 25 - 30  2001.04

     View Summary

    Multicast service is going to be important in the telecommunication networks. To offer the multicast service to users, its price must be decided. In multicast, users share the telecommunication links. Therefore, users have to share the telecommunication cost. This paper considers the cost share methods, and calculates the probability distribution of the shared cost.

    CiNii

  • Characteristic Evaluation of Optimal Enterprise Networks against Diverse Tariff Structures

    MIYOSHI Takumi, MOURI Kagemasa, TANAKA Yoshiaki

    Technical report of IEICE. SSE   100 ( 671 ) 41 - 48  2001.03

     View Summary

    Most companies are constructing enterprise networks between a head office and local branches using leased lines or VPN. The cost structure of leased lines will drastically change in the near future, because of rapid developments in high-speed optical fibers, and the competition among telecommunication operating companies. This paper evaluates the characteristics of optimal enterprise network topologies when the tariff structures change with satisfying some relations.

    CiNii

  • Characteristic Evaluation of Optimal Enterprise Networks against Diverse Tariff Structures

    MIYOSHI Takumi, MOURI Kagemasa, TANAKA Yoshiaki

    Technical report of IEICE. SSE   100 ( 669 ) 41 - 48  2001.03

     View Summary

    Most companies are constructing enterprise networks between a head office and local branches using leased lines or VPN. The cost structure of leased lines will drastically change in the near future, because of rapid developments in high-speed optical fibers, and the competition among telecommunication operating companies. This paper evaluates the characteristics of optimal enterprise network topologies when the tariff structures change with satisfying some relations.

    CiNii

  • Utility Maximization of the Packet Transmission with Priority

    NOMURA Kazutomo, TAKAHASHI Eiji, YAMORI Kyoko, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2001 ( 2 ) 20 - 20  2001.03

    CiNii

  • Bandwidth Allocation Method to Protect Fairness in the Dynamic Routing Network

    TAKEDA Tomonori, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   2001 ( 2 ) 32 - 32  2001.03

    CiNii

  • Multicast Network Topology Suitable for Local Recovery

    ITO Jun, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2001 ( 2 ) 40 - 40  2001.03

    CiNii

  • Cost Allocation Methond for Multicast Service

    OHARA Takaaki, TAKAHASHI Eiji, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2001 ( 2 ) 43 - 43  2001.03

    CiNii

  • Delay-Constrained Dynamic Multicast Routing Algorithm Link using Modified Cost

    MASHIMO Naoyuki, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2001 ( 2 ) 44 - 44  2001.03

    CiNii

  • Multicast Routing Algorithm for Transcoded Stream

    MIYOSHI Takumi, ASAKA Takuya, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2001 ( 2 ) 45 - 45  2001.03

    CiNii

  • Optimal Grouping Method on Hierarchical Routing

    ATSUMI Akiyoshi, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2001 ( 2 ) 49 - 49  2001.03

    CiNii

  • Study of Pricing Methods for Realizing Effective Allocation of Network Resources

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2001 ( 2 ) 53 - 53  2001.03

    CiNii

  • Optimization of Robust Enterprise Networks against Diverse Tariff Structures

    MOURI Kagemasa, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2001 ( 2 ) 470 - 470  2001.03

    CiNii

  • A Study on Contents Delivery System Model with Priority from the Viewpoint of Delay

    YAMORI Kyoko, TANAKA Yoshiaki, AKIMARU Haruo

    Proceedings of the IEICE General Conference   2001 ( 2 ) 695 - 696  2001.03

    CiNii

  • 一般化ビックレイオークションによる通信帯域配分法の提案とその特性評価

    高橋英士, 田中良明

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   100 ( 537 ) 19 - 24  2001.01

     View Summary

    複数のリンクから構成され、様々な品質が提供される通信ネットワークにおいてユーザーに配分される通信リソースは、複数種類・複数単位の財であると考えることができる.複数種類・複数単位の財の割り当てを決定する効率的な方式として、一般化ビックレイオークション(GVA:Generalized Vickrey Auction)が知られている.本稿では、専用線の販売・リセールやエンドユーザに対する帯域割当形サービス等を想定し、通信帯域を割り当てる方式としてGVAの適用を考え、シミュレーションによる他の方式との比較評価を通してその適用効果を明確にする.

    CiNii

  • 一般化ビックレイオークションによる通信帯域配分法の提案とその特性評価

    高橋英士, 田中良明

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   100 ( 535 ) 19 - 24  2001.01

     View Summary

    複数のリンクから構成され, 様々な品質が提供される通信ネットワークにおいてユーザに配分される通信リソースは, 複数種類・複数単位の財であると考えることができる.複数種類・複数単位の財の割り当てを決定する効率的な方式として, 一般化ビックレイオークション(GVA:Generalized Vickrey Auction)が知られている.本稿では, 専用線の販売・リセールやエンドユーザに対する帯域割当形サービス等を想定し, 通信帯域を割り当てる方式としてGVAの適用を考え, シミュレーションによる他の方式との比較評価を通してその適用効果を明確にする.

    CiNii

  • A Proposal and an Analysis of Bandwidth Allocation by Using Generalized Vickrey Auction

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Technical report of IEICE. OFC   100 ( 539 ) 19 - 24  2001.01

     View Summary

    Network resources, which are composed from many links and qualities of services, can be regarded as multiple items, multiple units. Generalized Vickrey auction is known as an effective auction protocol for allocating multiple items, multiple units. This paper proposes the bandwidth allocation system by using generalized Vickrey auction. The system can be used for selling lines, reselling lines, or allocating bandwidth dynamically to users. The effectiveness of the proposed system is also shown with numerical results using the computer simulation.

    CiNii

  • 優先制御コンテンツ配信方式の料金設定法

    矢守恭子, 田中良明, 秋丸春夫

    電子情報通信学会技術研究報告. PS, 光スイッチング   100 ( 498 ) 13 - 18  2000.12

     View Summary

    コンテンツ配信サービスにおいて, 優先制御を行うことによって, 待ち時間が異なる複数クラスを設けるサービスが考えられる.待ち時間が小さいクラスは高い料金に, 待ち時間が大きいクラスは低い料金になる.本稿では, 配信方式としてストリーミング方式とダウンロード方式の2方式を取り上げ, また, サービスクラス数は簡単のため2クラスとして, コンテンツ配信の効用と料金について検討している.ユーザの効用の測度として, 支払い意思額(Willingness to Pay)を導入した.その結果, ユーザ全体の効用の和を最大にする優先トラヒック・普通トラヒックの割合が存在することを示している.また, それに基いて, 優先クラス, 普通クラスの各々の料金を適切に設定する方法を示している.

    CiNii

  • A Proposal of Pricing Method for Contents Delivery

    YAMORI Kyoko, TANAKA Yoshiaki, AKIMARU Haruo

    Technical report of IEICE. SSE   100 ( 496 ) 13 - 18  2000.12

     View Summary

    For data delivery systems such as video-on-demand service, an optimum design is presented to maximize the utility of the system with priority and ordinary classes. The willingness-to-pay is introduced for a measure of utility, and the optimum design is discussed for the streaming and download schemes. The optimum condition is given in terms of the traffic load, waiting time for service and tariff for the priority and ordinary classes.

    CiNii

  • Performance Comparison of Backbone Routing on Fairness in the Dynamic Environment

    TAKEDA Tomonori, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   100 ( 393 ) 1 - 6  2000.10

     View Summary

    The objective of this study is to distribute the bandwidth in a fair manner in the backbone network. Traffic is aggregated between ingress and egress edge nodes, and aggregated traffic is given fair share of bandwidth as much as possible. We first apply several routing schemes when exisiting path information is available. Next, the situation when only the residual capacity is available is considered. In this case, precomputed paths are introduced to restrict the degree of unfairness caused by lack of information.

    CiNii

  • A Proposal of Pricing Method Contents Delivery

    YAMORI Kyoko, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   2000 ( 2 ) 27 - 27  2000.09

    CiNii

  • A Study on Backbone Network Routing Considering Fairness

    TAKEDA Tomonori, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   2000 ( 2 ) 136 - 136  2000.09

    CiNii

  • SSE2000-85 / RCS2000-74 衛生地上統合網における動的マルチキャスト用リルーチング方式

    河田浩行, 朝香卓也, 三好匠, 田中良明

    電子情報通信学会技術研究報告. SSE, 交換システム   100 ( 193 ) 13 - 18  2000.07

     View Summary

    衛星と地上ネットワークが混在するネットワークでは、衛星の同報性を利用することにより効率的なマルチキャストサービスを実現することが可能となる.しかし, 従来のマルチキャストルーチングアルゴリズムを衛星地上統合ネットワークに適用すると, 計算量, 制御トラヒック量, ツリーコストが大きくなるという問題があった.そこで, 本稿では, ネットワークをいくつかのグループに分け, グループごとに周期的にリルーチングする方式を提案する.また, その特性を評価し, 衛星地上統合ネットワークにおいて提案アルゴリズムが従来アルゴリズムよりも有効に働くことを示す.

    CiNii

  • Rerouting Algorithm for Dynamic Multicast in Satellite-Terrestrial Networks

    KAWADA Hiroyuki, ASAKA Takuya, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. RCS   100 ( 195 ) 13 - 18  2000.07

     View Summary

    Satellite-terrestrial (ST) networks can realize efficient multicast service, in which satellites can interconnect many terrestrial nodes-that is, a multiple address function. Conventional multicast routing algorithms, however, cannot efficiently operate in ST networks because of much computational compelexity, traffic load for controlling networks, and high cost of multicast trees. We have developed a new multicast routing algorithm for ST networks. The algorithm divides all of terrestrial nodes into some groups, and periodically reroutes the multicast trees in each group. We also evaluated the proposed algorithm. The result shows that the proposed algorithm can operate more effeciently than conventional algorithms in ST networks.

    CiNii

  • Multicast Routing with Predetermined Path Search for Layered Streams

    MIYOSHI Takumi, ASAKA Takuya, TANAKA Yoshiaki

    Technical report of IEICE. SSE   100 ( 153 ) 31 - 36  2000.06

     View Summary

    The layered coding is one of the remarkable technologies to use network resources efficiently because each receiver can select only a certain number of layers allowed by its communication environment constraints. With conventional dynamic routing algorithms in multicasting the layered streams, many query messages are required in a distributed environment, or an efficient multicast tree cannot be constructed. In this paper, we develop the conventional routing algorithm using predetermined path search, and propose a new effective algorithm for the layered streams. The obtained results show that the proposed algorithm is advantageous compared to conventional ones when nodes are added to or removed from the multicast group during steady-state simulation.

    CiNii

  • A Comparison of Network Cost for Reliable Multicast

    ITO Jun, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. SSE   100 ( 78 ) 31 - 36  2000.05

     View Summary

    Multicast is required with the rapid spread of the Internet. Particularly, reliable multicast, which gurantees the delivery of information, is required. Local recovery for reliable multicast is the method which can localize the influence of retransmissions by collecting nodes. This paper compares the network cost of several network topologies to find the most appropriate topology for reliable multicast with local recovery.

    CiNii

  • Robust Enterprise Networks against Diverse Tariff Structures

    MOURI Kagemasa, MIYOSHI Takumi, ASAKA Takuya, TANAKA Yoshiaki

    Tech. Rep. of IEICE   100 ( 15 ) 37 - 42  2000.04

     View Summary

    Rapid technological growth is bringing about price reductions in network components, and the tariff structures of leased line services have been changing drastically. Since most enterprise networks are constructed using leased line services, their effective configurations become very important issues. This paper analyzes the characteristics of enterprise network topologies when the tariff structure changes, and examines the topology that is robust against the diverse tariff structures. The obtained results lead us to important conclusions, which we will use as guidelines when we design enterprise networks.

    CiNii

  • Distributed Network Caching using Cache On the Route

    NISHIDA Katsutoshi, ASAKA Takuya, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   100 ( 15 ) 61 - 66  2000.04

     View Summary

    In the Internet Cache Protocol(ICP), which is a conventional cooperative method used between distributed cache servers, as the number of cache servers increase, the amount of excess data which is created by query messages also increases. Therefore, there is a problem of network traffic increase due to the usage of cache servers which are implemented with ICP. In this paper, to overcome this ploblem, we have developed a new scheme named Cache On the Route(COR), which uses the cache servers that are placed on the route to the original server. We also evaluated the proposed method on excess data amount and delay time to the client by simulation, and show that it is superior to the conventional method.

    CiNii

  • ATM Switching Network Separating Unicast and Multicast Cells for Transit Switching Systems

    KIRIYAMA Taichi, TAKEDA Tomonori, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   99 ( 677 ) 93 - 98  2000.03

     View Summary

    A new multicast ATM switching network separating unicast and multicast cells, is proposed. This switching network aims to decrease the number of switching elements by separating multicast cells and concentrating them. This switching network is applied to transit switching systems, and a new structure of concentrators and bus interfaces are proposed. As a result, switching elements are reduced, compared to the previous architecture while maintaining the cell loss probability at the same level.

    CiNii

  • Adaptive Contents Delivery System Using Multicast and Buffering

    MAEDA Takayuki, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   99 ( 677 ) 165 - 170  2000.03

     View Summary

    Multicast Protocol Can Realize Contents delivery services such as multimedeia package distribution with low costs. But, in a heterogeneous network, the transmission rate will be limited to the rate of the congested link. In this case, it is better to store the data in a buffer and to send it by unicast than to use a multicast protocol. this paper proposes a contents delivery system which is adaptive to the network states, and shows its perfomance.

    CiNii

  • ラベル付与による遅延時間制約付き動的マルチキャストルーチング

    朝香卓也, 三好匠, 田中良明

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   99 ( 677 ) 171 - 176  2000.03

     View Summary

    従来の遅延時間制約付き動的マルチキャストルーチングアルゴリズムでは, 生成されるツリーにループが発生したり, あるいはループの発生を防ぐためにノードからの新たな参加要求が拒否されてしまうという問題があった.本稿では, あらかじめ各ノードにQoSラベル値を付与し, そのQoSラベル値に基づいて接続すべきノードおよびパスを決定するラベルアルゴリズムを提案する.ラベルアルゴリズムでは, ソースから各ノードまでの遅延時間を制約値以下に抑え, ループ発生や参加要求拒否の発生も抑制することができ, かつ低コストのマルチキャストツリーを構成することができる.さらに, 本稿では, 提案アルゴリズムと従来のアルゴリズムをシミュレーションによって比較評価し, 提案アルゴリズムの有効性を示す.

    CiNii

  • ATM Switching Network Separating Unicast and Multicast Cells for Transit Switching Systems

    KIRIYAMA Taichi, TAKEDA Tomonori, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   99 ( 675 ) 93 - 98  2000.03

     View Summary

    A new multicast ATM switching network separating unicast and multicast cells, is proposed. This switching network aims to decrease the number of switching elements by separating multicast cells and concentrating them. This switching network is applied to transit switching systems, and a new structure of concentrators and bus interfaces are proposed. As a result, switching elements are reduced, compared to the previous architecture while maintaining the cell loss probability at the same level.

    CiNii

  • Adaptive Contents Delivery System Using Multicast and Buffering

    MAEDA Takayuki, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   99 ( 675 ) 165 - 170  2000.03

     View Summary

    Multicast Protocol Can Realize Contents delivery services such as multimedeia package distribution with low costs. But, in a heterogeneous network, the transmission rate will be limited to the rate of the congested link. In this case, it is better to store the data in a buffer and to send it by unicast than to use a multicast protocol. this paper proposes a contents delivery system which is adaptive to the network states, and shows its perfomance.

    CiNii

  • A New Algorithm for Delay-Constrained Dynamic Multicast Routing

    ASAKA Takuya, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. SSE   99 ( 675 ) 171 - 176  2000.03

     View Summary

    Many new multimedia applications involve dynamic multiple participants, have stringent source-to-end delay requirements, and consume large amounts of network resources. A conventional algorithm that allows "two coming paths", where nodes in a multicast tree transmit the several identical data flows, is therefore not practical. We have developed an algorithm for delay-constrained dynamic routing. This algorithm uses a QoS label to prevent the occurrence of "two coming paths", and can construct an efficient multicast tree for any traffic volume. The proposed algorithm was superior to conventional routing algorithms in terms of cost nodes were added to or removed from the multicast group during a steady-state simulation.

    CiNii

  • ATM Switching Network Separating Unicast and Multicast Cells for Transit Switching Systems

    KIRIYAMA Taichi, TAKEDA Tomonori, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   2000 ( 2 ) 7 - 7  2000.03

    CiNii

  • Influence of Tariff on Enterprise Network Configuration

    MOURI Kagemasa, MIYOSHI Takumi, ASAKA Takuya, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2000 ( 2 ) 103 - 103  2000.03

    CiNii

  • Application of Simulated Annealing to Multicast Network Design

    SHIMIZU Shintaro, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2000 ( 2 ) 131 - 131  2000.03

    CiNii

  • Labeling Algorithm for Delay Constrained Dynamic Multicast Routing

    ASAKA Takuya, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2000 ( 2 ) 132 - 132  2000.03

    CiNii

  • Rerouting Algorithm for Dynamic Multicast in Satellite-Terrestrial Networks

    KAWADA Hiroyuki, ASAKA Takuya, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2000 ( 2 ) 133 - 133  2000.03

    CiNii

  • Reliability Evaluation of Multicast Networks

    TAKASE Shinichi, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2000 ( 2 ) 139 - 139  2000.03

    CiNii

  • Network Design for Reliable Multicast

    ITO Jun, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2000 ( 2 ) 144 - 144  2000.03

    CiNii

  • Network Design Using Robust Multicast Tree

    MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2000 ( 2 ) 145 - 145  2000.03

    CiNii

  • Searching Method for the Cache On the Route in Distributed Network Caching

    NISHIDA Katsutoshi, ASAKA Takuya, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   2000 ( 2 ) 148 - 148  2000.03

    CiNii

  • Effectiveness of Dynamic Bandwidth Allocation in Backbone Networks

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   2000 ( 2 ) 159 - 159  2000.03

    CiNii

  • Least Delay Routing in Hierarchical Networks

    KANISHIMA Ryu, ASAKA Takuya, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   2000 ( 2 ) 199 - 199  2000.03

    CiNii

  • A Study on Server Allocation for Contents Delivery System

    MIYAUCHI Masahisa, MAEDA Takayuki, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   2000 ( 2 ) 207 - 207  2000.03

    CiNii

  • Performance of Adaptive Contents Delivery System Using Multicast and Buffering

    MAEDA Takayuki, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   2000 ( 2 ) 210 - 210  2000.03

    CiNii

  • オークションによる動的帯域割当サービスの提案とその特性評価

    高橋英士, 田中良明

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   99 ( 591 ) 31 - 36  2000.01

     View Summary

    一般に, ISP(Internet Service Provider)の網は帯域固定の専用線により構築されているが, ユーザの送出するトラヒック量は時間帯に応じて変化する.本稿では, ISPに対するオークションによる動的帯域割当サービスを提案し, その特性について検討している.第一種電気通信事業者がISP(Internet Service Provider)に対して(あるいは, 一次ISPが二次ISPに対して)オークションにより動的に帯域を割り当てれば, 各ISPはそれぞれのポリシーに従って帯域を確保し, 各ユーザはすべてのISPの接続料金と通信品質に関する情報から自分に最も適したISPを選択することができる.本稿では, 料金と通信品質で定義されるユーザの効用値を指標として, 提案する動的帯域割当サービスと従来の専用線サービスとの比較を行い, 提案するサービスモデルの有効性を示す.

    CiNii

  • Effectivenes of Auction Method in Dynamic Bandwidth Allocation Service

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Technical report of IEICE. OFC   99 ( 593 ) 31 - 36  2000.01

     View Summary

    In the leased circuit service, which is used by ISPs(Internet Service Providers), the bandwidth is fixed. However, the traffic changes dynamically. Therefore, we proposed the dynamic bandwidth allocation service using auction method. By using this method, backbone networks can be used effectively as each ISP may secure bandwidth according to their own policies. It is also expected that the Internet users can receive good services, as users may get all information about all ISPs, such as access fee, provided QoS, and select the congenial ISP among all ISPs according to those information. In this paper, we compare the dynamic bandwidth allocation service with leased circuit service by using users' utility to estimate effectiveness of the proposed method.

    CiNii

  • Effectivenes of Auction Method in Dynamic Bandwidth Allocation Service

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Technical report of IEICE. OFC   99 ( 595 ) 31 - 36  2000.01

     View Summary

    In the leased circuit service, which is used by ISPs(Internet Service Providers), the bandwidth is fixed. However, the traffic changes dynamically. Therefore, we proposed the dynamic bandwidth allocation service using auction method. By using this method, backbone networks can be used effectively as each ISP may secure bandwidth according to their own policies. It is also expected that the Internet users can receive good services, as users may get all information about all ISPs, such as access fee, provided QoS, and select the congenial ISP among all ISPs according to those information. In this paper, we compare the dynamic bandwidth allocation service with leased circuit service by using users' utility to estimate effectiveness of the proposed method.

    CiNii

  • Multicast Network Design by Overlay Method

    SHIMIZU Shintaro, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. SSE   99 ( 508 ) 19 - 24  1999.12

     View Summary

    The multicast connection is obviously different from the unicast one. The conventional network might degrade the quality of multicast services, and might raise the network construction costs. In this paper, the overlay method is proposed, and evaluated for the multicast network design. The results show that the topology designed by the overlay method, which excludes the complecated calculations, has lower cost than the Delta-Star topology. And, it is also shown that the topology obtained by the overlay method can be used as an initial solution of the heuristic design method, and that it reduces the number of iterations considerably.

    CiNii

  • Multicast Network Design by Overlay Method

    SHIMIZU Shintaro, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. SSE   99 ( 506 ) 19 - 24  1999.12

     View Summary

    The multicast connection is obviously different from the unicast one. The conventional network might degrade the quality of multicast services, and might raise the network construction costs. In this paper, the overlay method is proposed, and evaluated for the multicast network design. The results show that the topology designed by the overlay method, which excludes the complecated calculations, has lower cost than the Delta-Star topology. And, it is also shown that the topology obtained by the overlay method can be used as an initial solution of the heuristic design method, and that it reduces the number of iterations considerably.

    CiNii

  • Dynamic Multicast Routing using Predetermined Path Search

    ASAKA Takuya, MIYOSHI Takumi, TANAKA Yoshiaki

    IEICE technical report. Information networks   99 ( 335 ) 13 - 18  1999.09

     View Summary

    With conventional dynamic routing algorithms, many query messages are required in a distributed environment for an efficient multicast routing of any traffic volume. We have developed a dynamic routing algorithm that uses a predetermined path search in which an appropriate multicast path is dynamically constructed by searching only a few nodes. This algorithm can construct an efficient multicast tree for any traffic volume. Simulation has shown that the proposed algorithm is advantageous compared to conventional dynamic routing algorithm when nodes are added to or removed from the multicast group during steady-state simulation.

    CiNii

  • 決め打ち探索を用いた動的マルチキャストルーチングアルゴリズム(マルチメディアインターネット及び一般)

    朝香卓也, 三好匠, 田中良明

    電子情報通信学会技術研究報告. CS, 通信方式   99 ( 337 ) 13 - 18  1999.09

     View Summary

    従来の動的マルチキャストルーチングアルゴリズムでは,問い合わせメッセージ数が多い,あるいはツリーコストを小さく抑えることができないといった問題があった.本稿では,あらかじめ決められた探索経路に従い,接続すべきノードを決定する決め打ち探索を用いた動的マルチキャストルーチングアルゴリズムを提案する.提案アルゴリズムは,あらかじめ決められた探索経路を用いて探索を行うので問い合わせメッセージ数を大幅に少なくでき,かつ低コストのマルチキャストツリーを構成することができる.さらに,本稿では,提案マルチキャストルーチングアルゴリズムと従来のアルゴリズムをシミュレーションによって比較評価し,提案アルゴリズムの有効性を明らかにした.

    CiNii

  • 決め打ち探索を用いた動的マルチキャストルーチングアルゴリズム

    朝香卓也, 印↑三好匠, 田中良明

    電子情報通信学会技術研究報告. SSE, 交換システム   99 ( 333 ) 13 - 18  1999.09

     View Summary

    従来の動的マルチキャストルーチングアルゴリズムでは,問い合わせメッセージ数が多い,あるいはツリーコストを小さく抑えることができないといった問題があった.本稿では,あらかじめ決められた探索経路に従い,接続すべきノードを決定する決め打ち探索を用いた動的マルチキャストルーチングアルゴリズムを提案する.提案アルゴリズムは,あらかじめ決められた探索経路を用いて探索を行うので問い合わせメッセージ数を大幅に少なくでき,かつ低コストのマルチキャストツリーを構成することができる.さらに,本稿では,提案マルチキャストルーチングアルゴリズムと従来のアルゴリズムをシミュレーションによって比較評価し,提案アルゴリズムの有効性を明らかにした.

    CiNii

  • Batcher Banyan Network with Cell Copy Preparation Stages for Multicast Switching

    TAKAGI Shin' Ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    The Transactions of the Institute of Electronics,Information and Communication Engineers B   82 ( 9 ) 1655 - 1664  1999.09

    CiNii

  • Adaptive Contents Delivery System Using Multicast and Buffering

    MAEDA Takayuki, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   1999 ( 2 ) 97 - 97  1999.08

    CiNii

  • Influence of Multicast Tree on Network Planning

    MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   1999 ( 2 ) 120 - 120  1999.08

    CiNii

  • Dynamic Multicast Routing using Predetermined Path Search

    ASAKA Takuya, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   1999 ( 2 ) 121 - 121  1999.08

    CiNii

  • Multicast Network Design by Overlay Method

    SHIMIZU Shintaro, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   1999 ( 2 ) 122 - 122  1999.08

    CiNii

  • Bandwidth Allocation by Using an Auction Approach

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   1999 ( 2 ) 132 - 132  1999.08

    CiNii

  • Bandwidth Allocation with Auction Approach

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Technical report of IEICE. RCS   99 ( 217 ) 25 - 30  1999.07

     View Summary

    In the leased Circuit service, which is used by enterprises and ISPs (Internet Service Providers), the bandwidth is fixed. However, the traffic changes dynamically. Therefore, there is strong demand to allocate the bandwidth dynamically. This paper shows the auction method to do it. Auction is one method to allocate resources fairly and efficiently. By using this method, enterprises and ISPs can secure resources as the need changes. Moreover, the network can be used efficiently. In this method, enterprises and ISPs make a bid for bandwidth of the backbone network. Each bid price is decided on the basis of the need to get bandwidth. There are several auction schemes. In this paper, it is described how a network operator can allocate the bandwidth dynamically by using an English auction approach. Then, this method is analyzed from various viewpoints, such as user satisfaction, ISPs' benefit, network operators' benefit, etc.

    CiNii

  • Bandwidth Allocation with Auction Approach

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Technical report of IEICE. RCS   99 ( 219 ) 25 - 30  1999.07

     View Summary

    In the leased Circuit service, which is used by enterprises and ISPs (Internet Service Providers), the bandwidth is fixed. However, the traffic changes dynamically. Therefore, there is strong demand to allocate the bandwidth dynamically. This paper shows the auction method to do it. Auction is one method to allocate resources fairly and efficiently. By using this method, enterprises and ISPs can secure resources as the need changes. Moreover, the network can be used efficiently. In this method, enterprises and ISPs make a bid for bandwidth of the backbone network. Each bid price is decided on the basis of the need to get bandwidth. There are several auction schemes. In this paper, it is described how a network operator can allocate the bandwidth dynamically by using an English auction approach. Then, this method is analyzed from various viewpoints, such as user satisfaction, ISPs' benefit, network operators' benefit, etc.

    CiNii

  • Hash-Based Query Caching Method for Distributed Web Caching in Wide Area Networks

    ASAKA Takuya, MIWA Hiroyoshi, TANAKA Yoshiaki

    IEICE Trans. Commun., B   82 ( 6 ) 907 - 914  1999.06

     View Summary

    Distributed Web caching allows multiple clients to quickly access a pool of popular Web pages. Conventional distributed Web caching schemes, e.g., the Internet cache protocol and hash routing, require the sending of many query messages among cache servers and/or impose a large load on the cache servers when they are widely dispersed. To overcome these problems, we propose a hash-based query caching method using both a hash function and a query caching method. This method can find cached objects among several cache servers by using only one query message, enabling the construction of an efficient large-scale distributed Web cache server. Compared to conventional methods, this method reduces cache server overhead and object retrieval latency.

    CiNii

  • Dynamic Multicast Routing Algorithm for Satellite-Terrestrial Networks

    ASAKA Takuya, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. SSE   99 ( 62 ) 1 - 6  1999.05

     View Summary

    Satellite-terrestrial (ST) networks, in which many nodes are interconnected by both satellite and terrestrial networks, can efficiently support multicast service. An ST network requires a multicast routing algorithm that can select the appropriate satellite and terrestrial routes. We have developed a dynamic routing algorithm for ST networks that selects the route to use according to the multicast group size when a node is added to the group. Simulation showed that the proposed algorithm is advantageous when nodes are added to or removed from the multicast group during steady-state simulation.

    CiNii

  • Adaptive Contents Delivery System Using Multicast and Buffering

    MAEDA Takayuki, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   99 ( 35 ) 25 - 30  1999.04

     View Summary

    Multicast protocol can realize contents delivery services such as multimedeia package distribution with low costs. But, in a heterogeneous network, the transmission rate will be limited to the rate of the congested link. In this case, it is better to store the data in a buffer and to send it by unicast than to use a multicast protocol. This paper proposes a contents delivery system which is adaptive to the network states, and shows perfomance.

    CiNii

  • Countermeasures for External Blocking in Batcher Banyan Network with Cell Copy Preparation Stages

    TAKEDA Tomonori, TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   98 ( 669 ) 1 - 6  1999.03

     View Summary

    We have proposed the Batcher banyan network with cell copy preparation stages, assuming that it would be used for a transit switch. This switching network makes it possible to perform multicast connections with little hardware increase. This paper examines several strategies to prevent the external blocking. We adopt the input buffer with a reservation network as the method. Mainly for the reason of simple control, we propose cells to be reserved after cell duplication. The output of cell copy preparation stages is not uniform and this leads to poor performance. Therefore, we propose to annex a cell distribution network that distributes cells, and examine its effect.

    CiNii

  • Countermeasures for External Blocking in Batcher Banyan Network with Cell Copy Preparation Stages

    TAKEDA Tomonori, TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   98 ( 667 ) 1 - 6  1999.03

     View Summary

    We have proposed the Batcher banyan network with cell copy preparation stages, assuming that it would be used for a transit switch. This switching network makes it possible to perform multicast connections with little hardware increase. This paper examines several strategies to prevent the external blocking. We adopt the input buffer with a reservation network as the method. Mainly for the reason of simple control, we propose cells to be reserved after cell duplication. The output of cell copy preparation stages is not uniform and this leads to poor performance. Therefore, we propose to annex a cell distribution network that distributes cells, and examine its effect.

    CiNii

  • B-6-63 Measures for Reducing External Blocking in Batcher Banyan Network with Cell Copy Preparation Stages

    TAKEDA Tomonori, TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   1999 ( 2 ) 63 - 63  1999.03

    CiNii

  • B-7-1 A New Connectionless Service for ATM-LAN Using VC Manager

    MUNOZ Jose, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   1999 ( 2 ) 110 - 110  1999.03

     View Summary

    To implement Connectionless service over ATM exist different alternatives, the most accepted method is using Connectionless servers (CLS) deployed in some nodes of the ATM network. This solution can be generalized if we introduce a specific server called 'Virtual Circuit Manager' (VCM) in order to build different topologies besides the multiple star considered in the CLS approach. To optimize the topology created by the VCM, many algorithms can be used, here is considered the case of Annealing algorithm.

    CiNii

  • B-7-44 Bandwidth Allocation by Using an Auction Approach in Backbone Networks

    TAKAHASHI Eiji, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   1999 ( 2 ) 153 - 153  1999.03

    CiNii

  • B-7-52 A Study on Multicast Network Extension Method

    MIYOSHI Takumi, TANAKA Yoshiaki, SEZAKI Kaoru

    Proceedings of the IEICE General Conference   1999 ( 2 ) 161 - 161  1999.03

    CiNii

  • B-7-146 A Study on Design Method of Multicast Network by Heuristic Algorithm

    SHIMIZU Shintaro, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   1999 ( 2 ) 255 - 255  1999.03

    CiNii

  • B-7-147 Dynamic Multicast Routing for Satellite-Terrestrial Networks

    ASAKA Takuya, MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the IEICE General Conference   1999 ( 2 ) 256 - 256  1999.03

    CiNii

  • マルチキャスト通信網増設法の検討

    三好匠, 田中良明, 瀬崎薫

    電子情報通信学会技術研究報告. TM, テレコミュニケーションマネジメント   98 ( 544 ) 47 - 54  1999.01

     View Summary

    マルチキャスト通信の接続形態は, 従来の1対1通信とは明らかに異なるものであるため, 将来マルチキャスト通信が普及すれば最適な通信網形態が変化すると思われる.筆者らは, マルチキャスト通信に適した通信網構成の検討を行っているが, マルチキャスト通信においては現状のスター構成よりもデルタスター構成と呼ばれるトポロジーが最適であるとの結論を得ている.そこで, 本稿では, マルチキャストトラヒックが増加した場合の各トポロジーの特性変化をコストの観点から調査し, 現状トポロジーからどのような増設を行うことでデルタスター構成へと変化させるべきかを検討した.その結果, 比較的簡単なアルゴリズムを用いて回線増設箇所を決定すれば十分であることがわかった.

    CiNii

  • Time Appointed Data Delivery System

    KOJIMA Hisashi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. OFC   98 ( 544 ) 55 - 62  1999.01

     View Summary

    Data delivery services such as software distribution, video distribution, and multi-medeia package distribution are expected recently. Since these services are tolerant to the delay, they can be provided at low cost. But, the delay variation is inconvenient for users. This paper proposes a time appointed data-delivery system for the best effort network, and evaluates its performance by computer simulation.

    CiNii

  • マルチキャスト通信網増設法の検討

    三好匠, 田中良明, 瀬崎薫

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   98 ( 542 ) 47 - 54  1999.01

     View Summary

    マルチキャスト通信の接続形態は, 従来の1対1通信とは明らかに異なるものであるため, 将来マルチキャスト通信が普及すれば最適な通信網形態が変化すると思われる.筆者らは, マルチキャスト通信に適した通信網構成の検討を行っているが, マルチキャスト通信においては現状のスター構成よりもデルタスター構成と呼ばれるトポロジーが最適であるとの結論を得ている.そこで, 本稿では, マルチキャストトラヒックが増加した場合の各トポロジーの特性変化をコストの観点から調査し, 現状トポロジーからどのような増設を行うことでデルタスター構成へと変化させるべきかを検討した。その結果, 比較的簡単なアルゴリズムを用いて回線増設箇所を決定すれば十分であることがわかった.

    CiNii

  • Time Appointed Data Delivery System

    KOJIMA Hisashi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. OFC   98 ( 542 ) 55 - 62  1999.01

     View Summary

    Data delivery services such as software distribution, video distribution, and multi-medeia package distribution are expected recently. Since these services are tolerant to the delay, they can be provided at low cost. But, the delay variation is inconvenient for users. This paper proposes a time appointed data-delivery system for the best effort network, and evaluates its performance by computer simulation.

    CiNii

  • A Study on Multicast Network Extension Method

    MIYOSHI Takumi, TANAKA Yoshiaki, SEZAKI Kaoru

    Technical report of IEICE. OFC   98 ( 546 ) 47 - 54  1999.01

     View Summary

    Since the multicast connection form is obviously different from Point-to-Point one, the optimal network topology will be changed if many multicast services are provided. We have been studying the network topology suitable for multicast communication, and it is concluded that Delta-Star is better topology than Star. In this paper, the characteristic of each topology is investigated from the viewpoint with construction cost in case multicast traffic increases. The network extension methods from current topology are also studied. The results show that the simple algorithms work as well as the complicated one.

    CiNii

  • Time Appointed Data Delivery System

    KOJIMA Hisashi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. OFC   98 ( 546 ) 55 - 62  1999.01

     View Summary

    Data delivery services such as software distribution, video distribution, and multi-medeia package distribution are expected recently. Since these services are tolerant to the delay, they can be provided at low cost. But, the delay variation is inconvenient for users. This paper proposes a time appointed data-delivery system for the best effort network, and evaluates its performance by computer simulation.

    CiNii

  • Multicast Network Design by Heuristic Algorithms

    SHIMIZU Shintaro, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. SSE   98 ( 480 ) 25 - 30  1998.12

     View Summary

    The multicast connection form is obviously different from Point-to-Point one. The conventional network might reduce the qualities of Multicast services and might raise the network construction costs. In this paper, the multicast network design methods using heuristic algorithms, Greedy and Simulated Annealing (SA), are proposed from the viewpoint of the network construction cost. The results show that heuristic algorithms are better than the conventional methods that use the fixed link topologies.

    CiNii

  • Multicast Network Design by Heuristic Algorithms

    SHIMIZU Shintaro, MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. SSE   98 ( 478 ) 25 - 30  1998.12

     View Summary

    The multicast connection form is obviously different from Point-to-Point one. The conventional network might reduce the qualities of Multicast services and might raise the network construction costs. In this paper, the multicast network design methods using heuristic algorithms, Greedy and Simulated Annealing (SA), are proposed from the viewpoint of the network construction cost. The results show that heuristic algorithms are better than the conventional methods that use the fixed link topologies.

    CiNii

  • Planning and Design of Contents-Delivery Systems Using Satellite and Terrestrial Networks

    MASE Kenichi, ASAKA Takuya, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    IEICE Trans.Commun.   81 ( 11 ) 2041 - 2047  1998.11

     View Summary

    An architecture is presented for efficient and reliable delivery of multimedia contents from a primary center (PC) to secondary centers (SCs). Requested contents are delivered from the PC to the SCs through a satellite broadcast channel, or from one SC to another SC through a terrestrial channel. Cycling methods are presented that enable sharing of the contents directory of each SC. Several fundamental models and algorithms are introduced for possible consideration during the planning and design of a contents-delivery system. Simulation has shown that using both satellite broadcast and terrestrial channels for contents delivery is superior in terms of cost to the conventional use of only a satellite network.

    CiNii

  • 情報配信のための衛星・地上連携ネットワークのコスト分析

    朝香卓也, 間瀬憲一, 田中良明, 富永英義

    電子情報通信学会技術研究報告. IN, 情報ネットワーク   98 ( 300 ) 85 - 90  1998.09

     View Summary

    WWWやVODのような情報配信サービスを低コストで提供することを目的とした衛生・地上連携ネットワークのアーキテクチャが提案されている.本稿では, ネットワーク条件として新たに提案するホットスポット・キャシング機能とトラヒック条件として各コンテンツの更新される周期に注目し, それらがネットワークコストに与える影響の評価を行う.

    CiNii

  • 情報配信のための衛星・地上連携ネットワークのコスト分析

    朝香卓也, 間瀬憲一, 田中良明, 富永英義

    電子情報通信学会技術研究報告. SSE, 交換システム   98 ( 298 ) 85 - 90  1998.09

     View Summary

    WWWやVODのような情報配信サービスを低コストで提供することを目的とした衛星・地上連携ネットワークのアーキテクチャが提案されている.本稿では, ネットワーク条件として新たに提案するホットスポット・キャシング機能とトラヒック条件として各コンテンツの更新される周期に注目し, それらがネットワークコストに与える影響の評価を行う.

    CiNii

  • Cost Analysis of Contents-Delivery Systems using Satellite and Terrestrial Networks

    ASAKA Takuya, MASE Kenichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    IEICE technical report. Communication systems   98 ( 302 ) 85 - 90  1998.09

     View Summary

    Contents-delivery systems using satellite and terrestrial networks for contents-delivery services such as WWW or VOD has been proposed. In this article, we propose "hot-spot caching" for this system, and evaluate the system cost with respect to diverse network and traffic conditions. Especially, we focus on content renewal intervals as traffic conditions.

    CiNii

  • Copy Cell Split Method for Batcher Banyan Network with Cell Copy Preparation Stages

    TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   1998 ( 2 ) 24 - 24  1998.09

    CiNii

  • Contents-Delivery Systems using Satellite and Terrestrial Networks

    ASAKA Takuya, MASE Kenichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   1998 ( 2 ) 143 - 143  1998.09

    CiNii

  • A Study on Dynamic Multicast Routing with Considering Heterogeneous QoS

    MIYOSHI Takumi, TANAKA Yoshiaki, SEZAKI Kaoru

    Proceedings of the Society Conference of IEICE   1998 ( 2 ) 223 - 223  1998.09

    CiNii

  • A Study on Topology Design Method for Multicast Network

    MIYOSHI Takumi, SHIMIZU Shintaro, TANAKA Yoshiaki, SEZAKI Kaoru

    Proceedings of the Society Conference of IEICE   1998 ( 2 ) 225 - 225  1998.09

    CiNii

  • Performance of Multicast Delivery System with Buffers

    KOJIMA Hisashi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   1998 ( 2 ) 226 - 226  1998.09

    CiNii

  • バッファ付きマルチキャスト配送方式の特性

    小島久史, 田中良明, 富永英義

    電子情報通信学会技術研究報告. SSE, 交換システム   98 ( 240 ) 49 - 54  1998.08

     View Summary

    近年、ソフトウェアやマルチメディアコンテンツを多数のユーザに配送するサービスが期待されている.このようなサービスではマルチキャストを利用することになる.しかし, 特にインターネットのようなネットワークにおいては, マルチキャストを高信頼に行うために, 最も混雑しているリンクの速度に合わせてデータを送信する必要があるので非効率的である.そこで, ネットワーク内の主要ノードにバッファを装備した配送サーバを配置し, マルチキャストツリー全体を, 配送サーバをソースとするサブツリーに分割することで, 効率的な配送を可能とする手法を提案する.また, シミュレーションによりその特性を評価する.

    CiNii

  • Copy Cell Split Method for Batcher Banyan Network with Cell Copy Preparation Stages

    TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   98 ( 240 ) 55 - 60  1998.08

     View Summary

    We have proposed the Batcher banyan network with cell copy preparation stages for multicast switching. Hardware volume of this switch is little larger than that of Batcher banyan switching network. And the blocking rate is very even if multicast is done. But, if the number of copies is large, the blocking rate is not small. This paper proposes a new copy cell split method for Batcher banyan network with cell copy preparation stages. The blocking rate decreases significantly by using this method.

    CiNii

  • 小エリアにおけるマルチキャスト通信網構成

    三好匠, 田中良明, 瀬崎薫

    電子情報通信学会技術研究報告. SSE, 交換システム   98 ( 18 ) 17 - 24  1998.04

     View Summary

    B-ISDNが実現されると、放送をはじめとする各種マルチキャストサービスがトラヒックのかなりの部分を占めると考えられる。マルチキャストサービスでは、伝送路上のトラヒックを減らすために、1対多接続が用いられるが、これは従来の1対1接続とは大きく異なる。従って、マルチキャストサービスと1対1通信サービスが混在する場合の網構成を検討する必要がある。一方、1対1通信網の信頼性を重視した場合に有効なトポロジーとして、デルタスター構成が提案されているが、本構成はマルチキャストに有利なリング構成と1対1通信に有利なスター構成の両方を合せたような形状になっているため、両サービスが混在する場合に有効なトポロジーであると考えられる。本稿では、比較的小さいエリアにおいて、一つのトポロジーを用いてマルチキャスト通信網を構築した場合の最適形態についての検討を行った。その結果、多くの場合においてデルタスター構成が最適であることがわかった。

    CiNii

  • Multicast Network Structure for Local Area

    MIYOSHI Takumi, TANAKA Yoshiaki, SEZAKI Kaoru

    Technical report of IEICE. RCS   98 ( 20 ) 17 - 24  1998.04

     View Summary

    With the realization of B-ISDN, various kinds of multicast services will be introduced into network traffic. Multipoint connection paths, used to transmit multicast services, are quite different from current point-to-point connection paths. Therefore, new network topologies must be designed. On the other hand, Delta-Star has been propoesed as the effective topology in case that point-to-point network reliability is considered. Delta-Star may be suitable for B-ISDN network since this has both Star topology, suitable for point-to-point connections, and Ring, suitable for the multipoint connections. In this paper, the multicast network in local area is optimized by using one of several topologies. The results show that Delta-Star topology is optimal in many cases.

    CiNii

  • Filler-Batcher Switching Network

    Jose MUNOZ, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   1998 ( 2 ) 17 - 17  1998.03

    CiNii

  • Information Visualization for Network Operation

    HARA Yoshiharu, YAMAMURO Masashi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the IEICE General Conference   1998 ( 2 ) 139 - 139  1998.03

    CiNii

  • 小エリアにおけるマルチキャスト通信網構成

    三好匠, 田中良明, 瀬崎薫

    電子情報通信学会総合大会講演論文集   1998 ( 2 )  1998.03

    CiNii

  • Optimal Hierarchical Structure of Broadcast Network

    MIYOSHI Takumi, TANAKA Yoshiaki

    The Transactions of the Institute of Electronics,Information and Communication Engineers B-(0xF9C1)   81 ( 2 ) 41 - 48  1998.02

    CiNii

  • Batcher Banyan Network with Cell Copy Preparation Stage for Multicast Switching

    TAKAGI Shinichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   1997 ( 2 ) 11 - 11  1997.08

    CiNii

  • A Study on Broadcast Network Design Method

    MIYOSHI Takumi, TANAKA Yoshiaki, SEZAKI Kaoru

    Proceedings of the Society Conference of IEICE   1997 ( 2 ) 88 - 88  1997.08

    CiNii

  • Batcher Banyan Network with Cell Copy Preparation Stage for Multicast Switching

    TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. RCS   97 ( 133 ) 49 - 54  1997.06

     View Summary

    Multicast services will occupy a large part of the B-ISDN traffic. But, even if one multicast service is watched by many subscribers, it occupies only one channel on the trunkline. Namely, the multicast traffic is not dominant on the trunkline. Therefore, it is a waste to use non-blocking multicast ATM Swithing networks for transit switching systems. Because, the hardware of a non-blocking multicast ATM switching network is large. This paper proposes to apply Batcher banyan network, which is point-to-point non-blocking, to multicast transit switching systems. The blocking rate decreases substantially by placing a cell copy preparation stage in front of Batcher network.

    CiNii

  • Multicast Routing in Hierarchical ATM Network

    KOJIMA Hisashi, MIYOSHI Takumi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. RCS   97 ( 133 ) 79 - 84  1997.06

     View Summary

    With a realization of B-ISDN, broadcast services will occupy a large part of the B-ISDN traffic, and network resources must be saved using efficient routing theory. Generally, routing is not needed in the hierarchical network. However, routing is necessary in ATM network. Because it has many Virtual Paths and it logically becomes non-hierarchical. In this paper, dynamic routing is applied to the ATM network which is phisically hierarchical. The result shows that it is enough to use only static routing and unnecessary to use dynamic routing which requires complex controls, since the influence of the physically hierarchical network comes out strongly.

    CiNii

  • Batcher Banyan Network with Cell Copy Preparation Stage for Multicast Switching

    TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. RCS   97 ( 133 ) 49 - 54  1997.06

     View Summary

    Multicast services will occupy a large part of the B-ISDN traffic. But, even if one multicast service is watched by many subscribers, it occupies only one channel on the trunkline. Namely, the multicast traffic is not dominant on the trunkline. Therefore, it is a waste to use non-blocking multicast ATM Swithing networks for transit switching systems. Because, the hardware of a non-blocking multicast ATM switching network is large. This paper proposes to apply Batcher banyan network, which is point-to-point non-blocking, to multicast transit switching systems. The blocking rate decreases substantially by placing a cell copy preparation stage in front of Batcher network.

    CiNii

  • Multicast Routing in Hierarchical ATM Network

    KOJIMA Hisashi, MIYOSHI Takumi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. RCS   97 ( 133 ) 79 - 84  1997.06

     View Summary

    With a realization of B-ISDN, broadcast services will occupy a large part of the B-ISDN traffic, and network resources must be saved using efficient routing theory. Generally, routing is not needed in the hierarchical network. However, routing is necessary in ATM network. Because it has many Virtual Paths and it logically becomes non-hierarchical. In this paper, dynamic routing is applied to the ATM network which is phisically hierarchical. The result shows that it is enough to use only static routing and unnecessary to use dynamic routing which requires complex controls, since the influence of the physically hierarchical network comes out strongly.

    CiNii

  • Multiple Access Control for Satellite ATM Communication

    SHIMOTSUMA Ken'ichi, TANAKA Yoshiaki, TANAKA Hideyoshi

    Proceedings of the IEICE General Conference   1997 ( 1 ) 283 - 283  1997.03

    CiNii

  • Broadcast Traffic Handling Characteristics of Batcher Banyan Network

    TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. OCS   96 ( 536 ) 101 - 106  1997.02

     View Summary

    Broadcast services will occupy a large part of the B-ISDN traffic. But, even if one broadcast service is watched by many subscribers, it occupies only one channel on the trunkline. Namely, the broadcast traffic is not dominant on the trunkline. Therefore, it is a waste to use non-blocking broadcast ATM Swithing networks for transit switching systems. Because, the hardware of a non-blocking broadcast ATM switching network is large. This paper proposes to apply Batcher banyan network, which is point-to-point non-blocking, to broadcast transit switching systems. The blocking rate decreases substantially by placeing a simple network in front of Batcher network.

    CiNii

  • Broadcast Traffic Handling Characteristics of Batcher Banyan Network

    TAKAGI Shin'ichi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. OCS   96 ( 538 ) 101 - 106  1997.02

     View Summary

    Broadcast services will occupy a large part of the B-ISDN traffic. But, even if one broadcast service is watched by many subscribers, it occupies only one channel on the trunkline. Namely, the broadcast traffic is not dominant on the trunkline. Therefore, it is a waste to use non-blocking broadcast ATM Swithing networks for transit switching systems. Because, the hardware of a non-blocking broadcast ATM switching network is large. This paper proposes to apply Batcher banyan network, which is point-to-point non-blocking, to broadcast transit switching systems. The blocking rate decreases substantially by placeing a simple network in front of Batcher network.

    CiNii

  • Dynamic Broadcast Routing in ATM Network

    KOJIMA Hisashi, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Technical report of IEICE. SSE   96 ( 405 ) 31 - 36  1996.12

     View Summary

    Broadcast services will occupy a large part of the B-ISDN traffic. In the broadcast distribution services, calls originate and terminate at any time. Therefore, the dynamic broadcast routing is needed. Since the ATM network has many virtual paths, the dynamic broadcast routing will be more complicated than that of the conventional network. In this paper, the conventional dynamic broadcast routing methods are evaluated. Then, a new dynamic broadcast routing method which is fit for ATM network, is proposed.

    CiNii

  • Performance Evaluation of the Broadcast ATM Switching Network Separating Unicast and Broadcast Cells

    SOSE Toru, SEZAKI Kaoru, IMAI Hideki, TANAKA Yoshiaki

    Technical report of IEICE. SSE   96 ( 323 ) 19 - 24  1996.10

     View Summary

    We proposed a new broadcast ATM switching fabric, which separates the routes of unicast cells and broadcast, cells, and showed the possibility that the number of switch elements used in it was smaller than that of fully interconnected fabrics such as the Knockout Switch. Though the possibility depends on the number of output lines from the concentrator, the probability of losing cells becomes great if the number is too small. So, in this paper, we study the characteristic of the concentrator and cell loss probability, and analize how much smaller the number of switch elements in our fabric can be than that of the fully interconnected fabric.

    CiNii

  • Asymmetric Broadcast ATM Switching Network Using Output Buffer

    TANAKA Yoshiaki, SHIMIZU Shyu, MIYAKE Atsushi

    The Transactions of the Institute of Electronics,Information and Communication Engineers B-(0xF9C1)   79 ( 9 ) 624 - 632  1996.09

    CiNii

  • Optimal Hierarchical Structure of Broadcast Network

    MIYOSHI Takumi, TANAKA Yoshiaki

    Technical report of IEICE. SSE   96 ( 251 ) 1 - 6  1996.09

     View Summary

    With the realization of B-ISDN, broadcast services will be a large part of the network traffic. In these services, the same information is distributed to lots of viewers by multicast connection. This service form is quite different from those of current point-to-point services. In this service, current network topologies may lower the quality of services or may increase the construction costs. In this paper, the hierarchical network topology is optimized under the assumption that the broadcast services will account for a large part of the network traffic. The difference between the destination distribution for point-to-point services and that for broadcast services is considered, and the construction costs for various parameters are calculated.

    CiNii

  • A Broadcast ATM Switching Network Separating Unicast and Broadcast Cells

    TANAKA Yoshiaki, SOSE Toru, SEZAKI Kaoru, IMAI Hideki

    Proceedings of the Society Conference of IEICE   1996 ( 2 ) 14 - 14  1996.09

    CiNii

  • ATM Traffic Simulation on Parallel Computer

    ISIKAWA Nobutaka, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   1996 ( 2 ) 149 - 149  1996.09

    CiNii

  • Contents Delivery By Broadcast Routing with Low Priority

    NISHIKAWA Masahide, TANAKA Yoshiaki, TOMINAGA Hideyoshi

    Proceedings of the Society Conference of IEICE   1996 ( 2 ) 208 - 208  1996.09

    CiNii

  • Optimal Hierarchical Structure of Broadcast Network

    MIYOSHI Takumi, TANAKA Yoshiaki

    Proceedings of the Society Conference of IEICE   1996 ( 2 ) 274 - 274  1996.09

    CiNii

  • 放送形ルーチングにおける輻輳制御

    田中 良明, 屏 雄一郎

    電気学会研究会資料. CMN, 通信研究会   1996 ( 21 ) 37 - 42  1996.05

    CiNii

  • 一対一・放送分離形ATMスイッチ回路網

    田中 良明, 曽瀬 徹

    電気学会研究会資料. CMN, 通信研究会   1996 ( 21 ) 73 - 78  1996.05

    CiNii

  • Congestion Control in Broadcast Routing

    TANAKA Yoshiaki, HEI Yuichiro

    Technical report of IEICE. SSE   96 ( 61 ) 37 - 42  1996.05

     View Summary

    With the realization of B-ISDN, broadcast services will account for a large part of the network traffic. Since call loss probability must be very small in broadcast services, congestion control is very important in broadcast routing. In this paper, some methods of congestion control are proposed, and their characteristics are shown by simulation. As a result, it is shown that we should select a control method according to the traffic condition.

    CiNii

  • ATM Switching Network Separating Unicast and Broadcast Cells

    TANAKA Yoshiaki, SOSE Toru

    Technical report of IEICE. SSE   96 ( 61 ) 73 - 78  1996.05

     View Summary

    With the advance of B-ISDN, the demand for broadcast services will be a large part of the network traffic. So, various types of broadcast switching fabric have been proposed. If such proposed fabrics are adapted to the local switching systems, call control will be very complex or the number of switch elements will be very large. In this paper, we propose a new broadcast ATM switching fabric, which can solve such problems.

    CiNii

  • Call Control of Broadcast ATM Switching System

    TANAKA Yoshiaki, SOSE Toru

    Technical report of IEICE. SSE   95 ( 577 ) 67 - 72  1996.03

     View Summary

    With the advance of B-ISDN the demand for broadcast services will be a large part of the network traffic. So, a large number of broadcast switching fabrics has been proposed. In the broadcast switching systems, particularly in the local switching systems, the process of rewriting cell header conversion tables is much more complex than point-to-point switching systems. In this paper, we make the operation clear and examine the quantity of call control in the broadcast ATM switching system.

    CiNii

  • Hierarchical Structure for Broadcast Network

    TANAKA Yoshiaki, MIYOSHI Takumi

    IEICE technical report. Information networks   95 ( 494 ) 49 - 54  1996.01

     View Summary

    With the realization of B-ISDN, broadcast services will be a large part of the network traffic. In these services, the same information is distributed to lots of viewers by multicast connection. This service form is quite different from those of current point-to-point services. In this service, current network topologies may lower the quality of services or may increase the construction costs. In this paper, the hierarchical network topologies for broadcast connection are analyzed on the assumption that broadcast services will account. for a large part of the network traffic. The construction costs for various values of parameters are calculated.

    CiNii

  • A Study on Network Topology for B-ISDN

    TANAKA Yoshiaki, MIYOSHI Takumi

    IEICE technical report. Information networks   95 ( 143 ) 71 - 76  1995.07

     View Summary

    With the realization of B-ISDN, broadcast services will be a large part of the network traffic. In the broadcast distribution service, the same information is distributed to lots of viewers (multicast connection). This service form is quite different from those of current point-to-point services. In this service, current network topologies may lower the quality of services or may increase the construction costs. In this paper, the network topologies for multicast connection are analyzed on the assumption that broadcast services will account for a large part of the network traffic. The construction costs for various values of parameters are calculated.

    CiNii

  • A Study on B-ISDN Network Topology

    TANAKA Yoshiaki, MIYOSHI Takumi

    Proceedings of the IEICE General Conference   1995 ( 2 ) 250 - 250  1995.03

    CiNii

  • Adaptive Broadcast Routing Using Number of Viewers

    TANAKA Yoshiaki, MIYOSHI Takumi

      1994 ( 2 ) 288 - 288  1994.09

    CiNii

  • Subscriber - Individual Encryption System for Pay - Television Service

    AKIYAMA Minoru, TANAKA Yoshiaki, NISHIMURA Kenji

    The Transactions of the Institute of Electronics,Information and Communication Engineers B-(0xF9C1)   75 ( 1 ) 41 - 47  1992.01

    CiNii

  • QOS Control of ATM Considering Multi - Node Transfer

    TANAKA Yoshiaki, UENO Tomoyuki, AKIYAMA Minoru

    The Transactions of the Institute of Electronics,Information and Communication Engineers B-(0xF9C1)   75 ( 1 ) 22 - 29  1992.01

    CiNii

  • 音声パケット通信における瞬断品質評価と適応遅延制御

    田中 良明

    電子情報通信学会論文誌 B-(0xF9C1) 通信 (0xF9C1)   73 ( 7 ) p610 - 617  1990.07

    CiNii

  • 一般ベネス網の非ふくそうセルフル-チング制御 (広帯域ネットワ-ク特集) -- (ATMスイッチ)

    瀬崎 薫, 田中 良明, 秋山 稔

    電子情報通信学会論文誌 B-(0xF9C1) 通信 (0xF9C1)   72 ( 11 ) p1028 - 1033  1989.11

    CiNii

  • 木状構成多対1接続スイッチ回路網

    田中 良明, 瀬崎 薫, 秋山 稔

    電子情報通信学会論文誌 B-(0xF9C1) 通信 (0xF9C1)   72 ( 6 ) p468 - 475  1989.06

    CiNii

  • 縦続ベネス網--多対1再配置非閉塞スイッチ回路網の一構成

    瀬崎 薫, 田中 良明, 秋山 稔

    電子情報通信学会論文誌 B 通信   71 ( 8 ) p915 - 921  1988.08

    CiNii

  • 多対一接続3段スイッチ回路網

    田中 良明, 瀬崎 薫, 秋山 稔

    電子情報通信学会論文誌 B 通信   70 ( 2 ) p179 - 185  1987.02

    CiNii

  • 縦続構成多重接続スイッチ回路網

    田中 良明, 瀬崎 薫, 秋山 稔

    電子情報通信学会論文誌 B 通信   70 ( 1 ) p41 - 47  1987.01

    CiNii

  • A New Simple Dynamic Model of Steam Liquid Heat Exchangers Based on Their Static and Structural Characteristics

    KAWAI Sunao, IKEDA Mitsuru, TANAKA Yoshiaki, NAKAMURA Zenji

    Transactions of the Japan Society of Mechanical Engineers. Series C.   52 ( 483 ) 2881 - 2885  1986.11

     View Summary

    The dynamic characteristics of heat exchangers are described by partial differential equations .But the expressions are rather complicated and not well suited for practical use, so it is necessary to develop a simple lumped-parametered model to estimate the dynamic behavior of systems with heat exchangers and also to design optimal control systems. The aim of this paper is to present a relatively simple dynamic model for steam liquid heat exchangers via the method of weighted residuals (MWR). A 2nd-order MWR model is derived with a good approximation, which is represented by the three parameters, i.e. k_p which depends upon the steam and liquid temperature in steady state, τ_p which is the residence time of the liquid, and k_s which is the ratio between the shell-side time constant and τ_p. The results of an experimental study are also represented to validate the analytical results.

    DOI CiNii

▼display all

 

Internal Special Research Projects

  • ユーザ・ネットワークの協調行動による通信ネットワーク運用管理

    2015  

     View Summary

    &nbsp; &nbsp; &nbsp;Mobile Network Operators (MNO) are nowadays facing an exponential growth in their network traffic, as more and more customers are having access to affordable new technologies using smarter and data-based equipments. &nbsp;As new strategies have to be developed and implemented in order to meet those demands in a cost efficient way, the offloading one, with using an alternative network to the macrocell cell network, has been under ongoing discussions and studies. &nbsp;More specifically, the femtocell offloading alternative has been pointed out as a potential cost effective solution regarding advantageous specificity related to this technology like the the small size and ease of installation, making it easier to deploy than the macro one. &nbsp;In this study, we assess the relative costs benefits resulting from deploying the femtocell network, using the Total Cost of Ownership (TCO) as an economical method to have more accurate and up-to-date results regarding those potential benefits. &nbsp;Cost analysis is performed based on our base case scenario, and discussions on possible future extensions of this study are presented.&nbsp; &nbsp; &nbsp;Besides the above study, multi hop wireless networks are also studied.

  • コンテンツ配信の効用最大化プライシング

    2003  

     View Summary

     近年,ブロードバンド通信を利用したコンテンツ配信サービスがネットワークの分野で注目されている.配信されるコンテンツは,映画のような大容量のもの,ソフトウェアのような中容量のもの,ホームページのような小容量のものまで様々であるが,特に大容量のコンテンツを配信する場合には,集中的な輻輳が発生し易いという問題がある.輻輳が発生すると,従来のベストエフォート方式による転送では,ユーザはコンテンツのダウンロードが完了するまでの時間を推測することができない.このようなサービスは,ユーザにとって利用しにくいためコンテンツ配信サービスとしては成り立ちにくい.そこで,輻輳に対する対策が必要となる.サーバの性能を高めて,更に,帯域を増強することにより輻輳を回避することが考えられる.しかし,ネットワークの利用率が低い時間帯には空きリソースが発生して非効率的である. 本研究では,この問題を解決するために,コンテンツ配信の要求があった際に,配信サーバが,品質クラス別の待ち時間対料金の表を作成してユーザに提示し,配信クラスを選択させる方法を検討している.これにより,混雑時の負荷を平準化し,空いている時間帯のリソースを有効に利用することができ,限られたネットワークリソースを用いて効率的に配信サービスを実現することができる.料金は,一日のトラヒックを基にピーク時間帯とオフピーク時間帯に分けて設定する.ここでは,バックグラウンドトラヒックがないコンテンツ配信専用のネットワークについて検討している.想定するネットワークでは,配信が確定的に行えるので,料金表で提示した待ち時間を完全に保証することができる.本研究では,ユーザ効用の観点から提案したシステムの効果を示している.

  • リアイアブルマルチキャスト通信網構成

    2001  

     View Summary

     リライアブルマルチキャストでは,正しく届かなかったパケットの再送を行うので,その再送方式と網トポロジーにより,効率が変わってくる.そこで,リライアブルマルチキャストにおけるいろいろな再送方式がどの網トポロジーに向いているのか検討を行った.再送方式としては,送信元のサーバが行うか,最寄りのグループサーバまたは最寄りの受信ノードが行うかにより,グローバルリカバリ方式とローカルリカバリ方式に分けられる.また,それぞれに関して,マルチキャスト再送とユニキャスト再送がある.したがって,合計4通りの再送方式があることになる. 本研究では,ランダムに配置したノード数17のモデルを用いた.網トポロジーとしては,スター,リング,デルタスター(スターとリングの組合せ)の三つを対象にした.また,サーバは,中心にある場合と偏在している場合の2通りを考えた.このモデルにおいて,確率計算により再送トラヒックを求め,マルチキャストのコストを算出した.その結果,サーバ中心形モデルのスターではユニキャスト再送を用いたグローバルリカバリ方式及びローカルリカバリ方式が等しく,リングではユニキャスト再送を用いたローカルリカバリ方式が,デルタスターではユニキャスト再送を用いたグローバルリカバリ方式がそれぞれ効率的であることが分かった.また,サーバ偏在モデルでは,いずれのトポロジーにおいてもユニキャスト再送を用いたローカルリカバリ方式が効率的であることが分かった.すなわち,サーバと受信ノードの距離が大きいほど,最寄りのノードから再送を行うことができるローカルリカバリの特性が良くなるといえる. 次に,これらの三つのトポロジーを階層構成にした場合について検討を行った.場合の数が多いので,詳しい結果については省略するが,ユニキャスト再送を用いたローカルリカバリが効率的である場合が多いことが分かった.

  • マルチキャスト通信網の最適網トポロジー

    1998  

     View Summary

     広帯域サービス総合ディジタル網(B-ISDN)が実現されると、従来の電話、ファクシミリ、データ通信などのような1対1通信サービスの他に、各種マルチキャスト通信サービスが普及すると言われている。マルチキャスト通信では、同じ情報を2箇所以上の目的地に伝送する場合、途中までの経路が同じであれば、そこまでは一つの情報を伝送し、分岐点にて複製を作成する。これにより、伝送路のトラヒックを大幅に減少させることができ、全体としての網資源の節約、伝送コストの低減が可能となる。しかし、マルチキャスト接続という形態は、従来の1対1接続とは大きく異なるものであり、従来どおりの網トポロジーではサービスの品質劣化や網構成にかかるコストが増大する恐れがある。 本研究では、マルチキャスト通信サービスと1対1通信サービスが混在する場合を想定した最適トポロジーの検討を行った。まず、あらかじめ基本網形態を定めた上で、その中で最も適しているものを探索するという手法を用いた。次に、ヒューリスティックアルゴリズムを用いて、網トポロジーの最適化を行うという手法を用いた。 具体的には、全国を覆う広範囲な通信網の階層構成の一部をなす小エリアにおいて、交換局集合、その交換局を接続する敷設網、その地域で通信網に加入している加入者集合が与えられる。このとき、交換局間のトラヒック条件を満たす網のなかで、物理網の構成コストを最小にするような網構成をヒューリスティックアルゴリズムにより最適化した。ヒューリスティックアルゴリズムとしては、グリーディ及び焼きなまし法を用いた。その結果、あらかじめ基本網形態を定めた場合と比べて、よりコストの低い網を設計することができた。また、全国の網を現在の1対1通信の網からマルチキャスト通信網へ移行する場合の網増設法についても検討を行った。