The search functionality is under construction.

Author Search Result

[Author] Xun SHAO(9hit)

1-9hit
  • The Implications of Overlay Routing for ISPs' Peering Strategies

    Xun SHAO  Go HASEGAWA  Yoshiaki TANIGUCHI  Hirotaka NAKANO  

     
    PAPER-Information Network

      Vol:
    E96-D No:5
      Page(s):
    1115-1124

    The Internet is composed of many distinct networks, operated by independent Internet Service Providers (ISPs). The traffic and economic relationships of ISPs are mainly decided by their routing policies. However, in today's Internet, overlay routing, which changes traffic routing at the application layer, is rapidly increasing and this challenges the validity of ISPs' existing agreements. We study here the economic implications of overlay routing for ISPs, using an ISP interconnection business model based on a simple network. We then study the overlay traffic patterns in the network under various conditions. Combining the business model and traffic patterns, we study the ISPs' cost reductions with Bill-and-Keep peering and paid peering. We also discuss the ISPs' incentive to upgrade the network under each peering strategy.

  • An Interdomain Overlay Network Based on ISP Alliances for Economically Efficient Interdomain Traffic Routing

    Xun SHAO  Go HASEGAWA  Yoshiaki TANIGUCHI  Hirotaka NAKANO  

     
    PAPER-Information Network

      Vol:
    E97-D No:12
      Page(s):
    3163-3170

    As interdomain routing protocol, BGP is fairly simple, and allows plenty of policies based on ISPs' preferences. However, recent studies show that BGP routes are often non-optimal in end-to-end performance, due to technological and economic reasons. To obtain improved end-to-end performance, overlay routing, which can change traffic routing in application layer, has gained attention. However, overlay routing often violates BGP routing policies and harms ISPs' interest. In order to take the advantage of overlay to improve the end-to-end performance, while overcoming the disadvantages, we propose a novel interdomain overlay structure, in which overlay nodes are operated by ISPs within an ISP alliance. The traffic between ISPs within the alliance could be routed by overlay routing, and the other traffic would still be routed by BGP. As economic structure plays very important role in interdomain routing, so we propose an effective and fair charging and pricing scheme within the ISP alliance in correspondence with the overlay routing structure. Finally, we give a simple pricing algorithm, with which ISPs can find the optimal prices in the practice. By mathematical analysis and numerical experiments, we show the correctness and convergence of the pricing algorithm.

  • Subcarrier and Interleaver Assisted Burst Impulsive Noise Mitigation in Power Line Communication

    Zhouwen TAN  Ziji MA  Hongli LIU  Keli PENG  Xun SHAO  

     
    PAPER-Fundamentals of Information Systems

      Pubricized:
    2020/11/02
      Vol:
    E104-D No:2
      Page(s):
    246-253

    Impulsive noise (IN) is the most dominant factor degrading the performance of communication systems over powerlines. In order to improve performance of high-speed power line communication (PLC), this work focuses on mitigating burst IN effects based on compressive sensing (CS), and an adaptive burst IN mitigation method, namely combination of adaptive interleaver and permutation of null carriers is designed. First, the long burst IN is dispersed by an interleaver at the receiver and the characteristic of noise is estimated by the method of moment estimation, finally, the generated sparse noise is reconstructed by changing the number of null carriers(NNC) adaptively according to noise environment. In our simulations, the results show that the proposed IN mitigation technique is simple and effective for mitigating burst IN in PLC system, it shows the advantages to reduce the burst IN and to improve the overall system throughput. In addition, the performance of the proposed technique outpeformences other known nonlinear noise mitigation methods and CS methods.

  • Top-N Recommendation Using Low-Rank Matrix Completion and Spectral Clustering

    Qian WANG  Qingmei ZHOU  Wei ZHAO  Xuangou WU  Xun SHAO  

     
    PAPER-Internet

      Pubricized:
    2020/03/16
      Vol:
    E103-B No:9
      Page(s):
    951-959

    In the age of big data, recommendation systems provide users with fast access to interesting information, resulting to a significant commercial value. However, the extreme sparseness of user assessment data is one of the key factors that lead to the poor performance of recommendation algorithms. To address this problem, we propose a spectral clustering recommendation scheme with low-rank matrix completion and spectral clustering. Our scheme exploits spectral clustering to achieve the division of a similar user group. Meanwhile, the low-rank matrix completion is used to effectively predict un-rated items in the sub-matrix of the spectral clustering. With the real dataset experiment, the results show that our proposed scheme can effectively improve the prediction accuracy of un-rated items.

  • A Routing Strategy for Multihomed ISP to Mitigate the Impact of Overlay Traffic

    Xun SHAO  Go HASEGAWA  Yoshiaki TANIGUCHI  Hirotaka NAKANO  

     
    PAPER

      Vol:
    E96-D No:2
      Page(s):
    193-201

    Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic. We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.

  • A Visual Inspection System for Accurate Positioning of Railway Fastener

    Jianwei LIU  Hongli LIU  Xuefeng NI  Ziji MA  Chao WANG  Xun SHAO  

     
    PAPER-Image Recognition, Computer Vision

      Pubricized:
    2020/07/17
      Vol:
    E103-D No:10
      Page(s):
    2208-2215

    Automatic disassembly of railway fasteners is of great significance for improving the efficiency of replacing rails. The accurate positioning of fastener is the key factor to realize automatic disassembling. However, most of the existing literature mainly focuses on fastener region positioning and the literature on accurate positioning of fasteners is scarce. Therefore, this paper constructed a visual inspection system for accurate positioning of fastener (VISP). At first, VISP acquires railway image by image acquisition subsystem, and then the subimage of fastener can be obtained by coarse-to-fine method. Subsequently, the accurate positioning of fasteners can be completed by three steps, including contrast enhancement, binarization and spike region extraction. The validity and robustness of the VISP were verified by vast experiments. The results show that VISP has competitive performance for accurate positioning of fasteners. The single positioning time is about 260ms, and the average positioning accuracy is above 90%. Thus, it is with theoretical interest and potential industrial application.

  • Motion Track Extraction Based on Empirical Mode Decomposition of Endpoint Effect Suppression for Double-Rotor Drone

    Ziji MA  Kehuang XU  Binghang ZHOU  Jiawei ZHANG  Xun SHAO  

     
    PAPER

      Pubricized:
    2019/05/15
      Vol:
    E102-B No:10
      Page(s):
    1967-1974

    Double-rotor drone shows totally different flight performance. Extracting and analyzing its motion track is very helpful to improve its control approaches to achieve a robust and flight attitude. A novel EMD of endpoint effect suppression is proposed in this paper to accurately extract the DR drone's motion track. The proposed algorithm can effectively suppress the endpoint effect with a complex matching of both position and slope of the record of flight data from sensors. The computer simulation and experiment results both have demonstrated the proposed method's effectiveness and the feasibility of the designed DR drone.

  • A New Similarity Model Based on Collaborative Filtering for New User Cold Start Recommendation

    Ruilin PAN  Chuanming GE  Li ZHANG  Wei ZHAO  Xun SHAO  

     
    PAPER-Office Information Systems, e-Business Modeling

      Pubricized:
    2020/03/03
      Vol:
    E103-D No:6
      Page(s):
    1388-1394

    Collaborative filtering (CF) is one of the most popular approaches to building Recommender systems (RS) and has been extensively implemented in many online applications. But it still suffers from the new user cold start problem that users have only a small number of items interaction or purchase records in the system, resulting in poor recommendation performance. Thus, we design a new similarity model which can fully utilize the limited rating information of cold users. We first construct a new metric, Popularity-Mean Squared Difference, considering the influence of popular items, average difference between two user's common ratings and non-numerical information of ratings. Moreover, the second new metric, Singularity-Difference, presents the deviation degree of favor to items between two users. It considers the distribution of the similarity degree of co-ratings between two users as weight to adjust the deviation degree. Finally, we take account of user's personal rating preferences through introducing the mean and variance of user ratings. Experiment results based on three real-life datasets of MovieLens, Epinions and Netflix demonstrate that the proposed model outperforms seven popular similarity methods in terms of MAE, precision, recall and F1-Measure under new user cold start condition.

  • MPTCP-meLearning: A Multi-Expert Learning-Based MPTCP Extension to Enhance Multipathing Robustness against Network Attacks

    Yuanlong CAO  Ruiwen JI  Lejun JI  Xun SHAO  Gang LEI  Hao WANG  

     
    PAPER

      Pubricized:
    2021/07/08
      Vol:
    E104-D No:11
      Page(s):
    1795-1804

    With multiple network interfaces are being widely equipped in modern mobile devices, the Multipath TCP (MPTCP) is increasingly becoming the preferred transport technique since it can uses multiple network interfaces simultaneously to spread the data across multiple network paths for throughput improvement. However, the MPTCP performance can be seriously affected by the use of a poor-performing path in multipath transmission, especially in the presence of network attacks, in which an MPTCP path would abrupt and frequent become underperforming caused by attacks. In this paper, we propose a multi-expert Learning-based MPTCP variant, called MPTCP-meLearning, to enhance MPTCP performance robustness against network attacks. MPTCP-meLearning introduces a new kind of predictor to possibly achieve better quality prediction accuracy for each of multiple paths, by leveraging a group of representative formula-based predictors. MPTCP-meLearning includes a novel mechanism to intelligently manage multiple paths in order to possibly mitigate the out-of-order reception and receive buffer blocking problems. Experimental results demonstrate that MPTCP-meLearning can achieve better transmission performance and quality of service than the baseline MPTCP scheme.