Transition probability matrix for discrete-time queuing system used in computer communication networks, has set of instructions for deriving probability generating function of stationary queue length at departure epochs by M-G-I type matrix analytic approach
2023-10-16
专利权人BHARATH HIGHER EDUCATION & RES INST (BHAR-Non-standard)
申请日期2023-10-16
专利号IN202341069497-A
成果简介NOVELTY - The matrix has a set of instructions for deriving probability generating function (PGF) of stationary queue length at departure epochs by an M-G-I type matrix analytic approach. Discrete-time single-server infinite- buffer bulk-service queues are analyzed. Inter-arrival times of successive arrivals are assumed to be independent and geometrically distributed, where customers are served by a single-server in accessible or non-accessible batches. Service times of batches are assumed to be independent and geometrically distributed. USE - Transition probability matrix for a discrete-time queuing system used in computer communication networks. ADVANTAGE - The method enables the discrete-time queuing system to provide transfer of video, voice and data communication through a high speed local area network and a wide area network.
IPC 分类号G01S-003/80 ; G06F-011/14 ; G11B-005/00 ; H04L-047/56 ; H04N-019/625
国家印度
专业领域信息技术
语种英语
成果类型专利
文献类型科技成果
条目标识符http://119.78.100.226:8889/handle/3KE4DYBR/19619
专题中国科学院新疆生态与地理研究所
作者单位
BHARATH HIGHER EDUCATION & RES INST (BHAR-Non-standard)
推荐引用方式
GB/T 7714
RAMACHANDRAN V,CHIDAMBARAM K,NAVEENCHANDRAN P,et al. Transition probability matrix for discrete-time queuing system used in computer communication networks, has set of instructions for deriving probability generating function of stationary queue length at departure epochs by M-G-I type matrix analytic approach. IN202341069497-A[P]. 2023.
条目包含的文件
条目无相关文件。
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。