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.
In this paper we propose classical control theory to look at the end-to-end congestion control algorithm used by the Transmission Control Protocol/Internet Protocol (TCP/IP). By using this approach we show that classical control modeling using Laplace transforms and Smith's principle give a simple and rigorous model of the role played by congestion window and advertised window variables in today's...
Advances in process technology has enabled the integration of many cores on a single die. The advent of many core systems has led to a commensurate increase in cache coherence complexity. As a solution to this problem, researches have proposed directory based protocols, which are scalable alternatives to snoop-based protocols. Although write-invalidation based directory protocols enhance the performance...
Modularity and hierarchical-based design are crucial features that need to be supported in complex embedded systemscharacterized by multiple applications with timing requirements.Resource reservation is a powerful scheduling mechanism forachieving such goals and providing temporal isolation amongdifferent real-time applications. When different applications sharemutually exclusive resources, a precise...
Existing incentive schemes for peer-to-peer (P2P) file-sharing are rate-based, giving room for strategic peers to benefit from manipulative behaviors so as to treat honest peers unfairly. Specifically, strategic peers can achieve high performance by providing high upload rates which are useless to the system. On the other hand, honest peers suffer from getting low download rates even if they devote...
We propose a broadcast method for Delay Tolerant Networks (DTNs) to achieve small latency for message diffusion in a congested situation. In the existing DTN broadcast methods, nodes tend to transfer a limited variant of messages to the contacted nodes, and thus cause an inefficient bandwidth use. That leads to a large latency of message diffusion. This paper proposes a new transfer message selection...
This paper presents a new multipath delay based algorithm, MPPERT (Multipath Probabilistic Early response TCP), which provides high throughput and efficient load balancing. In all-PERT environment, MPPERT suffers no packet loss and maintains much smaller queue sizes compared to existing MPTCP, making it suitable for real time data transfer. MPPERT is suitable for incremental deployment in a heterogeneous...
XCP is one of the most commonly used protocols in modern congestion control implementations. XCP can provide the available transmission rate to applications. It is well known fact that one of the issues of XCP is that the time-delay of its traditional implementation (TR-XCP) is twice the time-delay of its flow model. This leads to unstable behaviors when controlling the congestion in networks with...
Envisioning to meet the expectations arising from the Future Internet, and specifically to provide efficient Quality of Service (QoS) support for multimedia multi-user sessions, the attempts by the research community have resulted in mechanisms such as Multi-User Aggregated Resource Allocation (MARA). The MARA mechanism adopts an over-provisioning centric strategy to control surplus class-based bandwidth...
The IEEE 802.11 standard does not define any feedback policy for the multicast transport. Hence missing multicast packets are not retransmitted and are definitely lost. In this paper we define the Block Negative-Ack (BNAK) recovery policy. Using our protocol, the multicast source transmits a block of multicast packets followed by a Block NAK Request (BNR). Upon reception of a BNR, a multicast member...
As audiovisual communications services become the dominant traffic source in the Future Internet, their stable coexistence and their fairness towards background traffic is an active research topic. The Internet implements flow multiplexing in a decentralized fashion via congestion control. Audiovisual media streams, however, are classified as inelastic traffic flows that do not allow rate control...
The eXplicit Control Protocol (XCP) is a promising congestion control protocol that outperforms TCP in terms of efficiency, fairness, persistent queue length, and packet loss rate. XCP quantitatively informs senders how to adjust their sending rate, and assumes that all senders will respond. However, short-lived flows are often on the order of a few segments, they may be unresponsive to XCP feedback,...
In this paper, we use game theory to model a general participation game for a distributed and dynamic network. Such networks may include sensing and control agents. The main problem we are interested in is how to achieve broad participation while aligning the incentives of all the participating agents. A consumer node is willing to invest an amount of rewards to get a set of networked sensor nodes,...
In this paper we study a model of joint congestion control and routing in a ring network of sources with a single destination at the center (Figure 2). A utility maximization problem subject to routing constraints is posed and equations for its solution are presented. The distribution of traffic on routes available to a source is subject to an entropy constraint that controls the path diversity or...
The study and understanding of the social behavior of insects has contributed to the definition of some algorithms that are capable of solving several types of optimization problems. In 1997 Di Caro and Dorigo developed the first routing algorithm for wired networks, called AntNet, using an approach which was inspired in the behavior of ant colonies. At each node, AntNet, similar to others Ant Colony...
A large number of congestion control protocols have been proposed in the last few years, with all having the same purpose—to divide available bandwidth resources among different flows in a fair manner. Each protocol operates on the paradigm of some conception of link price (such as packet losses or packet delays) that determines source transmission rates. Recent work on network utility maximization...
In this paper, we discuss the importance of the network connectivities of the peers in Bit Torrent based systems in determining the download performance of the peers. In this context, assuming that the fraction of the peers of each bandwidth are known, we derive optimal connectivities of the peers that help to improve the average latency of the peers. We represent the topology of a Bit Torrent based...
Multi-path is a technique to increase the reliability of the internet connection in IP network. The implementation of this technique can be described as a host with two TCP paths work together, when one of them fails the other will back up the connection. Since TCP does not support multi-homing, the right term for this technique is multi-path. The fairness problem arises when multi-path host uses...
Due to the unfair distribution of bandwidth exiting in XCP late start flow, this paper proposes a quick-start algorithm based on XCP. Through eliminating the rate difference among packages, the algorithm utilizing average speed can make late start flow quickly get fair bandwidth. Simulation results demonstrate that the proposed method can effectively reduce the time which XCP flow converge to fairness...
This paper is concerned with congestion aware forwarding algorithms within opportunistic networks. We remove the reoccurring assumption of unlimited storage, and make it evident that congestion is a prominent problem that needs to be addressed. We propose a distributed congestion control algorithm that adaptively chooses the next hop based on contact history and statistics, as well as storage statistics...
In the IEEE 802.16 system, the bandwidth is allocated by the Downlink and Uplink scheduler. All Subscriber Stations know when they should send or receive from the DL_MAP and UP_MAP information. For most existing schedulers, the bandwidth is allocated with the maximum sustained rate. If the allocated bandwidth of one queue has reached the maximum sustained rate, there will be no more bandwidth for...
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.