Route Selection

Cellular manufacturing (CM) is an important application of group technology (GT) that can be used to enhance both flexibility and efficiency in today's small-to-medium lot production environment. The crucial step in the design of a CM system is the cell formation (CF) problem which involves grouping parts into families and machines into cells. The CF problem are increasingly complicated if parts are assigned with alternative routings (known as generalized Group Technology problem). In most of the previous works, the route selection problem and CF problem were formulated in a single model which is not practical for solving large-scale problems. We suggest that better solution could be obtained by formulating and solving them separately in two different problems. The aim of this case study is to apply Taguchi method for the route selection problem as an optimization technique to get back to the simple CF problem which can be solved by any of the numerous CF procedures. In addition the main effect of each part and analysis of variance (ANOVA) are introduced as a sensitivity analysis aspect that is completely ignored in previous research.

This article describes the main features of Multiprotocol Label Switching (MPLS), a standard architecture proposed by the IETF that integrates label swapping forwarding with network layer routing. The role of MPLS in overcoming limitations of overlay models, such as IP over ATM, and of conventional routing in IP networks, is discussed. The main concepts are introduced and the operation of MPLS is explained-classification of packets into Forward Equivalence Classes, label allocation and binding to routes, label distribution, set up of Label Switched Paths and route selection. Finally, support of traffic engineering and Quality of Service mechanisms in MPLS networks is analysed. 1. MPLS-rationale for a new routing and forwarding architecture The success of the Internet is mainly due to its flexible architecture, built upon IP, the ubiquitous internetworking layer protocol. IP networks offer unparalleled scalability and flexibility for the deployment of value-added services and are becoming increasingly attractive for carrying services with hard and soft real-time constraints. This requires extending the traditional best-effort model, designed from the outset for elastic data traffic, with mechanisms that provide differentiated and predictable Quality of Service (QoS) to a wide variety of applications with different requirements [1]. The Internet Engineering Task Force (IETF) has already specified the Integrated Services (IntServ) [2] and the Differentiated Services (DiffServ) [3] models with these goals in mind. Carriers' requirements With the increasing demand and explosive growth of the Internet, service providers require a dependable and controllable network infrastructure that can offer consistent performance. In many cases, the original router-based backbone networks evolved into a two level structure made up of a high speed core network interconnecting edge devices (IP routers) that, in turn, interface with access networks and provide common services to users, such as security, accounting, Virtual Private Networks (VPNs), web hosting, etc. Management of such networks requires powerful traffic engineering techniques, that is, the capability of mapping flows into the physical network topology and evenly distributing traffic over the network links, to achieve an efficient utilization of network resources, avoid congestion and improve network performance.

The impractical association of a dedicated fiber optic backhauling link with each base station in future wireless area network (WAN) networks promoted self-backhauling to become one of the most practical techniques for ultra-dense deployments. Selfbackhauling reduces the number of stations with fiber-optic links, while the remaining stations can communicate with the core network through wireless multi-hoping connections. Nevertheless, routing through self-backhauling stations is an NP-hard problem. In this study, we propose a routing scheme based on a semi-distributed self-learning algorithm to reduce the end-to-end latency which achieve better stability against the dynamic nature of the mobile network, such as load variations and link failures. The proposed solution offers changing propagation medium between freespace optical (FSO) and radio frequency (RF); this dynamic change between every two hops reduces power consumption, increases throughput, and minimizes latency. Based on the performed simulation, our proposed algorithm measured better overall bit error rate (BER) compared to both RF-only and free-space optical FSO-only techniques resulting in increased backhauling capacity and reduced overall route interference. This is an open access article under the CC BY-SA license.

In this paper, we present a new medium access control (MAC) protocol for wireless sensor networks with periodic monitoring applications. In particular, we design a listensleep time schedule for sensor nodes, and we propose a path establishment algorithm for route selection. To evaluate the performance of the proposed protocol, we conduct detailed analysis and simulations. Numerical results show that, compared to existing MAC protocols, our new protocol can significantly reduce energy consumption, average packet delay, and packet loss due to collisions.

External border gateway protocol (eBGP) is the ubiquitous protocol used today for advertisement of reachability information and for route selection among administrative domains (autonomous systems or ASs) in the Internet. However, many emerging needs in commercial and military networking have exposed limitations of the current eBGP. In particular, these IP networks of the future carries a very diverse mix of

This article describes the main features of Multiprotocol Label Switching (MPLS), a standard architecture proposed by the IETF that integrates label swapping forwarding with network layer routing. The role of MPLS in overcoming limitations of overlay models, such as IP over ATM, and of conventional routing in IP networks, is discussed. The main concepts are introduced and the operation of MPLS is explained-classification of packets into Forward Equivalence Classes, label allocation and binding to routes, label distribution, set up of Label Switched Paths and route selection. Finally, support of traffic engineering and Quality of Service mechanisms in MPLS networks is analysed. 1. MPLS-rationale for a new routing and forwarding architecture The success of the Internet is mainly due to its flexible architecture, built upon IP, the ubiquitous internetworking layer protocol. IP networks offer unparalleled scalability and flexibility for the deployment of value-added services and are becoming increasingly attractive for carrying services with hard and soft real-time constraints. This requires extending the traditional best-effort model, designed from the outset for elastic data traffic, with mechanisms that provide differentiated and predictable Quality of Service (QoS) to a wide variety of applications with different requirements [1]. The Internet Engineering Task Force (IETF) has already specified the Integrated Services (IntServ) [2] and the Differentiated Services (DiffServ) [3] models with these goals in mind. Carriers' requirements With the increasing demand and explosive growth of the Internet, service providers require a dependable and controllable network infrastructure that can offer consistent performance. In many cases, the original router-based backbone networks evolved into a two level structure made up of a high speed core network interconnecting edge devices (IP routers) that, in turn, interface with access networks and provide common services to users, such as security, accounting, Virtual Private Networks (VPNs), web hosting, etc. Management of such networks requires powerful traffic engineering techniques, that is, the capability of mapping flows into the physical network topology and evenly distributing traffic over the network links, to achieve an efficient utilization of network resources, avoid congestion and improve network performance.

One of the major successes in ITS technology lately has been in the area of Advanced Traveler Information Systems (ATIS). In particular, there are now many good navigation systems that can advise drivers on route selection within a roadway network. This type of navigation software is now available on the Internet that can be used for trip planning, as well as in on-board navigation systems that can calculate optimal routes based on current vehicle location. The primary role of these navigation systems is to help drivers find their destinations. More advanced navigation systems can now help drivers avoid congestion on the roadways based on receiving real-time roadway data information. To date, these navigation systems have embedded algorithms that attempt to minimize trip distance and/or travel time. However, many drivers are now becoming increasingly concerned with rising fuel costs and pollutant emissions. Therefore, it is desirable to create new "environmentallyfriendly" navigation algorithms. Taking advantage of the latest navigation technology, we have developed new navigation techniques that focus on minimizing energy consumption and pollutant emissions. These methods combine sophisticated mobile-source energy and emission models with route minimization algorithms that are used for navigational purposes. These new methods have been applied in several Southern California case studies resulting in significant energy savings compared to standard navigation techniques.

This paper presents a ship inventory routing and scheduling problem with undedicated compartments (sIRPSP-UC). The objective of the problem is to find a minimum cost solution while satisfying a number of technical and physical constraints within a given planning horizon. In this problem, we identify four sub-problems that need to be decided simultaneously: route selections, ship selection, loading, and unloading activity procedures. To solve this problem, first, we developed a mixed integer linear programming model. We then developed a one-step greedy heuristic, and then based on this heuristic, we propose a set of heuristics. Each heuristic has a combination of rules for each sub-problem. A number of problem instances are used to compare the solutions of the two approaches. We applied selected good combinations of rules to solve each problem using the heuristic approach. The results show that 8 out 12 of the considered problem instances have no gap with MILP solution solved using LINGO. We also find that the average gap is 1.96%. In contrast when we consistently use the same combination for all iterations, there are no dominant combinations of heuristics that can find good solutions for all the problem instances.

