Convergence of the Key Algorithm of Traffic-Flow Analysis

Lencse, Gábor; Muka, László
June 2006
Journal of Computing & Information Technology;Jun2006, Vol. 14 Issue 2, p133
Academic Journal
The traffic-flow analysis (TFA) [1] is a novel method for the performance estimation of communication systems. TFA is a combination of simulation and numerical methods. In the first step, TFA distributes the traffic in units of properly chosen size using the actual routing algorithm of the network. In the second step, TFA adjusts the time distribution of the traffic according to the finite capacities of the network. The convergence of the algorithm used in the second step of TFA is proven in this paper. The speed of convergence is also examined.


Related Articles

  • Discrete-time high-order distributed consensus algorithm. PENG Huan-xin; QI Guo-qing; SHENG An-dong // Application Research of Computers / Jisuanji Yingyong Yanjiu;Sep2013, Vol. 30 Issue 9, p2700 

    In order to improve the convergence rate of distributed consensus algorithms, this paper proposed a discrete-time high-order distributed consensus algorithm. The new high-order algorithm utilized the previous state values of two-hop adjacency nodes to accelerate the convergence rate based on...

  • PENALTY FUNCTION SOLUTION TO PATTERN SYNTHESIS OF ANTENNA ARRAY BY A DESCENT ALGORITHM. Tiaojun Zeng; Quanyuan Feng // Progress in Electromagnetics Research B;2013, Vol. 49, p281 

    In this paper, an algorithm based on penalty cost function for synthesizing flat-top patterns is proposed. A descent algorithm (DA) as its optimizing approach is proposed in this paper as well. Apparently, whole algorithm efficiency totally depends on the DA. Unlike traditional descent method,...

  • ON THE CONVERGENCE PROPERTY OF THE DFP ALGORITHM. Dingguo Pu; Wenci Yu // Annals of Operations Research;1990, Vol. 24 Issue 1-4, p175 

    The DFP algorithm of unconstrained optimization possesses excellent properties of convergence for convex functions. However, a convergence theory of the DFP algorithm without the convexity assumption has not yet been established. This paper gives the following result: If the objective function...

  • An Improved Quantum-Behaved Particle Swarm Optimization Algorithm with Elitist Breeding for Unconstrained Optimization. Yang, Zhen-Lun; Wu, Angus; Min, Hua-Qing // Computational Intelligence & Neuroscience;5/10/2015, Vol. 2015, p1 

    An improved quantum-behaved particle swarm optimization with elitist breeding (EB-QPSO) for unconstrained optimization is presented and empirically studied in this paper. In EB-QPSO, the novel elitist breeding strategy acts on the elitists of the swarm to escape from the likely local optima and...

  • ON THE CONVERGENCE OF ALGORITHMS WITH IMPLICATIONS FOR STOCHASTIC AND NONDIFFERENTIABLE OPTIMIZATION. Higle, Julia L.; Sen, Suvrajeet // Mathematics of Operations Research;Feb92, Vol. 17 Issue 1, p112 

    Studies of the convergence of algorithms often revolve around the existence of a function with respect to which monotonic descent is required. In this paper, we show that under relatively lenient conditions, "stage-dependent descent" (not necessarily monotonic) is sufficient to guarantee...

  • Research on the Algorithm for Solving Unconstraint Optimization Problems Utilizing Knowledge Evolution Principle. Taishan, Yan; Duwu, Cui // Information Technology Journal;2010, Vol. 9 Issue 2, p343 

    Based on the evolutionary epistemology idea, an algorithm called UOP-KEA for solving unconstraint optimisation problems utilizing knowledge evolution principle is proposed in this study. The main idea of this algorithm can be described as follows. Firstly, an initial knowledge base informed. The...

  • Cognitive Networks AQM Algorithm Based on State Close-Loop Feedback. Jin Qi; Shunyi Zhang; Lu Cao; Ling Tan; Yanfei Sun // International Journal of Advancements in Computing Technology;Mar2012, Vol. 4 Issue 5, p122 

    Referring to the problem that traditional congestion control algorithm seldom taking user lever or service feature into consideration while lacking the optimization of overall network performance as well as end to end QoS guarantee, this paper proposed cognitive networks (CNs) AQM Algorithm-...

  • Replica exchange statistical temperature Monte Carlo. Kim, Jaegil; Keyes, Thomas; Straub, John E. // Journal of Chemical Physics;3/28/2009, Vol. 130 Issue 12, p124112 

    The replica exchange statistical temperature Monte Carlo algorithm (RESTMC) is presented, extending the single-replica STMC algorithm [J. Kim, J. E. Straub, and T. Keyes, Phys. Rev. Lett. 97, 050601 (2006)] to alleviate the slow convergence of the conventional temperature replica exchange method...

  • CONVERGENCE PROPERTIES OF INFINITESIMAL PERTURBATION ANALYSIS ESTIMATES. Heidelberger, Philip; Xi-Ren Cao; Zazanis, Michael A.; Suri, Rajan // Management Science;Nov88, Vol. 34 Issue 11, p1281 

    Infinitesimal Perturbation Analysis (IPA) is a method for computing a sample path derivative with respect to an input parameter in a discrete event simulation. The IPA algorithm is based on the fact that for certain parameters and any realization of a simulation, the change in parameter can be...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics