Cost-Based Topology Optimization of Embedded Ethernet Networks

During past decades, Ethernet progressively became the most widely used Local Area Network LAN technology. Apart from LAN installations, Ethernet also became attractive for other application areas such as industrial control, automotive, and avionics. In traditional LAN design, the objective is to minimize the network deployment cost. However, in embedded networks, additional constraints and ambient conditions add to the complexity of the problem. In this paper, the authors propose a Simulated Annealing SA algorithm to optimize the physical topology of an embedded Ethernet network. The various constraints and ambient conditions are modeled by a cost map. For networks with small number of nodes and/or switches, the authors were able to find the optimal solutions using adapted algorithms. These solutions will serve as a lower bound for the solutions obtained via the SA algorithm. However, the adapted algorithms are time consuming and application specific. The paper shows that the SA algorithm can be applied in all cases and finds near-optimal solutions.

[1]  J. Minuth.  FlexRay™ electrical physical layer: Theory, components and examples , 2012, 2012 14th International Conference on Transparent Optical Networks (ICTON).

[2]  Teofilo F. Gonzalez,et al.  Handbook of Approximation Algorithms and Metaheuristics (Chapman & Hall/Crc Computer & Information Science Series) , 2007 .

[3]  Matthias Pätzold,et al.  A spatial simulation model for shadow fading processes in mobile radio channels , 2004, 2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754).

[4]  Jakub Marecek,et al.  Handbook of Approximation Algorithms and Metaheuristics , 2010, Comput. J..

[5]  Biswanath Mukherjee,et al.  Some principles for designing a wide-area WDM optical network , 1996, TNET.

[6]  Varadharajan Sridhar,et al.  An Approach to Solving the Survivable Capacitated Network Design Problem , 2005, Int. J. Bus. Data Commun. Netw..

[7]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[8]  David S. Johnson,et al.  The Complexity of Computing Steiner Minimal Trees , 1977 .

[9]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[10]  C.J.H. Mann,et al.  Handbook of Approximation: Algorithms and Metaheuristics , 2008 .

[11]  Jörg Sommer,et al.  Topology Optimization of In-vehicle Multimedia Communication Systems , 2008 .

[12]  Lara Khansa,et al.  Using Real Options Theory to Evaluate Strategic Investment Options for Mobile Content Delivery: A Case Study , 2010, Int. J. Bus. Data Commun. Netw..

[13]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook , 2009, Chapman & Hall/CRC Applied Algorithms and Data Structures series.

[14]  Tapani Ahonen,et al.  Topology optimization for application-specific networks-on-chip , 2004, SLIP '04.

[15]  Debashis Saha,et al.  Next Generation Data Communication Technologies: Emerging Trends , 2011 .

[16]  Mikhail J. Atallah,et al.  Algorithms and Theory of Computation Handbook, Second Edition, Volume 1: General Concepts and Techniques , 2009 .

[17]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[18]  Tobias Achterberg,et al.  SCIP: solving constraint integer programs , 2009, Math. Program. Comput..

[19]  Max Crochemore,et al.  Algorithms and Theory of Computation Handbook , 2010 .

[20]  Ding-Zhu Du,et al.  Steiner tree problems in computer communication networks , 2008 .

[21]  Anil Pahwa,et al.  Distribution system design optimization for cold load pickup , 1996 .

[22]  Eckehard G. Steinbach,et al.  Traffic Shaping for Resource-Efficient In-Vehicle Communication , 2009, IEEE Transactions on Industrial Informatics.

[23]  G. Giordano,et al.  Performance analysis of different network topologies for in-vehicle audio and video communication , 2008, 2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks.

[24]  R. Vidal.  Applied simulated annealing , 1993 .

[25]  Yves Crama,et al.  Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.

[26]  Hui Xiong,et al.  Manhattan Distance , 2008, Encyclopedia of GIS.

[27]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[28]  Max Felser,et al.  Real-Time Ethernet - Industry Prospective , 2005, Proceedings of the IEEE.

[29]  Georgios B. Giannakis,et al.  A two-dimensional channel simulation model for shadowing processes , 2003, IEEE Trans. Veh. Technol..

[30]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[31]  J. K. Lenstra,et al.  Local Search in Combinatorial Optimisation. , 1997 .

[32]  Sebastian Gunreben,et al.  Ethernet – A Survey on its Fields of Application , 2010, IEEE Communications Surveys & Tutorials.

[33]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[34]  R. Bogenberger,et al.  A Novel Network Architecture for In-Vehicle Audio and Video Communication , 2007, 2007 2nd IEEE/IFIP International Workshop on Broadband Convergence Networks.

[35]  Jean-Dominique Decotignie,et al.  Ethernet-Based Real-Time and Industrial Communications , 2005, Proceedings of the IEEE.