In this paper we examine how metrics impact route selection, looking at which metric(s) are selected and how these metrics are used to calculated cost. Examining multiple and dynamic metrics currently in use and looking toward a proposal of agent carrying dynamic metric information across an autonomous system.

This paper presents a new system, called BGPmon, for monitoring the Border Gateway Protocol (BGP). BGP is the routing protocol for the global Internet. Monitoring BGP is important for both operations and research; a number of public and private BGP monitors are deployed and widely used. These existing monitors typically collect data using a full implementation of a BGP router. In contrast, BGPmon eliminates the unnecessary functions of route selection and data forwarding to focus solely on the monitoring function. BGPmon uses a publish/subscribe overlay network to provide real-time access to vast numbers of peers and clients. All routing events are consolidated into a single XML stream. XML allows us to add additional features such as labeling updates to allow easy identification of useful data by clients. Clients subscribe to BGPmon and receive the XML stream, performing tasks such as archiving, filtering, or real-time data analysis. BGPmon enables scalable real-time monitoring data distribution by allowing monitors to peer with each other and form an overlay network to provide new services and features without modifying the monitors. We illustrate the effectiveness of the BGPmon data using the Cyclops route monitoring system.

The aim of this study is to assess the effects of incentives, in the form of toll reductions, introduced to entice commuters to use a toll expressway. Two market segments were targeted: everyday users, for whom the intended effect is to reduce peak-hour congestion by spreading entrances to expressways to off-peak hours, and low-frequency users, for whom the intended effect is to increase their expressway use over surface streets or public transit. To evaluate the effectiveness of toll reductions, an experiment was conducted on an expressway in Osaka, Japan, in which participants received a toll reduction at each expressway use. The experiment lasted for 6 weeks with toll discounts offered during the middle 4 weeks according to certain schedules. Data on the participants’ first trips of the day were collected over the 6-week period. Mixed logit models were developed to describe everyday users’ departure time choice and low-frequency users’ route choice, respectively, in accounting fo...

This work describes the optimized conditions for the preparation of cobalt aluminum silicate complexes through a simplified methodology. These materials, designated CoAlSi-NHG, were obtained by a non-hydrolytic sol-gel route involving the condensation of aluminum chloride with diisopropylether in the presence of cobalt chloride, followed by reaction with tetraethoxysilane. The obtained solids were heat-treated at various temperatures, and the resulting materials were characterized by ultraviolet-visible spectroscopy, X-ray diffraction, 29 Si and 27 Al NMR, transmission electron microscopy, surface area, thermogravimetric analysis, and differential thermal analysis. All the materials consisted of an aluminum silicate matrix, and they all remained amorphous throughout heat treatment up to 750 8C. The onset of crystallization took place at 1000 8C, and the formation of mullite was observed thereafter. All the CoAlSi-NHGs obtained in this work via different heat treatments were used as catalysts in the oxidation of (Z)-cyclooctene, cyclohexane, and n-heptane by iodozylbenzene. The non-hydrolytic sol-gel route led to the obtention of extremely interesting catalytic systems capable of selectively oxidizing various types of reactions. The intermediate species is the oxidizing species oxo-cobalt, which is similar to the active species obtained in the case of enzymes such as cytochrome P-450.

Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go be-yond simple shortest path computation. In this demo, we show how the concept of skyline queries can be successfully adapted to ...

This paper will describe a field study of the procedures and weather information sources used by a major airline’s dispatchers in the pre-flight route selection process in the presence of significant weather. Additionally, this paper will describe how the AWIN decision-support tool, an aide for selecting optimal four-dimensional routes that avoid weather hazards, could be incorporated into the flight dispatch process to produce safer, more fuel-efficient routes that avoid hazardous weather. During days with significant weather, dispatchers look at multiple, independent weather information sources to determine the impact of weather on their flights. Airlines typically have a pre-defined set of

This paper presents a new methodology for automated route selection for the construction of new power lines, based on geographic information systems (GIS). It uses a dynamic programming model for route optimization. Environmental restrictions are taken into account together with all of the operating, maintenance, and equipment installation costs, including a new approach to the costs associated with the slope of the terrain crossed by the power lines. The computing and visual representation capacities of GIS are exploited for the selection of economic corridors, keeping the total costs under a threshold imposed by the user. Intensive simulation examples illustrate the power and flexibility of the proposed methodology.

Generating satisfactory routes for driving is a challeng- ing task because the desirability of a particular route de- pends on many factors and varies from driver to driver. Current route advice systems present a single route to the driver based on static evaluation criteria, with little or no recourse if the driver finds this solution unsatisfac- tory. In this paper, we propose a more flexible approach and its implementation in the Adaptive Route Advisor. Our route advice agent interacts with the driver to gen- erate routes that he or she finds satisfactory, uses these interactions to build a model of the driver's preferences, and then uses the model to generate better routes for that driver in future interactions. As the preference model becomes more accurate, the need for interaction de- creases and the agent's autonomy increases. We also present a pilot study on using route selections to con- struct a personalized model of driver preferences.

The routing performance in Mobile Ad-hoc Networks (MANETs) relies on the cooperation of the individual nodes that constitute the network. The existence of misbehaving nodes may paralyze the routing operation in MANETs. To overcome this behavior, the trustworthiness of the network nodes should be considered in the route selection process combined with the hop count. The trustworthiness is achieved by measuring the trust value for each node in the network. In this paper, a new protocol based on self monitoring (agent-based) and following the dynamic source routing (DSR) algorithm is presented. This protocol is called Agent-Based Trusted Dynamic Source Routing (ATDSR) Protocol for MANETs. The objective of this protocol is to manage trust information locally with minimal overhead in terms of extra messages and time delay.. This objective is achieved through installing in each participated node in the network a multi-agent system (MAS). MAS consists of two types of agents: monitoring agent (MOA) and routing agent (ROA). A new mathematical and more realistic objective model for measuring the trust value is introduced. This model is weighted by both number and size of routed packets to reflect the "selective forwarding" behavior of a node. The performance evaluation via simulation shows that our protocol is better than standard and trusted DSR. The simulation is done over a variety of environmental conditions such as number of malicious nodes, host density and movement rates.

Incentive models are becoming increasingly popular in Mobile Peer to Peer Networks (M-P2P) as these models entice node participation in return for a virtual currency to combat free riding and to effectively manage constraint resources in the network. Many routing protocols proposed are based on best effort data traffic policy, such as the shortest route selection (hop minimization). Using virtual currency to find a cost effective optimal route from the source to the destination, while considering Quality of Service (QoS) aspects such as bandwidth and service capacity constraints for data delivery, remains a challenging task due to the presence of multiple paths and service providers. Modeling the network as a directed weighted graph and using the cost acquired from the price function as an incentive to pay the intermediate nodes in M-P2P networks to forward data, we develop a Game theoretic approach based on stochastic games to find an optimal route considering QoS aspect. The performance of our routing protocol is evaluated and compared with some existing routing protocols and the result shows that our protocol proves to be efficient compared to shortest-path DSR and multiple paths SMR in terms of average response time, energy and bandwidth utilization in the network.

