Search

With the rapid growth of internet traffic, the traditional host-to-host TCP/IP architecture is subject to many service limitations faced with content-oriented applications. Various novel network architectures have been proposed to solve these limitations, among which Information-Centric Networking (ICN) is one of the most prominent. ICN features the decoupling of content (service) from the physical devices storing (providing) it through location-independent naming, and offers inherent enhancement to network performance, such as multicast and in-network caching. ICN in-network caching has been extensively studied, and we believe that it may also be the main incentive for ISPs to deploy ICN. A CDN (content delivery network) is a typical content-oriented network paradigm that aims to provide the fast delivery of content. In this paper, we leverage the advantages of the in-network caching of ICN to enhance the content delivery efficiency of CDN by integrating ICN as a service. First, we present our design of a content delivery network enhanced with ICN, called IECDN. Additionally, we formulate a mathematical model to optimize the performance of our proposed design and conduct a series of evaluations. The results indicate that our proposed design provides significant performance gains while reducing bandwidth consumption and shows better resilience to traffic surge. [ABSTRACT FROM AUTHOR]

In recent years, Internet traffic has increased due to its widespread use. This can be attributed to the growth of social games on smartphones and video distribution services with increasingly high image quality. In these situations, a routing mechanism is required to control congestion, but most existing routing protocols select a single optimal path. This causes the load to be concentrated on certain links, increasing the risk of congestion. In addition to the optimal path, the network has redundant paths leading to the destination node. In this study, we propose a multipath control with multi-commodity flow problem. Comparing the proposed method with OSPF, which is single-path control, and OSPF-ECMP, which is multipath control, we confirmed that the proposed method records higher packet arrival rates. This is expected to reduce congestion. [ABSTRACT FROM AUTHOR]

A steadily increasing number of users consume videos over the Internet. In current video platforms, players run a control algorithm that dynamically chooses the video bitrate to match the time-varying network bandwidth. Such an algorithm strives to improve the quality individually perceived by users. Consequently, this control architecture leads, in the optimal case, to maximize the average quality perceived collectively by all users rather than to a quality-fair distribution of resources, possibly leading to user abandonment for those users receiving a lower quality. Therefore, we argue that well-designed video delivery networks should gracefully degrade the perceived quality equally for all users when resources become scarce. In this paper, we propose the Multi-Commodity Flow Problem (MCFP) optimization framework to address the issue of designing a QoE-fair optimal allocation strategy. We show how to make the resulting problem tractable for video platforms serving massive audiences. The performance of the proposed optimal fair resource allocation strategy is tested through realistic simulations involving thousands of concurrent users on two real networks by varying both the total load on the network and the system parameters. [ABSTRACT FROM AUTHOR]

This paper deals with multi-depot bus scheduling (MDBS) problem. Depot workload balancing constraints are introduced. In this case, the problem can be stated as a two-objective multi-commodity flow problem with soft constraints. Two state-of-the-art heuristics are developed including schedule-based and cluster-based heuristics, both of them extend auction algorithm. Also three different approaches are proposed to satisfy depot workload balancing constraints. The convergence of each algorithm is investigated and its complexity obtained. To illustrate the main concepts and results, a small example is solved. Also, to demonstrate the performance of the proposed algorithms, some benchmark examples are considered and CPU-time and optimality gap are compared. The results show a great improvement in the CPU time and quality of the solution of the proposed algorithms. Also the extension of the proposed algorithms under ε-scaling approach is analysed. [ABSTRACT FROM AUTHOR]