Topology aggregation is necessary for scalable QoS routing mechanisms. Thekey issue is how to gain good performance while summarizing the topological information. In thispaper, we propose a new method to describe the ...Topology aggregation is necessary for scalable QoS routing mechanisms. Thekey issue is how to gain good performance while summarizing the topological information. In thispaper, we propose a new method to describe the logical link, which is simple and effective innetwork with additive and constrained concave parameters. We extend the method to network associatedwith multi-parameters. Furthermore, we propose a modified star aggregation algorithm. Simulationsare used to evaluate the performance. The results show that our algorithm is relatively good.展开更多
First passage time in Markov chains is defined as the first time that a chain passes a specified state or lumped states. This state or lumped states may indicate first passage time of an interesting, rare and amazing ...First passage time in Markov chains is defined as the first time that a chain passes a specified state or lumped states. This state or lumped states may indicate first passage time of an interesting, rare and amazing event. In this study, obtaining distribution of the first passage time relating to lumped states which are constructed by gathering the states through lumping method for a irreducible Markov chain whose state space is finite was deliberated. Thanks to lumping method the chain＇s Markov property has been preserved. Another benefit of lumping method in the way of practice is reduction of the state space thanks to gathering states together. As the obtained first passage distributions are continuous, it may be used in many fields such as reliability and risk analysis展开更多
文摘Topology aggregation is necessary for scalable QoS routing mechanisms. Thekey issue is how to gain good performance while summarizing the topological information. In thispaper, we propose a new method to describe the logical link, which is simple and effective innetwork with additive and constrained concave parameters. We extend the method to network associatedwith multi-parameters. Furthermore, we propose a modified star aggregation algorithm. Simulationsare used to evaluate the performance. The results show that our algorithm is relatively good.
文摘First passage time in Markov chains is defined as the first time that a chain passes a specified state or lumped states. This state or lumped states may indicate first passage time of an interesting, rare and amazing event. In this study, obtaining distribution of the first passage time relating to lumped states which are constructed by gathering the states through lumping method for a irreducible Markov chain whose state space is finite was deliberated. Thanks to lumping method the chain＇s Markov property has been preserved. Another benefit of lumping method in the way of practice is reduction of the state space thanks to gathering states together. As the obtained first passage distributions are continuous, it may be used in many fields such as reliability and risk analysis