A digital video camera was used to photograph ice blocks turned on edge by the passage of the icebreaker CCGS Des Groseilliers operating in the Canadian High Arctic in August 2002. Ice thickness was derived from photogrammetry to an accuracy of about 10%, with a possible negative bias of about 3%. Further (presumably negative) bias related to route selection is unknown. The average thickness of blocks measured during half-hour intervals of observation varied between 0.35 and 0.70 m; the higher values are likely indicative of second-year ice. The greatest thickness of any single block was less than 2 m. Histograms of thickness were nearly symmetric and approximately Gaussian. There is evidence to indicate that the scarcity of ridged ice reflects the ice conditions of the area and is not an artefact of the method. Based on ancillary wintertime data, the pack ice in open waters of the northeastern Archipelago thawed at about 0.02 m d-1 in the summer of 2002, about three times less rapidly than ice near the shore. Whereas coastal ice had vanished five weeks prior to our voyage, pack ice in Norwegian Bay, though thin, persisted until the end of September and became second-year ice. The difference is likely a consequence of the different microclimate near land, particularly with respect to the time of onset of the thaw season. RÉSUMÉ [Traduit par la rédaction] On a utilisé une caméra vidéo numérique pour photographier les blocs de glace retournés sur le côté par le passage du brise-glace NGCC Des Groseilliers pendant qu'il sillonnait l'Extrême-Arctique canadien en août 2002. L'épaisseur de la glace a été déterminée par photogrammétrie avec une précision d'environ 10 % et un biais négatif possible d'environ 3 %. Le biais supplémentaire (que l'on suppose négatif) lié à la route choisie n'est pas connu. L'épaisseur moyenne des blocs mesurés durant des intervalles d'observation d'une demi-heure a varié entre 0,35 et 0,70 m; les valeurs les plus élevées indiquent probablement de la glace de deuxième année. Les blocs les plus épais avaient moins de 2 m d'épaisseur. Les histogrammes d'épaisseur étaient à peu près symétriques et approximativement gaussiens. Certains éléments indiquent que la rareté des crêtes de glace correspond bien aux conditions glacielles dans la région et non à un artéfact de la méthode employée. D'après des données auxiliaires pour la période hivernale, la banquise dans les eaux navigable du nord-est de l'Archipel a fondu au taux d'environ 0,02 m j-1 durant l'été 2002, soit à peu près trois fois moins vite

We study the problem of supporting VoIP calls in a wireless mesh network. Specifically, we propose solutions for call admission control (CAC) and route selection for VoIP calls. Call admission decisions must evaluate how the capacity of the mesh network ...

The Korean government started to pay attention to the bicycle as a green transportation means to solve urban traffic problems caused by its automobile-centered road traffic policy and is establishing a plan for installing bike lanes first in the more developed areas. A number of municipal governments have installed bike lanes connecting short sections but the lanes are not used for everyday-life purpose. In the case of bike-friendly countries, bike culture has been settled with the use of leisure bikes increased. As for Korea, it is possible to build a network of bike lanes for leisure riding and for exploration of ecological culture across Korea based on topography centered on the four major rivers. In this regard, this study selected evaluation indicators for the basic design stage of the selection of routes for inter-area bikeway and suggested a relevant methodology, and applied the methodology for evaluation in a case study. The study considered the characteristics of leisure bikes to select the evaluation indicators and conducted AHP analysis. Through the analysis, the importance of five indicators for selection was estimated and applied, and in comparing the data surveyed, it was assumed that each item follows normal distribution and the normal distribution was standardized to calculate weight. The methodology of evaluating route selection for inter-area bikeway in this study proposed detailed evaluation criteria for the selection of routes for leisure bike lanes, which have yet to be established, and is expected to help policymakers' decision making.

By growing the use of real-time application on mobile devices, there is a challenge to provide reliable routing algorithm among these devices. We propose a new method in route selection for Ad hoc On demand Distance Vector (AODV) routing protocol which increases the reliability of the selected route. In this scheme for each node along route discovery, we determine two parameters, to calculate the routes reliability. To ensure the correctness of our method, we create a Colored Petri Net for the protocol. By applying the model, results show that the routing reliability is increased in comparison with standard AODV.

I. Introduction Car navigation device is widely gaining popular-ity as an important information source for safer and comfortable driving. Recently the need for develop-ing Intelligent Transport System (ITS) to promote the advancement of car navigation technology by pro-viding ...

