Network planning and design

About: Network planning and design is a research topic. Over the lifetime, 12393 publications have been published within this topic receiving 229776 citations. The topic is also known as: network design.

Next generation on-chip networks: what kind of congestion control do we need?

Abstract: In this paper, we present network-on-chip (NoC) design and contrast it to traditional network design, highlighting core differences between NoCs and traditional networks. As an initial case study, we examine network congestion in bufferless NoCs. We show that congestion manifests itself differently in a NoC than in a traditional network, and with application-level awareness in the network to make proper throttling decisions we improve system performance by up to 28%. It is our hope that the unique and interesting challenges of on-chip network design can be met by novel and effective solutions from the networking community.

Liner hub-and-spoke shipping network design

Abstract: This paper proposes a liner hub-and-spoke shipping network design problem by introducing the concept of a main port, as well as some container shipping constraints such as multi-type container shipment and transit time constraints, which are seldom considered in the previous studies. It develops a mixed-integer programming model with nonconvex multi-linear terms for the proposed problem. An efficient genetic algorithm embedded with a multi-stage decomposition approach is developed to solve the model. Numerical experiments are carried out to assess the effectiveness of the proposed model and the efficiency of the proposed algorithm.

Integrated operations planning and revenue management for rail freight transportation

Abstract: In the rail industry, profit maximization relies heavily on the integration of logistics activities with an improved management of revenues. The operational policies chosen by the carrier have an important impact on the network yield and thus on global profitability. This paper bridges the gap between railroad operations planning and revenue management. We propose a new bilevel mathematical formulation which encompasses pricing decisions and network planning policies such as car blocking and routing as well as train make-up and scheduling. An exact solution approach based on a mixed integer formulation adapted to the problem structure is presented, and computational results are reported on randomly generated instances.

On the instantaneous topology of a large-scale urban vehicular network: the cologne case

Abstract: Despite the growing interest in a real-world deployment of vehicle- to-vehicle communication, many topological features of the resulting vehicular network remain largely unknown. We still lack a clear understanding of the level of connectivity achievable in large-scale urban scenarios, of the availability and reliability of connected multi-hop paths, and of the evolution of such features over daytime. In this paper, we investigate how the instantaneous topology of the vehicular network would look like in the case of Cologne, Germany, a typical middle-sized European city. Through a complex network analysis, we unveil the low connectivity, availability, reliability and navigability of the network, and exploit our findings to derive network design and usage guidelines.

Demand-wise Shared Protection for Meshed Optical Networks

Abstract: In this paper, a new shared protection mechanism for meshed optical networks is presented. Significant network design cost reductions can be achieved in comparison to the well-known 1+1 protection scheme. Demand-wise Shared Protection (DSP) is based on the diversification of demand routings and exploits the network connectivity to restrict the number of backup lightpaths needed to provide the desired level of protection. Computational experiments illustrate the benefits of the DSP concept for cost efficient optical network designs.