Research on routing algorithm based on limitation arrangement principle in mathematics.

*(English)*Zbl 1407.90062Summary: Since the research on information consistency of the whole network under OSPF protocol has been insufficient in recent years, an algorithm based on limitation arrangement principle for routing decision is proposed and it is a permutation and combination problem in mathematical area. The most fundamental function of this algorithm is to accomplish the information consistency of the whole network at a relatively fast speed. Firstly, limitation arrangement principle algorithm is proposed and proved. Secondly, LAP routing algorithm in single link network and LAP routing algorithm in single link network with multiloops are designed. Finally, simulation experiments are worked by VC6.0 and NS2, which proves that LAPSN algorithm and LAPSNM algorithm can solve the problem of information consistency of the whole network under OSPF protocol and LAPSNM algorithm is superior to Dijkstra algorithm.

##### MSC:

90B06 | Transportation, logistics and supply chain management |

PDF
BibTeX
XML
Cite

\textit{J. Lv} et al., Math. Probl. Eng. 2014, Article ID 539793, 11 p. (2014; Zbl 1407.90062)

Full Text:
DOI

##### References:

[1] | Tanenbaum, A. S., Computer Networks, (2012), Beijing, China: Tsinghua University Press, Beijing, China |

[2] | Senouci, S. M.; Pujolle, G., Minimization of energy consumption in ad hoc networks, Annales des Telecommunications, 60, 3-4, 500-518, (2005) |

[3] | Saravanakumar, U.; Rangarajan, R., Energy and throughput analysis of multicast routing algorithm for 2D mesh network on chip, Procedia Engineering, 30, 2, 144-151, (2012) |

[4] | Wei, L.; Lele, W., Ant colony optimization routing algorithm based on WSN, ICIC Express Letters, Part B: Applications, 4, 3, 541-547, (2013) |

[5] | Ma, H.-D., Internet of things: objectives and scientific challenges, Journal of Computer Science and Technology, 26, 6, 919-924, (2011) |

[6] | Rothfus, D.; Dunning, C.; Chen, X., Social-similarity-based routing algorithm in delay tolerant networks, Proceedings of the IEEE International Conference on Communications (ICC ’13), IEEE |

[7] | Adulyasak, Y.; Cordeau, J.-F.; Jans, R., Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems, INFORMS Journal on Computing, 26, 1, 103-120, (2014) · Zbl 1356.90011 |

[8] | Castagnetti, A.; Pegatoquet, A.; Le, T. N.; Auguin, M., A joint duty-cycle and transmission power management for energy harvesting WSN, IEEE Transactions on Industrial Informatics, 10, 2, 928-936, (2014) |

[9] | Ma, H.-D., Internet of things: objectives and scientific challenges, Journal of Computer Science & Technology, 26, 6, 919-924, (2011) |

[10] | Rothfus, D.; Dunning, C.; Chen, X., Social-similarity-based routing algorithm in Delay Tolerant Networks, Proceedings of the IEEE International Conference on Communications (ICC ’13) |

[11] | Murota, K.; Shioura, A., Dijkstra’s algorithm and L-concave function maximization, Mathematical Programming, 145, 1-2, 163-177, (2014) · Zbl 1300.90039 |

[12] | Rubio-Largo, Á.; Vega-Rodríguez, M. A., Applying MOEAs to solve the static routing and wavelength assignment problem in optical WDM networks, Engineering Applications of Artificial Intelligence, 26, 5-6, 1602-1619, (2013) |

[13] | Nancharaiah, B.; Chandra Mohan, B., The performance of a hybrid routing intelligent algorithm in a mobile ad hoc network, Computers & Electrical Engineering, 40, 4, 1255-1264, (2014) |

[14] | Jiang, J.; Li, W.; Luo, J.; Tan, J., A network accountability based verification mechanism for detecting inter-domain routing path inconsistency, Journal of Network and Computer Applications, 36, 6, 1671-1683, (2013) |

[15] | Cervera, G.; Barbeau, M.; Garcia-Alfaro, J.; Kranakis, E., A multipath routing strategy to prevent flooding disruption attacks in link state routing protocols for MANETs, Journal of Network and Computer Applications, 36, 2, 744-755, (2013) |

[16] | Kok, G.-X.; Chow, C.-O.; Xu, Y.-H.; Ishii, H., EAOMDV-MIMC: a multipath routing protocol for multi-interface multi-channel mobile ad-hoc networks, Wireless Personal Communications, 73, 3, 477-504, (2013) |

[17] | Kevin, F., Chuck vest RIP, Issues in Science and Technology, 30, 2, 19-20, (2014) |

[18] | Shi, L.; Lv, J. H., Routing decision algorithm based on limit arrangement, Application Research of Computers, 31, 1, 257-260, (2014) |

[19] | Wille, E. C. G.; Tenório, M. M., Considering packet loss probability in fault-tolerant OSPF routing, IEEE Latin America Transactions, 12, 2, 248-255, (2014) |

[20] | Murota, K.; Shioura, A., Dijkstra’s algorithm and L-concave function maximization, Mathematical Programming, 145, 1-2, 163-177, (2014) · Zbl 1300.90039 |

[21] | Peeta, S.; Paz, A., Behavior-consistent within-day traffic routing under information provision, Proceedings of the IEEE Intelligent Transportation Systems Conference (ITSC ’06) |

[22] | Paz, A.; Peeta, S., Fuzzy control model optimization for behavior-consistent traffic routing under information provision, IEEE Transactions on Intelligent Transportation Systems, 9, 1, 27-37, (2008) |

[23] | Paz, A.; Peeta, S., Behavior-consistent real-time traffic routing under information provision, Transportation Research Part C: Emerging Technologies, 17, 6, 642-661, (2009) |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.