Arctic conditions pose a number of challenges for the development of both onshore and offshore hydrocarbon fields. They are related to a number of factors, but the ice- covered sea during many months of the year present the key challenges. Ice scouring will particularly influence the design and route selection of submarine pipelines. The knowledge about the ice scouring phenomena is, however, rather limited for the time being. The ice scouring of the seabed by artificially produced ice ridges was therefore modelled in-situ in the Van Mijen fjord on Spitsbergen. The goal of the project was to investigate the interaction between the first-year ice ridge and the seabed. Particular attention was focused on studying the destruction of the keel of the ice ridge during the process of scouring. The present paper gives a general description and basic results of the conducted experiments.

Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, we show how the concept of skyline queries can be successfully adapted to routing problems considering multiple road attributes. In particular, we demonstrate how to compute several pareto-optimal paths which contain optimal results for a variety of user preferences. The PAROS-system has two main purposes. The first is to calculate the route skyline for a starting point and a destination. Our demonstrator visualizes the result set for up to three road attributes. Therefore, we provide a dual view on the computed skyline paths. The first view displays the result paths on the road map itself. The second view describes the result paths in the property space, displaying the trade-off between the underlying criteria. Thus, a user can browse through the results in order to find the path which fits best to his personal preferences. The second component of our system suits analysis issues. In this component, we illustrate the functionality of the underlying route skyline algorithm. Thus, we provide benchmark information about processing time and the search space visited during route skyline computation.

This paper reports results from a research project investigating users' navigation in a Virtual Environment (VE), using immersive Virtual Reality. The experiment was conducted to study the extent that certain features of the environment (ie, colors, windows, furniture, signage, ...

Most of the solutions proposed to support real-time (i.e. guaranteed performance) communication services in packetswitching networks adopt a connection-oriented and reservation-oriented approach. In such an approach, resource allocation and route selection decisions are made before the start of the communication on the basis of resource availability and realtime network load at that time, and are usually kept for the duration of the communication. This rather static resource management approach has certain limitations: it does not take into account (a) the dynamics of the communicating clients; (b) the dynamics of the network state; and (c) the tradeoff between quality of service and network availability, thus affecting the availability and flexibility of the real-time network services. Availability is the ability of the network to accommodate as many real-time clients as possible, while flexibility is the ability to adapt the real-time services to changing network state and client demands. In this paper, we present the Dynamic Connection Management (DCM) scheme, which addresses these issues by providing the network with the capability to dynamically modify the performance parameters and the routes of any existing real-time connection. With these capabilities, DCM can be used to increase the availability and flexibility of the guaranteed performance service offered to the clients.

The recent discovery of instability caused by the interaction of local routing policies of multiple ASes has led to extensive research on the subject. However, previous studies analyze stability under a specific route selection algorithm. In this paper, instead of studying a specific route selection algorithm, we study a general class of route selection algorithms which we call rational route selection algorithms. We present a sufficient condition to guarantee routing convergence in a heterogeneous network where each AS runs any rational route selection algorithm. Applying our general results, we study the potential instability of a network where the preference of an AS depends on not only its egress routes to the destinations but also its inbound traffic patterns (i.e., the distribution of incoming traffic from its neighbors). We show that there exist networks which will have persistent route oscillations even when the ASes strictly follow the constraints imposed by business considerations, and adopt any rational route selection algorithms.

In this paper we consider wireless mesh networks (WMNs) used to share the Internet connectivity of sparsely deployed fixed lines with heterogeneous capacity, ranging from ISP-owned high-speed links to subscriber-owned low-speed connections. If traffic is routed in the mesh without considering the load distribution and the bandwidth of Internet connections, some gateways may rapidly get overloaded because they are selected

This paper presents an energy and environmental network analysis model to explore tradeoffs associated with freight transport. The geospatial model uses an intermodal network built by the authors to connect various modes (rail, road, water) via intermodal terminals. Routes along the network are characterized not only by temporal and distance attributes, but also by cost, energy, and emissions attributes (including emissions of carbon dioxide, particulate matter, sulfur oxides, volatile organic compounds, and oxides of nitrogen). Decision-makers can use the model to explore tradeoffs among alternative route selection across different modal combinations, and to identify optimal routes for objectives that feature energy and environmental parameters (e.g., minimize carbon dioxide emissions). The model is demonstrated with three case studies of freight transport along the U.S. eastern seaboard. IMPLICATIONS Freight transportation represents a large and growing component of global energy demand and emissions inventories. This paper discusses the environmental impacts of freight and presents a model that allows analysts to evaluate tradeoffs in an intermodal freight transportation context. The results shed new light on how we think about freight transportation and the importance of these energy, environmental, and economic tradeoffs.

