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.
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...
Admission and rate control are key components for providing QoS (Quality of Service) flows in multi- rate wireless ad hoc networks where transmission rate at the physical layer is adapted dynamically according to the channel condition. Key to these controls is the formulation of a rate constraint that can regulate the flow rate passing through each node. This paper formulates a cross-layer rate constraint...
One-hop algorithms have been proposed to solve the problem of fast queries in structured Peer-to-Peer (P2P) system. The core concept for one-hop algorithms is to maintain a huge routing table, but most of them so far have opted to deal with routing table maintenance with a fixed consuming for peers, in order to keep minimal maintenance traffic at the cost of operating performance. In this paper we...
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...
The fat-tree topology has become a popular choice for InfiniBand fabrics due to its inherent deadlock freedom, fault-tolerance and full bisection bandwidth. InfiniBand is used by more than 40% of the systems on the latest Top 500 list, and many of these systems are based on a fat-tree topology. However, the current InfiniBand fat-tree routing algorithm suffers from flaws that reduce its scalability...
Motivated by the problem of limited bandwidth in peer-to-peer (P2P) multi-party video conferencing systems, in this paper we propose a non-intrusive adaptive multi-media routing algorithm that effectively calculates stream routing to achieve a maximum number of receiving streams. The technique is non-intrusive in that it makes use of current streaming status to infer link bottlenecks rather than sending...
The performance of interconnection networks is heavily influenced by routing algorithms. The selection function, which decides the final output channel when a set of admissible output channels exist, is essential for an adaptive routing algorithm. Congestion is usually a major cause of performance degradation in interconnection networks. In this paper, we present a simple and efficient selection function...
A lot of work has recently been published regarding metrics that could identify high quality paths in Wireless Mesh Networks (WMN). While results are encouraging, no optimal strategy has yet been identified that could estimate link quality and incorporate both the link reliability measurements as well as the bandwidth capacity. Furthermore, link estimation remains an open problem. Considering multi-user...
The properties found in complex networks (e.g., small-world, scale-free) have been used to characterize the behaviour of several processes such as epidemics or oscillators. We analyze the impact of such properties on the quality of a routing process. Using a Mixed Integer/Linear Program, the routing minimizes the number of ports installed in a previously designed network. Ports are network components...
P2P applications impose an enormous traffic load on the Internet. Actually, however, topological difference between P2P network and underlying physical network (Internet network) is creating inefficient use of the physical network resources. To this problem, we propose P2P download control methods using router network parameters (e.g., number of router-hops, TCP window size and RTT) that can achieve...
This paper examines the possibility of MPLS-based network to perform adaptive routing based on traffic engineering and the possibilities of using the network simulator for testing network architectures that are capable of adaptive routing. The analysis of existing architectures and mechanisms for traffic engineering showed that the considered architecture shown stationarity and can not follow the...
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...
Cognitive radio, which enables dynamic access of under-utilized licensed spectrums, is a promising technology for more efficient spectrum utilization. Since cognitive radio enables the access of larger amount of spectrum, it can be used to build wireless mesh networks with higher network capacity, and thus provide better quality of services for high bit-rate applications. In this paper, we study the...
As the escalating demand for bandwidth continues, 100-Gigabit networks mark the new frontier to be ventured by networking equipment vendors. Network processors (NPUs), fast emerging as key components in 10-Gigabit platforms, will also empower the 100-Gigabit platforms. However, packet processing at these line rates presents significant challenges to network processor designs. The most important driving...
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...
In this paper we investigate multi-path transmission of video over Wireless Multimedia Sensor Networks (WMSNs). Our objective is to provide a transmission mechanism to improve the video quality perceived at the receiver while considering energy, bandwidth and delay constraints of the network. Our approach is based on packet and path priority scheduling in multipath video transmission over WMSN. Video...
This paper discusses the energy saving control problem in ad hoc wireless networks. The problem inputs are given as a set of nodes in a plane, end-to-end traffic demands, and delay bounds between node pairs. The problem is to find an optimized routing that can meet the Quality of Service requirements and the minimized total consumed power of nodes. In addition to that, the network life time must be...
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,...
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.