The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The paper presents the comparative study and analysis of buffering in Goback2 network. The performance at the destination node by applying different buffering capacities at the routers is demonstrated. The results using NS2 simulator are produced. It can be concluded that the selection of appropriate type of buffering helps in controlling the congestion and the packet drops at the link node.
In wide-area video conferencing, the rate control of video sources to relieve network congestion along the multicast data path occurs in a distributed manner. In this paper, we study the desirable properties of signaling channels that carry the `packet loss report' (ELR) from a receiver to the sources as a short control message. A signaling channel provides for loss-free and time-ordered flow of ELRs...
In this paper, we extends bandwidth balancing technique in wired networks to operate in mobile ad hoc networks (MANETs). In bandwidth balancing in Distributed-Queue-Dual-Bus (DQDB), different nodes occupy the same channel, and information about the bandwidth is transferred between nodes in the unused bandwidth. Similarly, in wireless networks, the capacity on a channel is shared by several sources...
The congestion control scheme plays a critical role in the multicast communication. Without a proper congestion control mechanism, multicast protocols would cause unfairness while sharing network bandwidth with other flows. We propose a deliberated congestion control scheme to multicast multimedia contents for smart phones retrieving effectively. Our key idea is to detect the single trip time of packet...
Data center networks (DCNs) usually have a regular topology providing high bandwidth and low latency with multi-paths. In a data-intensive application on DCNs, it is important to be able to use all the available bandwidth. However, this is not easy to achieve because of the locality of congestion information. In this paper, we propose a reactive reroute strategy to incorporate with IEEE 802.1Qau standards...
This paper proposes a new TCP congestion control supporting loss-fairness, which also contributes to improving RTT fairness. It has been well known that smaller RTT flows grab more bandwidth than larger ones when they compete on the shared link. This is called RTT unfairness and is caused by congestion control mechanism of the current TCP. To solve this problem, many protocols have been proposed....
The capacity of a multi-hop wireless network is the traffic payload that it can transport. This is a prominent quality of service issue, particularly in the highly constrained settings of 802.11 wireless mesh network. In this paper, we consider two complementary definitions of the capacity. A network-wise capacity is defined as the sum of the upload traffic, and a flow- wise capacity highlighting...
The resource of DTN (Delay Tolerant Network) is constrained and its links are unstable, so the states of network can't be fed back in time to the source node of data. The rate control mechanism and window mechanism of congestion control can't solve the congestion problem of DTN. The paper has proposed A DTN Congestion Control Mechanism Based on Distributed Storage (DCM). When the congestion of a DTN...
Localized Quality of Service (QoS) routing has been recently proposed for supporting the requirements of multimedia applications and satisfying QoS constraints. Localized algorithms avoid the problems associated with the maintenance of global network state by using statistics of flow blocking probabilities. Using local information for routing avoids the overheads of global information with other nodes...
Mulitcast communication is an effective and promising way for dissemination of the same data to potentially large number of receivers. In multicast congestion control proposed thus far, the receiver with the worst congestion level is selected as the representative and transmission rate of multicast sender is regulated so that it is adjusted to TCP throughput of the representative. However, in wireless...
It is important to use an ALM (application layer multicast) tree with broad bandwidth to ensure the quality of streaming applications. However, when constructing an ALM tree without information on underlay traffic, we cannot know how much congestion there is in links. Therefore, if unexpected congestion in links occurs, the quality of ALM transmissions may worsen. However, no polynomial-time algorithms...
Every congestion-control protocol operating in wireless networks is potentially faced with two major challenges of performance degradation. These sources are: 1) the coupling of fairness and efficiency; and 2) not properly differentiating between congestion-caused loss associated with network buffering and error-caused loss associated with fading effects. In this paper, we provide a Variable-structure...
Localized Quality of Service (QoS) routing has been recently proposed for supporting the requirements of multimedia applications and satisfying QoS constraints. Localized algorithms avoid the problems associated with the maintenance of global network state by using statistics of flow blocking probabilities. Using local information for routing avoids the overheads of global information with other nodes...
As researchers continue to architect massive-scale systems, it is becoming clear that these systems will utilize a significant amount of shared hardware between processing units. Systems such as the IBM Blue Gene (BG) and Cray XT have started utilizing flat (i.e., scalable) networks, which differ from switched fabrics in that they use a 3D torus or similar topology. This allows the network to grow...
In shared-medium wireless networks, nodes contend for medium access in space, time and channel bandwidth. Uncontrolled competition for limited network resources causes severe packet collisions and compounds network congestion. Consequently, data transmission is subject to very long delay, significant packet loss and poor throughput. This work focuses on improving data transmission in wireless ad hoc...
Network flows running on a wireless mesh network (WMN) may suffer from partial failures in the form of serious throughput degradation, sometimes to the extent of starvation, because of weaknesses in the underlying MAC protocol, dissimilar physical transmission rates or different degrees of local congestion. Most existing WMN transport protocols fail to take these factors into account. This paper describes...
It is crucial for P2P applications to control their traffics for saving the Internet bandwidth. During the P2P communication, if peers tend to share the data with near peers, the Internet traffic can be reduced. Thus the topology of the P2P networks will be clustering. In this article, we study downloading strategies for the living P2P applications with clustering topology. First, we combine two popular...
As the product of bandwidth and latency increases, TCP becomes inefficient and prone to instability, regardless of the queuing scheme. The eXplicit Control Protocol (XCP) is a novel and promising congestion control protocol that outperforms TCP in terms of efficiency, fairness, persistent queue length, packet loss rate and convergence speed. However, in a multi-bottleneck environment, XCP may cause...
Aimed to the limitations of traditional routing algorithms and to perfect MPLS application in the domain of load balance, an algorithm of static load balance based on topology is designed in this dissertation. When the shortest path is congested in the network, the algorithm is used to find a low load sub-shortest path for the congestion path based on the bandwidth occupied situation and the topology...
In this paper we propose a scalable admission control scheme for the QoS sensitivity traffic in core-stateless networks. In our scheme, the ingress routers perform admissibility test in a fully distributed and parallel fashion for requests by dint of our bandwidth dividing based virtual link mechanism. Then, we introduce a novel two phase token passing mechanism to adaptively optimize the proportion...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.