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 investigates a specific NP-hard problem by comparing a depth-first search and a depth-first branch-and-bound algorithm as applied to network topology configuration in wireless ad hoc network planning. The vast amount of possible solutions in medium to large NP-hard problems makes algorithm methodology very important. State space algorithms are used to traverse through the solution space...
Wireless mesh networks (WMNs) are comprised of nodes with multiple radio interfaces and provide broadband residential internet access or connectivity to temporal events. Our goal is to simplify the network deployment of such a mesh network, and towards that we are presenting procedures for automatic configuration and optimisation of the network. We first present an architecture framework that supports...
System capacity is an important factor that affects the performance of WiMAX system where the amount of data that can be delivered to the end user is determined based on the system capacity and users QoS requirements. This scenario is even more complex when multi-hop relays are introduced into the network whereas the user access capacity decreases with the increase of hop number. In order to maintain...
Modified optimized link state routing (M-OLSR) has been developed for adaptability in wireless mesh networking (WMNs) scenarios and exhibits a much better scalability of traffic load and mobility in sparse and dense network. The protocol uses some refresh timers for periodic updates of link information and for subsequent topology maintenance. In this paper, we investigate the impact of configuring...
The architecture of the class of routers to implement the modified Fat Tree topology is shown. The router architecture is buffer-less with a simplified routing function. The routing function is obtained from a model that describes the Fat Tree topology and from where the equations governing the routing circuitry are derived. A parameterized router model is developed and coded in verilog. A modified...
With the spread of mobile nodes, studies on MANET (Mobile Ad-hoc Network) that can build networks solely with mobile nodes are drawing much attention. However, most of the ad-hoc routing protocols have not considered the traffic conditions in the network. Thus, we propose an ad-hoc routing protocol that takes account of traffic conditions, by way of extending OLSR (Optimized Link State Routing).
We describe the implementation and evaluation of a network simulator 2 (NS-2) module for the datagram congestion control protocol, or DCCP. Our module, based on an updated standard described in RFC 4340, attempts to model the behavior and performance of the two currently defined congestion control identifiers CCID2 and CCID3. The behavior, throughput, and fairness of DCCP in comparison with TCP were...
In wavelength routed optical networks, each optical link is capable of carrying traffic using several wavelengths and each wavelength as well as lightpath support traffic in the Gbps range. On the other hand, the traffic requested by individual connection is still in the Mbps range. Therefore, to utilize the network resources (bandwidth, transceivers, etc.) effectively, several low-speed traffic streams...
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.