检索结果-南通市图书馆

Modeling the sojourn time of Items for In-Networ Cache Based on LRU Policy

在线全文

学校读者我要写书评

暂无评论

China Communications 2014年第10期11卷 88-95页

作者： LIU Jiang WANG Guoqing HUANG Tao CHEN Jianya LIU Yunjie State Key Laboratory of Networking and Switching Technology. Beijing University of Posts and Telecommunications Beijing 100876 China.

To reduce network redundancy,innetwork caching is considered in many future Internet architectures,such as Information Centric *** in-network caching system,the item sojourn time of LRU(Least Recently Used) replacement policy is an important issue for two reasons:firstly,LRU is one of the most common used cache policy;secondly,item sojourn time is positively correlated to the hit probability,so this metric parameter could be useful to design the caching ***,to the best of our knowledge,the sojourn time hasn't been studied theoretically so *** this paper,we first model the LRU cache policy by Markov *** an approximate closedform expression of the item expectation sojourn time is provided through the theory of stochastic service system,which is a function of the item request rates and cache ***,extensive simulation results are illustrated to show that the expression is a good approximation of the item sojourn time.

关键词： sojourn time Markov chain LRU steady-state probability

LRU缓存替换策略中内容逗留时间的建模分析(英文)

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

China Communications 2014年第10期11卷 88-95页

作者：刘江王国卿黄韬陈建亚刘韵洁 State Key Laboratory of Networking and Switching Technology.Beijing University of Posts and Telecommunications

To reduce network redundancy,innetwork caching is considered in many future Internet architectures,such as Information Centric *** in-network caching system,the item sojourn time of LRU(Least Recently Used) replacement policy is an important issue for two reasons:firstly,LRU is one of the most common used cache policy;secondly,item sojourn time is positively correlated to the hit probability,so this metric parameter could be useful to design the caching ***,to the best of our knowledge,the sojourn time hasn’t been studied theoretically so *** this paper,we first model the LRU cache policy by Markov *** an approximate closedform expression of the item expectation sojourn time is provided through the theory of stochastic service system,which is a function of the item request rates and cache ***,extensive simulation results are illustrated to show that the expression is a good approximation of the item sojourn time.

关键词： sojourn time Markov chain LRU steady-state probability.

On the M/G/1 queueing system with multiclass customers and fixed feedback

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2008年第2期15卷 114-121页

作者： ZHANG Qi-zhi School of Computer South China Normal University Guangzhou 510631China

The M/G/1 queueing system with multiclass customer arrivals, fixed feedback, and first come first served policy is considered, where different classes of customers have different arrival rates, service-time distributions, and feedback numbers. The joint probabifity generation function of queue size of each class and the Laplace-Stieltjes transform of the total sojourn time of a customer in each class are presented, which extended the results obtained by Choi B D. The mean queue size of each class and mean total sojourn time of a customer in each class are obtained with this result. The results can be used in computer and communication networks for their performance analysis.

关键词： M/G/1 queueing system feedback multiclasscustomers queue size sojourn time

THE HAUSDORFF MEASURE FOR THE SAMPLE PATH OF THE WESTWATER PROCESS

在线全文

学校读者我要写书评

暂无评论

Chinese Annals of Mathematics,Series B 1996年第3期17卷 375-388页

作者： ZHOU XIANYIN(Depatment of Mathematics, Beijing Normal University Beijing 100875, China) BEIJING NORMAL UNIV DEPT MATHBEIJING 100875PEOPLES R CHINA

It is proved that φ(s) = s2 log |logs| is the correct function to give the Hausdorff measureof a sample path of the Westwater process.

关键词： Hausdorff measure Wiener process Westwater process sojourn time

The exact Hausdorff measures for the graph and image of a multidimensional iterated Brownian motion

在线全文

学校读者我要写书评

暂无评论

Science China Mathematics 2007年第1期50卷 35-46页

作者： Rong-mao ZHANG Zheng-yan LIN Department of Mathematics Zhejiang UniversityHangzhou 310027China

Let {W (t), t ∈ R}, {B(t), t ∈ R +} be two independent Brownian motions on R with W(0) = B(0) = 0. In this paper, we shall consider the exact Hausdorff measures for the image and graph sets of the d-dimensional iterated Brownian motion X(t), where X(t) = (X 1(t),…, X d (t)) and X 1(t),…, X d (t) are d independent copies of Y(t) = W(B(t)). In particular, for any Borel set Q ? (0, ∞), the exact Hausdorff measures of the image X(Q) = {X(t): t ∈ Q} and the graph GrX(Q) = {(t, X(t)): t ∈ Q} are established.

关键词： graph Hausdorff measure image iterated Brownian motion sojourn time 60F15 60G15 60G17

A Network Selection Scheme Based on TOPSIS in Heterogeneous Network Environment

在线全文

学校读者我要写书评

暂无评论

Journal of Harbin Institute of Technology(New Series) 2014年第1期21卷 43-48页

作者： Long Xu Yi Li School of Telecommunication Engineering Beijing University of Posts and Telecommunications

This paper deals with network selection problem for users in heterogeneous network environment. The main context is to improve the TOPSIS( Technique for Order Preference by Similarity to Ideal Solution) network scheme by combining the network properties and the users' requirement accurately and decrease ping-pong effect. The method of entropy and FAHP( Fuzzy Analytic Hierarchy Process) are used to calculate weight value and the sojourn time calculation is used to avoid ping-pang effect. The simulation results show that the improved scheme enhances the more accuracy of network selection than the existing methods and reduces the number of ping-pang effect.

关键词： network selection sojourn time FAHP entropy TOPSIS

STATISTICS OF A CLASS OF MARKOV CHAINS

在线全文

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2004年第3期17卷 387-398页

作者： DENGYingchun CAOXianbing DepartmentofMathematics HunanNormalUniversityChangsha410081China DepartmentofBasicSciences BeijingTechnologyandBusinessUniversityBeijing100037China

In this paper we prove that the distributions of their sojourn time and hitting time at one special state for random walks which are allowed to be finite or infinite and Markov chains on star-graphs with discrete time can uniquely determine the probability distribution of the whole chains. This result also suggests a new statistical method for Markov chains.

关键词： hitting time sojourn time random walk star-graph

The One-Dimensional Distribution and Construction of Semi-Markov Processes

在线全文

学校读者我要写书评

暂无评论

Journal of Mathematical Research and Exposition 2008年第3期28卷 617-627页

作者： TANG Rong GUO Xian Ping LIU Zai Ming School of Mathematics and Computational Science Sun Yat-Sen University Guangdong 510275 China School of Mathematical Science and Computing Technology Central South University Hunan 410075 China

In this paper, we obtain the transition probability of jump chain of semi-Markov pro- cess, the distribution of sojourn time and one-dimensional distribution of semi-Markov process. Furthermore, the semi-Markov process X（t, ω） is constructed from the semi-Markov matrix and it is proved that two definitions of semi-Markov process are equivalent.

关键词： semi-Markov process Markov skeleton process sojourn time one-dimensionai distribution.