10,459 research outputs found
Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand
We study a class of robust network design problems motivated by the need to
scale core networks to meet increasingly dynamic capacity demands. Past work
has focused on designing the network to support all hose matrices (all matrices
not exceeding marginal bounds at the nodes). This model may be too conservative
if additional information on traffic patterns is available. Another extreme is
the fixed demand model, where one designs the network to support peak
point-to-point demands. We introduce a capped hose model to explore a broader
range of traffic matrices which includes the above two as special cases. It is
known that optimal designs for the hose model are always determined by
single-hub routing, and for the fixed- demand model are based on shortest-path
routing. We shed light on the wider space of capped hose matrices in order to
see which traffic models are more shortest path-like as opposed to hub-like. To
address the space in between, we use hierarchical multi-hub routing templates,
a generalization of hub and tree routing. In particular, we show that by adding
peak capacities into the hose model, the single-hub tree-routing template is no
longer cost-effective. This initiates the study of a class of robust network
design (RND) problems restricted to these templates. Our empirical analysis is
based on a heuristic for this new hierarchical RND problem. We also propose
that it is possible to define a routing indicator that accounts for the
strengths of the marginals and peak demands and use this information to choose
the appropriate routing template. We benchmark our approach against other
well-known routing templates, using representative carrier networks and a
variety of different capped hose traffic demands, parameterized by the relative
importance of their marginals as opposed to their point-to-point peak demands
Recommended from our members
Survey of unified approaches to integrated-service networks
The increasing demand for communication services, coupled with recent technological advances in communication media and switching techniques, has resulted in a proliferation of new and expanded services. Currently, networks are needed which can transmit voice, data, and video services in an application-independent fashion. Unified approaches employ a single switching technique across the entire network bandwidth, thus, allowing services to be switched in an application-independent manner. This paper presents a taxonomy of integrated-service networks including a look at N-ISDN, while focusing on unified approaches to integrated-service networks.The two most promising unified approaches are burst and fast packet switching. Burst switching is a circuit switching-based approach which allocates channel bandwidth to a connection only during the transmission of "bursts" of information. Fast packet switching is a packet switching-based approach which can be characterized by very high transmission rates on network links and simple, hardwired protocols which match the rapid channel speed of the network. Both approaches are being proposed as possible implementations for integrated-service networks. We survey these two approaches, and also examine the key performance issues found in fast packet switching. We then present the results of a simulation study of a fast packet switching network
Traffic congestion in interconnected complex networks
Traffic congestion in isolated complex networks has been investigated
extensively over the last decade. Coupled network models have recently been
developed to facilitate further understanding of real complex systems. Analysis
of traffic congestion in coupled complex networks, however, is still relatively
unexplored. In this paper, we try to explore the effect of interconnections on
traffic congestion in interconnected BA scale-free networks. We find that
assortative coupling can alleviate traffic congestion more readily than
disassortative and random coupling when the node processing capacity is
allocated based on node usage probability. Furthermore, the optimal coupling
probability can be found for assortative coupling. However, three types of
coupling preferences achieve similar traffic performance if all nodes share the
same processing capacity. We analyze interconnected Internet AS-level graphs of
South Korea and Japan and obtain similar results. Some practical suggestions
are presented to optimize such real-world interconnected networks accordingly.Comment: 8 page
Universal flux-fluctuation law in small systems
We thank Dr. DeMenezes for providing the microchip data. This work was partially supported by the NSF of China under Grant Nos. 11135001, 11275003. Y.C.L. was supported by ARO under Grant No. W911NF-14-1-0504.Peer reviewedPublisher PD
Optimal routing on complex networks
We present a novel heuristic algorithm for routing optimization on complex
networks. Previously proposed routing optimization algorithms aim at avoiding
or reducing link overload. Our algorithm balances traffic on a network by
minimizing the maximum node betweenness with as little path lengthening as
possible, thus being useful in cases when networks are jamming due to queuing
overload. By using the resulting routing table, a network can sustain
significantly higher traffic without jamming than in the case of traditional
shortest path routing.Comment: 4 pages, 5 figure
Enriching the tactical network design of express service carriers with fleet scheduling characteristics
Express service carriers provide time-guaranteed deliveries of parcels via a network consisting of nodes and hubs. In this, nodes take care of the collection and delivery of parcels, and hubs have the function to consolidate parcels in between the nodes. The tactical network design problem assigns nodes to hubs, determines arcs between hubs, and routes parcels through the network. Afterwards, fleet scheduling creates a schedule for vehicles operated in the network. The strong relation between flow routing and fleet scheduling makes it difficult to optimise the network cost. Due to this complexity, fleet scheduling and network design are usually decoupled. We propose a new tactical network design model that is able to include fleet scheduling characteristics (like vehicle capacities, vehicle balancing, and drivers' legislations) in the network design. The model is tested on benchmark data based on instances from an express provider, resulting in significant cost reductions
Multi Agent Systems in Logistics: A Literature and State-of-the-art Review
Based on a literature survey, we aim to answer our main question: ĂąâŹĆHow should we plan and execute logistics in supply chains that aim to meet todayĂąâŹâąs requirements, and how can we support such planning and execution using IT?ù⏠TodayĂąâŹâąs requirements in supply chains include inter-organizational collaboration and more responsive and tailored supply to meet specific demand. Enterprise systems fall short in meeting these requirements The focus of planning and execution systems should move towards an inter-enterprise and event-driven mode. Inter-organizational systems may support planning going from supporting information exchange and henceforth enable synchronized planning within the organizations towards the capability to do network planning based on available information throughout the network. We provide a framework for planning systems, constituting a rich landscape of possible configurations, where the centralized and fully decentralized approaches are two extremes. We define and discuss agent based systems and in particular multi agent systems (MAS). We emphasize the issue of the role of MAS coordination architectures, and then explain that transportation is, next to production, an important domain in which MAS can and actually are applied. However, implementation is not widespread and some implementation issues are explored. In this manner, we conclude that planning problems in transportation have characteristics that comply with the specific capabilities of agent systems. In particular, these systems are capable to deal with inter-organizational and event-driven planning settings, hence meeting todayĂąâŹâąs requirements in supply chain planning and execution.supply chain;MAS;multi agent systems
Integrating fluctuations into distribution of resources in transportation networks
We propose a resource distribution strategy to reduce the average travel time
in a transportation network given a fixed generation rate. Suppose that there
are essential resources to avoid congestion in the network as well as some
extra resources. The strategy distributes the essential resources by the
average loads on the vertices and integrates the fluctuations of the
instantaneous loads into the distribution of the extra resources. The
fluctuations are calculated with the assumption of unlimited resources, where
the calculation is incorporated into the calculation of the average loads
without adding to the time complexity. Simulation results show that the
fluctuation-integrated strategy provides shorter average travel time than a
previous distribution strategy while keeping similar robustness. The strategy
is especially beneficial when the extra resources are scarce and the network is
heterogeneous and lowly loaded.Comment: 14 pages, 4 figure
Navigability of temporal networks in hyperbolic space
Information routing is one of the main tasks in many complex networks with a
communication function. Maps produced by embedding the networks in hyperbolic
space can assist this task enabling the implementation of efficient navigation
strategies. However, only static maps have been considered so far, while
navigation in more realistic situations, where the network structure may vary
in time, remain largely unexplored. Here, we analyze the navigability of real
networks by using greedy routing in hyperbolic space, where the nodes are
subject to a stochastic activation-inactivation dynamics. We find that such
dynamics enhances navigability with respect to the static case. Interestingly,
there exists an optimal intermediate activation value, which ensures the best
trade-off between the increase in the number of successful paths and a limited
growth of their length. Contrary to expectations, the enhanced navigability is
robust even when the most connected nodes inactivate with very high
probability. Finally, our results indicate that some real networks are
ultranavigable and remain highly navigable even if the network structure is
extremely unsteady. These findings have important implications for the design
and evaluation of efficient routing protocols that account for the temporal
nature of real complex networks.Comment: 10 pages, 4 figures. Includes Supplemental Informatio
- âŠ