Home | Issues | Profile | History | Submission | Review
Vol: 58(72) No: 2 / June 2013        

Requirements for Time Based Graph Structuring with Specialized and Generalized Path Choice Routing
Stefano-Niko Orzen
Department of Computers, Politehnica University of Timisoara, Faculty of Automation and Computers, Bd. V. Parvan 2, 300223 Timisoara, Romania, e-mail: niko.orzen@cs.upt.ro

Keywords: graph structuring, generalized path choice, networks, requirements, routing

This paper presents the necessities in establishing a well-timed route and communication feature that is organized with graph network representations. As each implementation requires a good logical organization, graph representations can help the management and organization of resources all as communication paths that have the privilege of choosing a route which fits an optimal timing scheme. Development strategies all infer a degree of usefulness to the topological placing of network nodes and hosts, usage that is case handled with specialization features highlighting an efficient scheme, that guides alternate rerouting methods for a better infrastructure usage and also generalizing specific functions, that are able to handle distributional misuse of logical data link, network and transport levels of inaccuracy. The solutions to such organizational performance applications of network connectionism are understandably analyzed given technical considerations and pragmatic usage, all being specified with respect to time implementation programmable usage.

[1] K. A. Ahmat, Graph Theory and Optimization Problems for Very Large Networks, USA.
[2] J. H. Saltzer, D. P. Reed and D. D. Clark, End-to-End Arguments in System Design.
[3] W. J. Dally, B. Towles, Route Packets, Not Wires: On-Chip Interconnection Networks, Computer Systems Laboratory, Stanford University, Stanford.
[4] A. Este, F. Gringoli, L. Salgarelli, Support Vector Machines for TCP Traffic Classification, Preprint submitted to Computer Networks, 12 May 2009.
[5] A. T. Campbell, Herman G. De Meer, M. E. Kounavis, K. Miki, J. B. Vicente, D. Villela, A Survey of Programmable Networks, Center for Telecommunications Research.
[6] A. D. Jaggard, V. Ramachandran, R. N. Wright, The Impact of Communication Models on Routing-Algorithm Convergence, Proceedings of 29th IEEE Conference on Distributed Computing Systems, 2009.
[7] F. Kuhn, N. Lynch, R. Oshman, Distributed Computation in Dynamic Networks.
[8] Y. Yang, J. Wang, R. Kravets, Designing Routing Metrics for Mesh Networks.
[9] M. Scharf, Comparison Of End-To-End And Network-Supported Fast Startup Congestion Control Schemes, Elsevier, 2011.
[10] C. Curino, E. Jones, Y. Zhang, S. Madden, Schism: A Workload Driven Approach to Database Replication and Partitioning, Proceedings of the VLDB Endowment, Vol. 3, No. 1, 2010.
[11] J. Rajahalme, M. Särelä, K. Visala, J. Riihijärvi, On Name-Based Inter-Domain Routing, Computer Networks 55 (2011) 975–986, Elsevier.
[12] T. M. Jaafar, G. F. Riley, D. Reddy, D. Blair, Simulation-Based Routing Protocol Performance Analysis – A Case Study, Proceedings of the 2006 Winter Simulation Conference, IEEE.
[13] L. Wang, A K M Mahmudul Hoque, Cheng Yiy, Adam Alyyan, Beichuan Zhangy, OSPFN: An OSPF Based Routing Protocol for Named Data Networking, Technical Report NDN-0003, 2012.
[14] M. Ashworth, I. J. Bush, M. F. Guest, Vector vs. Scalar Processors: A Performance Comparison Using a Set of Computational Science Benchmarks, CUG 2005 Proceedings.
[15] S. Kurkure, U. Bellur, Vertex Coloring in Distributed Environment, April 5, 2006.
[16] S. Ma, Y. Cao, J. Huai, T. Wo, Distributed Graph Pattern Matching, WWW 2012 – Session: Data and Content Management 2 April 16–20, 2012, Lyon, France.
[17] C.Wang, L. Chen, Continuous Subgraph Pattern Search over Graph Streams, Proceedings of IEEE International Conference on Data Engineering, 2009.
[18] C. J.C. Burges, A Tutorial on Support Vector Machines for Pattern Recognition, Kluwer Academic Publishers, Boston.
[19] http://www.cs.berkeley.edu/~demmel/cs267/lecture18/lecture18.html.
[20] http://www.cs.berkeley.edu/~demmel/cs267/lecture18/lecture18.html.
[21] http://en.wikipedia.org/wiki/Topological_space.
[22] http://www.nature.com/srep/2012/120625/srep00469/full/srep00469.html.
[23] Gilles Foucault, Jean-Christophe Cuilliere, Vincent Francois, Jean-Claude Leon, Roland Maranzana, Adaptation of CAD model topology for finite element analysis, Computer-Aided Design, Vol. 40, pp. 176–196, ELSEVIER, www.sciencedirect.com, 2008.
[24] http://www.sciencedirect.com/science/article/pii/S0140366405004275.
[25] http://www.nature.com/srep/2012/120625/srep00469/full/srep00469.html.
[26] http://www.nature.com/srep/2012/120625/srep00469/full/srep00469.html.
[27] http://www.tutorvista.com/content/physics/physics-i/motion/distance-time.php.
[28] http://fourier.eng.hmc.edu/e102/lectures/Z_Transform/node1.html.
[29] http://www.palgrave-journals.com/jit/journal/v21/n4/fig_tab/2000077f2.html.
[30] Nick Feamster, Jared Winick, Jennifer Rexford, A Model of BGP Routing for Network Engineering, SIGMETRICS/Performance \'04, 12 – 14 June, 2004, New York, USA.
[31] Nick Feamster, Jared Winick, Jennifer Rexford, A Model of BGP Routing for Network Engineering, MIT Computer Science & AI Lab, feamster@csail.mimt.edu, Lockheed Martin, jared.winick@lmco.com, AT&T Labs – Research, jrex@research.att.com, SIGMETRICS/Performance \'04, 12 – 14 June, 2004, New York, USA.
[32] http://www.h3c.com/portal/Products___Solutions/Technology/IP_Routing/Technology_Introduction/200702/201240_57_0.htm.
[33] http://www.h3c.com/portal/Products___Solutions/Technology/IP_Routing/Technology_Introduction/200702/201240_57_0.htm.
[34] http://www.sciencedirect.com/science/article/pii/S0920548904001059.
[35] http://www.caida.org/projects/internetatlas/gallery/ascore/.
[36] http://www.freepatentsonline.com/6879594.html.
[37] http://bradhedlund.com/2010/05/07/setting-the-stage-for-trill/.