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.
This paper proposes a simple path diversity algorithm (SPDA) for Interdomain routing. The SPDA uses source routing to find an alternate path from a source to a destination, and allows flexible division of traffic over the best and alternate path. The SPDA comprises three steps. First, the BGP protocol is extended to allow the BGP routing table to save the multiple paths for any destination. Second,...
The number of elderly in industrialized countries is increasing, and the home healthcare applications are widespread. The routing of healthcare traffic is important with no doubt. This study investigates the problem of unfairness when QoS routing does not consider the mix of traffic classes. Unfairness is mainly caused by routing different traffic flows of the same class through paths with extremely...
The paper presents the effect of packet size on the delay in Manhattan Street Network (MSN). The delay behavior of Manhattan Street Network for packets of different size is demonstrated. The results are produced in the NS2 simulator. It is concluded that the increase in the packet size increases delay and as a result degrades the performance in multipath, multihop networks like MSN .The performance...
Opportunistic routing has gained much attention in recent years as a means of leveraging the broadcast nature of wireless medium. Most of the previous studies focused only on improving throughput, assuming that Best Effort traffic which is delay insensitive is delivered through opportunistic routing. However, when the delay sensitive traffic is involved, it is necessary to consider both the opportunistic...
Dynamic routing is very important in terms of assuring QoS in today's packet networks especially for streaming and elastic services. Existing solutions dedicated to dynamic routing are often too complicated and seem to be not usable in real time traffic scenarios where transferred traffic may vary significantly. This was the main reason for research and new routing mechanism proposal which should...
This paper considers the problem of constructing minimum-delay multicast trees for message dissemination in overlay networks in which nodal delays for processing messages are taken into account in addition to communication delays. The objective is to find a multicast tree to deliver a message from a source to multiple destinations in minimum delay time. This paper introduces a new delay measure called...
A new cross layer path selection scheme with quality of service (QoS) support along urban areas is proposed. First, we introduce a cross-layer approach where the routing decision takes explicit consideration of the application layer objective function. Second, the queueing based mobility model, spatial traffic distribution and probability of connectivity for sparse and dense Vehicular Ad-Hoc Networks...
The paper presents the Performance Analysis of Manhattan Street Network (MSN). Improvement of 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 congestion and the packet drops can be reduced at the link node by appropriate size of buffer at the link node.
Delay Tolerant Networks (DTNs) are characterized by intermittent connectivity, high delay and without end-to-end path from the source to the destination. The fundamental way of message routing in DTNs is store-and-forward. Thus, the mal-behaving nodes in the networks, which are uncooperative to relay messages, will significantly undermine the routing performance. In this paper, we propose a novel...
With the development of the space technology, the low performance of the on-board computing becomes a bottleneck of the satellite networks. To solve this problem, we proposed a new QoS routing scheme for LEO satellite networks based on ground station in this paper. This routing scheme is off-line and based on prediction. The most computing task of the routing scheme will be implemented on the ground...
In this paper, we discuss how to discriminate the queue type in the network for end-to-end congestion control. FAST TCP is one of end-to-end congestion avoidance techniques and designed to accept FIFO and drop tail queue. However, existing AQM routers in the recent Internet may interrupt that such end-to-end congestion avoidance protocols perform well. At first, we examine the behavior of FAST TCP...
QoS guarantee is crucial for delivering real-time multimedia over any type of network. This paper proposes QoS-aware multimedia service selection in a heterogeneous network environment. The QoS-aware service selection is based on the nature-inspired routing algorithm, AntNet. The performance evaluation for this selection algorithm is conducted on the multimedia content transcoding system. This paper...
Delay/Disruption Tolerant Networks (DNTs) enables nodes to communicate by means of asynchronous sending messages without the need for an end-to-end path. In this paper, we study the problem of multicasting in DTNs. Several schemes have been proposed for multicast routing assuming the group of message receivers is known by sender, and the group members do not change during the process of message delivery...
As the high redundancy of network equipments and paths, connection reliability is no longer the most important parameter for networks. According to network function, this paper advances transmission time reliability as a common parameter to describe network congestion. It is defined to be the probability that networks will transmit material, energy or information timely when used under specified operating...
Diffserv(Differentiated Service) is a promising technique to realize scalable QoS control in the internet. Therefore, extensive efforts have been made for the practical use of this technique. Diffserv is already introduced in some networks. Control functions for Diffserv are installed in edge routers and core routers. This enables a scalable QoS control as mentioned above. This paper proposes a new...
Center-based trees are one kind of group-shared trees. Packets are distributed over center-based trees from all sources to all multicast destinations. Because of its simplicity, the idea of center-based trees is used in multicast protocols such as CBT (Core-Based Tree) and PIM (Protocol Independent Multicast). There are two main problems in center-based trees. One is the core selection problem. The...
Communication networks are traditionally assumed to be connected. However, in delay and disruption tolerant networks(DTN), there are many unconventional difficulties, such as intermittent connectivity, large delay and may never have an end-to-end contemporaneous path, a node has to store-and-carry messages for a long time, until a new forwarding opportunity arises. Because every node needs to store...
We propose a model of router queue buffering with FAST TCP flows in dumbbell networks. Using this model, we analysis the transient dynamic of router queue buffering with different scenarios. It is found that, network settings as well as FAST TCP parameters can influence router queue buffering transient performance. We provide simulation results to verify the theoretical results.
This paper provides parameter setting and 2-D local stability conditions for TCP/RED networks. In general, a network cannot avoid congestions due to the limit of network capacity. The RED scheme is one of the representative AQM that was proposed to avoid and alleviate network congestions. However, the issue of network stability with many TCP subscribers needs to be considered when setting the RED...
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.