检索结果-南通市图书馆

Optimal Decision of M/M/C（m） queuing system

在线全文

学校读者我要写书评

暂无评论

Optimal Decision of M/M/C（m） Queuing System

Optimal Decision of M/M/C（m） queuing system

2012 National Conference on Information Technology and Computer Science

作者： Xiaomin Zhao School of Management,Shanghai University,Shanghai,China Junjun Gao Sydney Institute of Commerce,ShanghaiUniversity,Shanghai,China Yihua Wei School of Management,Shanghai University,Shanghai,China

To study the M/M/C（n） queuing system in which a sever can service multiple customers at the same time,the stability equations is constructed,by which the stability probability is solved,and then some system operation indexes are ***,based on those operation indexes,the number of customers on simultaneous service is optimized,some properties for the optimal solutions are obtained,and then two algorithms are given to solve the optimal problem.

关键词： queuing system simultaneous service operation index algorithms

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Optimal Decision of M/M/C（m） Queuing System

Application of Convex Optimization to queuing systems

2011年全国电子信息技术与应用学术会议

作者： Xiaomin Zhao 1,Junjun Gao 2,Yihua Wei 1 1 School of Management,Shanghai University,Shanghai,China 2 Sydney Institute of Commerce,Shanghai University,Shanghai,China

关键词： queuing system simultaneous service operation index algorithms

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Southwest Jiaotong University(English Edition) 2006年第2期14卷 176-181页

作者：郭彩芬王宗荣 College of Automobile and Transportation Engineering Liaoning Institute of TechnologyJinzhou 121001 China College of Economics and Management Nanjing University of Aeronautics and Astronautics Nanjing 210016China

On the basis of the queuing theory, a nonlinear optimal load allocation model is proposed. A novel transformafion method for the optimization variables is also presented, and the constraints are properly combined so as to make this model convex. The interior-point method for convex optimization is presented as an efficient computational tool. Finally, this model is evaluated by a real example,from which the following conclusions are drawn： the optimum result can ensure the full utilization of machines and the smallest amount of WIP （work-in-progress） in queuing systems; the interior-point method needs a few iterations with significant computational savings; other performance measures of queuing systems can also be optimized in a similar way.

关键词： queuing system Load allocation Convex optimization

Task Allocation Approach for Minimizing Make-Span inWireless Sensor Actor Networks

在线全文

学校读者我要写书评

暂无评论

Computer systems Science & Engineering 2021年第11期39卷 165-178页

作者： Mohammad Reza Okhovvat Mohammad Taghi Kheirabadi Ali Nodehi Morteza Okhovvat Department of Computer Engineering Gorgan BranchIslamic Azad UniversityGorganIran Health Management and Social Development Research Center Golestan University of Medical SciencesGorganIran

Wireless Sensor Actor Networks(WSANs)have contributed to the development of pervasive computing wherein time consideration to perform the tasks of pervasive applications is ***,time constraint is one of the major challenges of *** this paper,we propose an analytical approach based on queuing theory to minimize the total time taken for completion of tasks,i.e.,make-span,in WSANs with hybrid *** best allocation rates of tasks to actor nodes are figured out through solving inequities and qualities resulting from a steady state analysis of the proposed *** the calculated tasks arrival rates at each of the actors,the make-span could be *** assess the accuracy of the tasks assignment rates to each of the actors attained from the suggested analytical approach and to provide a graphical representation of the WSAN a formal model in terms of the generalized stochastic Petri net(GSPN)is *** proposed GSPN model is analyzed,tasks distribution weights to the actors are determined,and then tasks allocation rates can be *** the results achieved from the analytical approach and the GSPN model demonstrates that allocation rates and hence,the make-span figured out from proposed approach and the formal model are the *** results in typical scenarios show shorter make-span and longer network lifetime compared to when one of the two popular traditional task allocation algorithms,namely,opportunistic load balancing(OLB),and stochastic allocation(SA)algorithms,is used.

关键词： GSPN make-span optimization queuing system task allocation

Advanced User-Based Interaction Model in Cloud

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

China Communications 2013年第4期10卷 126-134页

作者：徐赢颖敖乃翔黄丹赵永祥陈常嘉 School of Electronics and Information Engineering Beijing Jiaotong University

With the increasing popularity of cloud computing, there is an increased de mand for cloud resources in cloud. It has be come even more urgent to find solutions to improve resource utilization. From the per spective of a cloud consumer, a cloud applica tion processes a large information flow in volving user actions that access resources, but little work has so far been devoted to research from the perspective of the interaction be tween the user and the cloud application. In this paper, we analyze the interaction in detail, and propose a general mathematical interac tion model to formulate the challenge pertain ing to storage resource allocation as an opti mization problem, focusing on minimizing both the user＇s cost and server＇s consumption. A potential response mechanism is then de signed based on the interaction model. Fur thermore, the proposed model is used to ex plore strategies when multiple users access the same file simultaneously. Additionally, an improved queuing system, namely M/ G~ oo queue with standby, is introduced. Finally, an evaluation is presented to verify the interac- tion model.