A Mobile Ad Hoc Network (MANET) is a collection of wireless mobile terminals that are able to dynamically form a temporary network without any aid from fixed infrastructure or centralized administration. MANETs are strongly impacted by the mobility of the ad hoc nodes. Path broken, which is caused by node mobility , leads to the rerouting operations and the degradation of network performance. One critical issue for routing in MANETs is how to select reliable path that can last as long as possible. This paper will address the previous study on how to measure link availability or reliability in order to find more reliable paths. To solve this problem, a criterion that can judge the link reliability is needed. The metric for routing selection in terms of path availability which is based on link availability can be used to select reliable path.

The 'no development' option is traditionally considered as one of the alternatives in an environmental impact assessment (EIA). This paper highlights the difficulty of considering this option in an underdeveloped context, using the example of an EIA for a power line to an ecotourism development in KwaZulu-Natal, South Africa. The area is ecologically sensitive and there was opposition from environmental action groups, but there are urgent and basic human needs to be met. The power line would improve the living conditions of the local rural community. Once the 'no development' option was rejected, attention focused on an optimum route selection and the recommendation of environmental management guidelines to minimise the impacts on the environment.

We present three dynamic routing and wavelength assignment (RWA) algorithms that are intended for multifiber WDM networks without wavelength converters. For networks with a large number of wavelengths per fiber and/or a large number of fibers per link, our algorithms exhibit particularly good performance, and one of them significantly outperforms other existing algorithms. In response to a connection request, our algorithms first select a physical route among a set of predetermined routes on the basis of some per-route variables. The algorithms then select a wavelength to be used with the selected route. This paper illustrates how we can rethink the criteria for route selection in multifiber networks. We also suggest a method of selecting the set of predetermined routes to balance the traffic load. Our simulation results illustrate that this method exhibits significantly lower blocking probability than the traditional shortest-route-based method. Thus, this paper also illustrates that the choice of predetermined routes can significantly affect the blocking probability of an RWA.

Increased use of demanding network applications, as well as the increase of unwanted network traffic in the form of DDoS attacks, are putting new pressures on service providers to meet the expectations of customers in terms of network availability and performance. Providers are expected to deal with potential problems in near real-time fashion. Further, many of these demanding application, such

ABSTRACT: A suburban ad-hoc network (SAHN) aims to provide an inexpensive, secure, broadband, cooperative network using wireless technology. There exists a plethora of ad-hoc wireless routing solutions designed to route efficiently in mobile environments. Due to the ...

Abstract — Wireless Sensor Networks are characterized for being composed for a large number of node that are distributed geographically in a monitoring area. Considering this distribution and the restrictions of processing, memory and energy of this equipment, it becomes ...

Shortest, fastest, simplest or most scenic route are common route selection criteria for navigating a street network. The computation of the most scenic route in electronic route planners is especially challenging. Firstly, scenery is a desirable route characteristics, i.e., a benefit criterion, so that the route with the highest number of scenic areas cannot be found with a shortest path algorithm. And secondly, the user is interested in a compromise route that finds a balance between attractive sections and route detour. This paper examines the usability of a standard shortest path computation for finding scenic routes in a street network. Hereby traverse costs of edges running within buffers around attractive places are reduced. The method is evaluated with a test street network in Fort Lauderdale, Florida. 1

For IP networks to become a service oriented architecture, it is crucial to provision a network architecture that is capable of differentiating and supporting quality of services (QoS) to applications. In this paper we propose a new end-to-end QoS framework, called End-Diff, that has a number of desirable properties. The new architecture has the scalability property of DiffServ, pioneers a

