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.
This paper is concerned with understanding the connection between the existing Internet congestion control algorithms and the optimal control theory. The available resource allocation controllers are mainly devised to derive the state of the system to a desired equilibrium point and, therefore, they are oblivious to the transient behavior of the closed-loop system. This work aims to investigate what...
Due to the rapidly changing topology of vehicular ad hoc network (VANET), it requires the routing protocol can be able to find out comparatively more stable routes. But the routing protocols in existence are not taking the distinguishing features of vehicles and roadway into consideration, and this brought about challenges to these routing protocols' applicability in VANET. In this paper, we take...
Clustering is used commonly in ad hoc networks for hierarchical routing. Size-bounded clustering has been proposed to restrict the maximum size of a cluster so that the routing load, and hence the energy drain, on the clusterhead is bounded. However, all the existing size-bounded clustering algorithms take the size bound as the number of nodes in the cluster. This approach may still result in high...
A massively parallel computer involves a large number of routers that are independent of each other. Adaptive routing methods offer high levels of flexibility in packet routing, but their performance is limited due to their locality nature. The Cross-Line method handles quasi-global information of congestion to improve performance. This paper introduces two new ideas of adaptation level and evaluation...
Multipath Routing plays an important role in communication networks. Multiple disjoint paths can increase the effective bandwidth between pairs of vertices, avoid congestion in a network and reduce the probability of dropped packets. In this paper, we built mathematical models for arc-disjoint paths problem and vertex-disjoint paths problem respectively, and then proposed polynomial algorithms for...
In the following paper, we study the tradeoff between network utility and network lifetime for energy-constrained wireless sensor networks (WSNs). By introducing a parameter r, we combine these two objectives into a single weighted objective, and consider rate control and routing in this tradeoff framework simultaneously. First, using the dual decomposition method, we decompose the tradeoff model...
Routing schemes for network recovery aim to find connection paths under the scenarios of link or node failures that disrupt end-to-end connectivity. Several recovery schemes consider a proactive search for alternative links (or paths) that can restore the lost connectivity after the failure. However, the effect that the modification of network traffic after the switch over the alternative paths brings...
The congestions in wireless sensor networks have two types: link congestion and node congestion. The primary method for congestion avoidance is to control sending rate, through the mechanism of distribution rate and cache notification. Multi path is the primary method for guaranteeing transmission reliability in wireless sensor networks. Aiming at the node congestion, MPCN-multi path based on cache...
InfiniBand networks are aimed to fulfill increasing communication demand of parallel applications in high performance clusters. However, the dynamic behavior of communication load may cause bottlenecked link(s) which lead to message congestion. Congestion spreading increases latency and reduces network throughput causing important performance degradation. In this paper, we propose a congestion control...
This paper considers the problem of routing packets across a multi-hop wireless network while ensuring throughput optimality. One of the main challenges in the design of throughput optimal routing policies is identifying appropriate and universal Lyapunov functions with negative expected drift. The few well-known throughput optimal routing policies in the literature are constructed using simple quadratic...
Multi-nexthop routing mechanisms is the key point in network congestion, and the essential question is how to forward packets among multi-nexthop to reach equiponderant forwarding. This paper proposes an equiponderant forwarding strategy in multi-nexthop routing, which forwards the packets according to the actual capability of each node, and resolves the equiponderant forwarding problem of multi-nexthop...
Performance evaluation for Network on Chip (NoC) is still a challenging problem. This paper presents the design of an on-line configurable traffic generator (OCTG) that provides a fast and effective traffic generation environment for evaluating the communication performance of Network-on-Chip (NoC). The novelty of the proposed OCTG architecture lies in the fact that it is different from just having...
This paper focuses on congestion control but while previous works considered scalar sensor nodes which only report events in the size of a few bytes, we are addressing congestion control for information-intensive flows such as video flows for surveillance applications in pervasive wireless multimedia sensor networks. The proposed framework that we describe in this paper tries to put several mechanisms...
Traditional network is surprisingly fragile and difficult to manage. Yet the current solution of substantial manual configuration makes traditional network management expensive and error-prone. To solve this problem, a network control programmable platform is constructed by in this paper. The platform is consisted of a namespace, a network control primitive library, network event library, a network-wide...
A significant drive to consolidate data center networks on a single infrastructure is taking place. 10-Gigabit Ethernet is one of the contenders to fulfill the role of universal data center interconnect. One of the key features missing from conventional Ethernet is congestion management; this void is being filled by the standardization work of the IEEE 802.1Qau working group. However, the schemes...
We present a session initiation protocol (SIP) network design for a voice-over-IP (VoIP) network to prevent congestion caused by people calling friends and family after a disaster. The design increases the capacity of SIP servers in a network by using all the SIP servers equally. The design uses a property that SIP network elements do not carry voice data packets but signaling packets instead. Furthermore,...
The computational intractability of the dynamic programming (DP) equations associated with optimal admission and routing in stochastic loss networks of any non-trivial size (Ma et al, 2006, 2008) leads one to consider suboptimal distributed game theoretic formulations of the problem. The special class of radial networks with a central core of infinite capacity is considered, and it is shown (under...
Routing games, as introduced in the pioneering work of Orda, Rom and Shimkin (1993), are very closely related to the traffic assignment problems as already studied by Wardrop and to congestion games, as introduced by Rosenthal. But they exhibit more complex behavior: often the equilibrium is not unique, and computation of equilibria is typically harder. They cannot be transformed in general into an...
Traffic congestion avoidance is a critical issue associated with data routing in Wireless Sensor Networks (WSNs). Previous researches employ either traffic or resource control strategies as solutions. In this paper, we propose an energy-efficient grid-based traffic congestion avoidance scheme in WSNs, termed as TALONet. With our mechanism, the approaches applied to avoid congestion have three folds:...
The increasing demand of parallel applications in cluster computing requires the use of interconnection networks to provide low and bounded communication delays. However, message congestion appears when communication load between nodes is not fairly distributed over the network. Congestion spreading increases latency and reduces network throughput causing important performance degradation. In this...
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.