Search

The control of transmission rates is currently a major topic in network research, as it plays a significant role in determining network performance. Traditional network design principles suggest that network nodes should only be responsible for forwarding data, while the sending node should manage control. However, sending nodes often lack information about network resources and must use slow-start algorithms to increase the transmission rate, potentially leading to wasted bandwidth and network congestion. Furthermore, incorrect judgments about network congestion by sending nodes may further reduce network throughput. The emergence of new Internet architectures, such as information-centric networks (ICNn), has empowered network nodes with more capabilities, including computation and caching. This paper proposes a method for transmission rate control that actively avoids congestion through network node bandwidth allocation. The sending, network, and receiving nodes each calculate the available transmission rate, and the sending node negotiates with the other nodes through a rate negotiation message to obtain the maximum transmission rate possible given the current state of the network. The network nodes notify the sending node to adjust the transmission rate to adapt to changes in the network through a rate adjustment message. Simulation experiments show that the proposed method is better than traditional methods in reducing network congestion, providing a stable transmission rate, increasing the network throughput capacity, and improving performance in high-latency and high-bandwidth networks. Additionally, the proposed transmission rate control method is fairer than traditional methods.

Information-Centric Networking (ICN) has revolutionized the manner of content acquisition by shifting the communication mode from host-centric to information-centric. Considering the existing, large amount of IP infrastructure in current networks, the new ICN architecture is proposed to be compatible with existing networks in order to reduce deployment cost. However, due to compatibility with IP networks, ICN data packets must be transmitted through the default path provided by IP routing regulations, which also limits the transmission efficiency and reliability of ICN. In order to address this issue, this paper introduces a multipath transmission method applied in ICN which takes full advantage of the functions and characteristics of ICN and builds multiple end-to-end relay paths by using the ICN routers as relay nodes. We then propose a relay-node-selection algorithm based on path correlation to minimize the impact of overlapping links. Moreover, we comprehensively calculate the path state value by combining the round-trip time and packet loss rate and propose a multipath data-scheduling algorithm based on the path state value. Simulation experiments show that the proposed method can maintain high bandwidth utilization while reducing the number of out-of-order packets.

As the Internet communication model changes from host-centric to content-centric, information-centric networking (ICN) as a new network architecture has received increasing attention. There are often multiple replicas of content in ICN, and how to reasonably utilize the characteristics of multiple replicas to further improve user experience is an important issue. In this paper, we propose a replica-selection algorithm, called the transmission completion time estimation (TCTE) algorithm. TCTE maintains the state of replica nodes in the domain with passive measurements in a limited domain of an enhanced name resolution system (ENRS), then estimates the transmission completion time of different replica nodes and selects the smallest one. When no replica is found in the ENRS domain, the nearest-replica algorithm will be used, so TCTE will not increase the traffic in the core network. Experiments show that TCTE not only effectively improves the user’s download rate and edge node throughput, reduces download rate fluctuations, reduces user download delay, and improves fairness, but also has universal applicability.

Due to the overload of IP semantics, the traditional TCP/IP network has a number of problems in scalability, mobility, and security. In this context, information-centric networking (ICN) is proposed to solve these problems. To reduce the cost of deployment and smoothly evolve, the ICN architecture needs to be compatible with existing IP infrastructure. However, the rigid underlying IP routing regulation limits the data transmission efficiency of ICN. In this paper, we propose a novel multipath transmission scheme by utilizing the characteristics and functions of ICN to enhance data transmission. The process of multipath transmission can be regarded as a service, and a multipath transmission service ID (MPSID) is assigned. By using the ICN routers bound to the MPSID as relay nodes, multiple parallel paths between the data source and the receiver are constructed. Moreover, we design a path management mechanism, including path selection and path switching. It can determine the initial path based on historical transmission information and switch to other optimal paths according to the congestion degree during transmission. The experimental results show that our proposed method can improve the average throughput and reduce the average flow completion time and the average chunk completion time.

As a new network architecture, information-centric networking (ICN) decouples the identifiers and locators of network entities and makes full use of in-network cache technology to improve the content distribution efficiency. For reliable multicast, ICN in-network cache can help reduce the loss recovery delay. However, with the development of applications and services, a multicast tree node often serves multiple reliable multicast groups. How to reasonably allocate cache resources for each multicast group will greatly affect the performance of reliable multicast. In order to improve the overall loss recovery performance of reliable multicast, this paper designs a dynamic cache allocation mechanism (DCAM). DCAM considers the packet loss probability, the node depth of the multicast tree, and the multicast transmission rate of multicast group, and then allocates cache space for multicast group based on the normalized cache quota weight. We also explore the performance of three cache allocation mechanisms (DCAM, AARM, and Equal) combined with four cache strategies (LCE, CAPC, Prob, and ProbCache), respectively. Experimental results show that DCAM can adjust cache allocation results in time according to network changes, and its combinations with various cache strategies outperform other combinations. Moreover, the combination of DCAM and CAPC can achieve optimal performance in loss recovery delay, cache hit ratio, transmission completion time, and overhead.

Information-centric networking (ICN) is expected to be a candidate for future internet architecture, and it supports features such as multicast that improves bandwidth utilization and transmission efficiency. However, multicast itself does not provide congestion control. When multiple multicast groups coexist, multicast traffic may exhaust all network resources, and cause network congestion and packet loss. Additionally, traditional IP multicast congestion control mechanisms cannot be directly applied to ICN architecture. Therefore, it is necessary to consider an effective congestion control mechanism for ICN multicast. This paper proposes a single-rate multicast congestion control mechanism, called SRMCC. It supports router-assisted awareness of the network congestion state and congestion control message aggregation. Moreover, the fair shared rate estimation method is innovatively proposed to achieve protocol fairness. Most importantly, it adjusts the rate according to different congestion states indicated by the queue occupancy ratio. By introducing a rate selection factor, it can achieve a balance between packet loss rate and throughput. Experimental results show that our proposal outperforms other mechanisms in throughput, packet loss rate, total bandwidth utilization, and overhead, and achieves protocol fairness and better TCP friendliness.

As an emerging network architecture, Information-Centric Networking (ICN) is considered to have the potential to meet the new requirements of the Fifth Generation (5G) networks. ICN uses a name decoupled from location to identify content, supports the in-network caching technology, and adopts a receiver-driven model for data transmission. Existing ICN congestion control mechanisms usually first select a nearby replica by opportunistic cache-hits and then insist on adjusting the transmission rate regardless of the congestion state, which cannot fully utilize the characteristics of ICN to improve the performance of data transmission. To solve this problem, this paper proposes a two-level congestion control mechanism, called 2LCCM. It switches the replica location based on a node state table to avoid congestion paths when heavy congestion happens. This 2LCCM mechanism also uses a receiver-driven congestion control algorithm to adjust the request sending rate, in order to avoid link congestion under light congestion. In this paper, the design and implementation of the proposed mechanism are described in detail, and the experimental results show that 2LCCM can effectively reduce the transmission delay when heavy congestion occurs, and the bandwidth-delay product-based congestion control algorithm has better transmission performance compared with a loss-based algorithm.