To truly realize potential ofMANET, multimedia services must be provisioned with a minimum level ofQoS. To meet the QoS requirement of such services, many attributes need to be considered. To keep the routing process lightweight, standard QoS aware routing protocol in MANET works with one or two such parameters. In this paper, we have proposed an on-demand source routing protocol for MANET that works with six important QoS attributes by varying priority for different category oftraffic flow. We have reflected this variation by incorporating Analytic Hierarchy Process in the proposal.

We presents a power-aware routing protocol called Multi-Route Transmission Routing that utilizes multiple routes to transmit the data traffic simultaneously and leads to a balanced energy consumption. The proposed routing approach can extend the system lifetime of the network. A new routing decision index is also proposed for the route selection mechanism, which takes both the shortest-path and the maximum system lifetime into consideration and dynamically adjusts its weight between them according to the energy usage of the network. Experiment results show that, the proposed routing protocol provides a higher performance than other well-known power-aware routing protocols in terms of the energy-efficiency.

The lack of an effective cooperation between the data, control and management plane of QoS routing solutions presented so far, prevents the implementation of service differentiation in the context of pure IP-based networks. Most of paths calculation proposals performed by the control plane are unaware of service characteristics of each flow. Scalable data plane QoS proposals ignore the issue about selecting the best paths to route the traffic. Proposed management plane schemes do not perform the network state maintenance and service level monitoring. Multi-service routing is a flow-based forwarding protocol that implements the service differentiation in pure IP-based networks, using a straight cooperation between data, control and management plane. This cooperation is accomplished by a data plane supporting the DiffServ model and performs route selection based on flows service class, which is exploited by the management plane to carry out the network state maintenance, and performance monitoring by using the RTCP protocol, to provide service metrics to control plane for route calculation. Simulation experiments show better performance results achieved by Multi-service routing compared to those obtained by traditional link state protocol with the DiffServ model and QoS routing in heavy loaded network scenarios of mixed traffic having different service requirements.

We present a novel computational method for advicegeneration in path selection problems which are difficult for people to solve. The advisor agent's interests may conflict with the interests of the people who receive the advice. Such optimization settings arise in many human-computer applications in which agents and people are self-interested but also share certain goals, such as automatic route-selection systems that also reason about environmental costs. This paper presents an agent that clusters people into one of several types, based on how their path selection behavior adheres to the paths presented to them by the agent who does not necessarily suggest their most preferred paths. It predicts the likelihood that people deviate from these suggested paths and uses a decision theoretic approach to suggest paths to people which will maximize the agent's expected benefit given the people's deviations. This technique was evaluated empirically in an extensive study involving hundreds of human subjects solving the path selection problem in mazes. Results showed that the agent was able to outperform alternative methods that solely considered the benefit to the agent or the person, or did not provide any advice.

this paper we will describe the approach adopted by the REFORM system for cost effective VPC network design. In order to achieve cost-effectiveness of VPC network design, a functional component, namely the VPC Layer Design component, has been specified, designed, implemented and tested. This component consists of a number of interacting algorithms, specifically, 1) the Connection Route Design algorithm, 2) the Working VPC Route Design algorithm, 3) the Protection VPC Route Design algorithm and 4) the VPC Route Reconfiguration algorithm. In this paper we will present specification, design and implementation issues for the first two algorithms. Furthermore an assessment of correctness and effectiveness of the algorithms is presented based on experimental results. The design, implementation and experimental results for the latter two algorithms will be presented in a forthcoming paper. 2. VPC Layer Design

This paper presents a new methodology for automated route selection for the construction of new power lines, based on geographic information systems (GIS). It uses a dynamic programming model for route optimization. Environmental restrictions are taken into account together with all of the operating, maintenance, and equipment installation costs, including a new approach to the costs associated with the slope of the terrain crossed by the power lines. The computing and visual representation capacities of GIS are exploited for the selection of economic corridors, keeping the total costs under a threshold imposed by the user. Intensive simulation examples illustrate the power and flexibility of the proposed methodology.