关键词： interaction model cloud responsemechanism user data queuing system

A general communication performance evaluation model based on routing path decomposition

在线全文

学校读者我要写书评

暂无评论

Journal of Zhejiang University-Science C(Computers and Electronics) 2011年第7期12卷 561-573页

作者： Ai-lian CHENG 1,Yun PAN 1,2,Xiao-lang YAN 2,Ruo-hong HUAN 3 (1 Department of Information Science and Electronic Engineering,Zhejiang University,Hangzhou 310027,China) (2 Institute of VLSI Design,Zhejiang University,Hangzhou 310027,China) (3 College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou 310023,China) Department of Information Science and Electronic Engineering Zhejiang University Hangzhou China Institute of VLSI Design Zhejiang University Hangzhou China College of Computer Science and Technology Zhejiang University of Technology Hangzhou China

The network-on-chip (NoC) architecture is a main factor affecting the system performance of complicated multi-processor systems-on-chips (MPSoCs).To evaluate the effects of the NoC architectures on communication efficiency,several kinds of techniques have been developed,including various simulators and analytical *** simulators are accurate but time consuming,especially in large space explorations of diverse network configurations;in contrast,the analytical models are fast and flexible,providing alternative methods for performance *** this paper,we propose a general analytical model to esti-mate the communication performance for arbitrary NoCs with wormhole routing and virtual channel flow *** resolve the inherent dependency of successive links occupied by one packet in wormhole routing,we propose the routing path decomposition approach to generating a series of ordered link *** we use the traditional queuing system to derive the fine-grained transmission latency for each network *** to our experiments,the proposed analytical model provides a good approximation of the average packet latency to the simulation results,and estimates the network throughput precisely under various NoC configurations and ***,the analytical model runs about 10 5 times faster than the cycle-accurate NoC *** applications of the model including bottleneck detection and virtual channel allocation are also presented.

关键词： Analytical model Communication performance Network-on-chip (NoC) queuing system Routing path decom-position Virtual channel

Admission control with long-range dependence traffic input

在线全文

学校读者我要写书评

暂无评论

Journal of Harbin Institute of Technology(New Series) 2005年第4期12卷 396-399页

作者：饶云华邹雪城 School of Electronics Information Wuhan University Wuhan 430079 China Dept. of Electronics Science and Technology Huazhong Univ. of Science and Technology Wuhan 430074 China

The admission control scheme is investigated for a FIFO self-similar queuing system with Quality of Service (QoS) performance guarantees. Since the self-similar queuing system performance analysis is often carried out under the condition of infinite buffer, it is difficult to deduce the upper boundary of buffer overflow probability. To overcome this shortcoming, a simple overflow condition is proposed, which defines a buffer overflow occurrence whenever the arrival rate exceeds the service rate. The analytic formula for the buffer overflow probability upper boundary is easily obtained under this condition. The required bandwidth upper boundary with long-range dependence input and determined overflow probability is then derived from this formula. Based on the above analytic formulas, the upper boundaries of the admission control regions for homogeneous and heterogeneous long-range dependence traffic sources are separately obtained. Finally, an effective admission control scheme for long-range dependence input is proposed. Simulation studies with real traffic have confirmed the validity of these results.

关键词： long-range dependence queuing system overflow probability admission control

Performance Analysis of Channel Assignment with Prioritized Handoff Procedures in GSM

在线全文

学校读者我要写书评

暂无评论

The Journal of China Universities of Posts and Telecommunications 2001年第2期8卷 45-50页

作者： WANG Xiao xia, XIN Zhan hong (School of Business, Beijing University of Posts and Telecommunications, Beijing 100876, P.R.China) School of Business Beijing University of Posts and Telecommunications

A mathematical model of channel assignment with prioritized handoff procedures is given according to the physical handoff process in GSM networks with some reasonable simplifications and assumptions, and a numerical calculation is applied to the model. A simulation model is established to verify the results of the mathematical model. The results show that the overall loss probability is increased with the number of channel reservation increasing, although the probability of forced termination can be reduced. Therefore, three queuing schemes are proposed: (1) queuing for handoff calls without channel reservation, and the queuing rule is “First come, first served”; (2) queuing for handoff calls without channel reservation, and the queuing rule is “First come to the threshold, first served”; (3) queuing for new calls with one channel reserved for handoff calls. Simulations are also made for the three queuing schemes, the results indicate that the third one is the best, and it is also easy to realize. The optimal queuing length and the maximum waiting time are suggested for the third scheme.

关键词： performance analysis queuing system teletraffic theory GSM handoff channel reservation

Truck Appointment at Container Terminals:Status and Perspectives

在线全文

学校读者我要写书评

暂无评论

Truck Appointment at Container Terminals:Status and Perspect...