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, Service Boundary Line approximation method is proposed to improve the accuracy of aggregated link state information in transport networks that conduct hierarchical QoS routing. This method selects the main link state information in the network and transports the data to the external networks together with the aggregation information, reducing information distortion caused from the loss...
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,...
Traditional multicast routing algorithms such as shortest path tree (SPT) and Steiner tree (MST) do not consider the wireless broadcast advantage or the underlying channel assignments in a multi-channel multi-radio (MCMR) wireless mesh network (WMN). We propose multicast routing algorithms that take into account the above factors in order to minimize the amount of network bandwidth consumed by a routing...
This work presents a study of RTP multiplexing schemes, which are compared with the normal use of RTP, in terms of ITU R-factor quality estimator. The bandwidth saving of the different schemes is studied, and some tests with VoIP traffic are carried out in order to compare R-factor using three different router buffer policies. Network delays are added using an adequate statistical distribution. The...
QoS Routing Algorithm is a routing algorithm for finding the shortest path that satisfies the QoS requirements of the end users. While finding the shortest path this uses some of improved ideas for effectively finding the shortest path with required QoS measures. Exactly the QoS routing algorithm is a kind of multi constrained routing algorithm where more than one link components are taken into considerations...
Ever increasing demand for more bandwidth over the Internet has lead to the development of many new technologies and architectures. Among these, Hybrid of Wireless and Optical networks have become increasingly important because of their “mobility” and “flexibility” in the wireless part and “robustness” and “high capacity”...
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...
Traditional multicast routing algorithms such as shortest path tree (SPT) and minimum Steiner tree (MST) do not consider the wireless broadcast advantage or the underlying channel assignments in a multi-channel multi-radio (MCMR) wireless mesh network (WMN). We propose a multicast routing algorithm for MCMR WMNs that takes into account the above factors in order to minimize the amount of network bandwidth...
Cost function is an essential part in Application Layer Multicast (ALM) routing algorithms. It is from a cost function that we can calculate links' costs and then build the data delivery tree for multicasting. Unfortunately, cost function remains an almost untouched research area in ALM routing. In this research, we propose a new multi-variable cost function considering various end-to-end QoS parameters...
Hybrid wireless optical broadband access networks are the future of internet service providers. Due to high capacity and flexibility, they are the most promising architecture for last mile internet access. Addressing the fact that deployed radios in the wireless part of WOBAN are under-utilized in current routing algorithms, half of the links remain idle while few of these links are carrying traffic,...
Computing constrained shortest paths is fundamental to some important network functions such as QoS routing and traffic engineering. This paper introduces a polynomial time approximation Quality of Service (QoS) routing algorithm and constructs dynamic state-dependent routing policies. The proposed algorithm uses a bio-inspired approach based on the trial/error paradigm combined with swarm adaptive...
In the challenged networks, such as interplanetary networks, satellite networks, military networks and so on, a complete path from the source to the destination does not exist for most of the time. The lack of end-to-end path makes the message delivery a great challenge in these networks. In this paper, we propose the spray and routing message delivery mechanism, which combines the simplicity of epidemic...
Power Line Communication Networks (PLCN) represent a very attractive communication system which can be used for many applications in the area of both home/building automation and street lighting control. The main problem is how to organize the many nodes, in order to implement a network where all nodes can exchange information with a master node. In this paper a tree-based clustering approach is introduced...
This Paper deeply analyzes and studies the existing problems in the any cast communication models in an IPv6 network and proposes a k-Any cast routing schemes for IPv6 network which are fault tolerance, load balancing, security, and improvement in system performance. In addition, this paper proposes a concrete scheme on how to implement this k-Any cast communication model in an IPv6 network which...
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...
To improve the adaptability and stability of Dijkstra algorithm for solving routing problem of service composition, a method to solve routing problem of service composition based on an improved ant colony algorithm is proposed. Firstly, based on the traditional ant colony algorithm, the constraints of it are improved. Secondly, a problem solving model for improved ant colony algorithm is established,...
Internet exchange points (IXPs) are an upcoming and essential component of the Internet infrastructure exhibiting numerous effects on various aspects of Internet topology and packet routing. While IXPs have been shown to play a major role in the evolution of the Internet topology, there has been little prior work in determining their effect on packet routing across the Internet. This paper presents...
One of the most critical problems in multihop wireless networks is the fair allocation of bandwidth among different nodes. Although there are significant researches on the fairness issues in single-hop wireless networks, research on multihop fairness rarely found in the literature. A user in multi-hop network, besides the contention with other nodes to obtain the channel in physical layer, must find...
Almost all deployed implementations of the IEEE802.16 standard (also known as WiMAX) employ the Point to Multipoint (PMP) topology. With such a topology Quality of Service (QoS) can be easily achieved, but the coverage area is limited. The other architectural topology is the Mesh Mode which is able to provide a larger coverage area, but cannot support the QoS required. This paper addresses the issue...
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.