检索结果-南通市图书馆

Review on service curves of Typical Scheduling Algorithms

ZTE Communications 2024年第2期22卷 55-70页

作者： GAO Yuehong NING Zhi HE Jia ZHOU Jinfei GAO Chenqiang TANG Qingkun YU Jinghai Beijing University of Posts and Telecommunications Beijing 100876China ZTE Corporation Shenzhen 518057China State Key Laboratory of Mobile Network and Mobile Multimedia Tech-nology Shenzhen 518055China

In recent years,various internet architectures,such as Integrated services(IntServ),Differentiated services(DiffServ),Time Sensitive Networking(TSN)and Deterministic Networking(DetNet),have been proposed to meet the quality-of-service(QoS)requirements of different network ***,network calculus has found widespread application in network modeling and QoS *** calculus abstracts the details of how nodes or networks process data packets using the concept of service *** paper summarizes the service curves for typical scheduling algorithms,including Strict Priority(SP),Round Robin(RR),Cycling Queuing and Forwarding(CQF),Time Aware Shaper(TAS),Credit Based Shaper(CBS),and Asynchronous Traffic Shaper(ATS).It introduces the theory of network calculus and then provides an overview of various scheduling algorithms and their associated service *** delay bound analysis for different scheduling algorithms in specific scenarios is also conducted for more insights.

关键词： network calculus service curve scheduling algorithm QoS

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

On applying stochastic network calculus

引用

Frontiers of Computer Science 2013年第6期7卷 924-942页

作者： Chuang LIN Yiping DENG Yuming JIANG Department of Computer Science and Technology Tsinghua University Beijing 100084 China China Electric Equipment and Systems Engineering Ltd. Beijing 100084 China Department of Telematics Norwegian University of Science and Technology Trondheim NO-7491 Norway

Performance evaluation plays a crucial role in the design of network systems. Many theoretical tools, including queueing theory, effective bandwidth and network calculus, have been proposed to provide modeling mechanisms and resuits. While these theories have been widely adopted for performance evaluation, each has its own limitation. With that network systems have become more complex and harder to describe, where a lot of uncertainty and randomness exists, to make performance evaluation of such systems tractable, some compromise is often necessary and helpful. Stochas- tic network calculus （SNC） is such a theoretical tool. While SNC is a relatively new theory, it is gaining increasing interest and popularity. In the current SNC literature, much attention has been paid on the development of the theory itself. In addition, researchers have also started applying SNC to performance analysis of various types of systems in recent years. The aim of this paper is to provide a tutorial on the new theoretical tool. Specifically, various SNC traffic models and SNC server models are reviewed. The focus is on how to apply SNC, for which, four critical steps are formalized and discussed. In addition, a list of SNC application topics/areas, where there may exist huge research potential, is presented.

关键词： stochastic network calculus bound performance arrival curve service curve

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A statistical end-to-end performance model for networks with complex topologies

引用

High Technology Letters 2012年第3期18卷 308-313页

作者： Chen Yanping Wang Huiqiang Gao Yulong College of Computer Science and Technology Harbin Engineering University Harbin 150001 P. R. China Communication Research Center Harbin Institute of Technology Harbin 150001 P. R. China

Network calculus provides new tools for performance analysis of networks, but analyzing networks with complex topologies is a challenging research issue using statistical network calculus. A service model is proposed to characterize a service process of network with complex topologies. To obtain closed-form expression of statistical end-to-end performance bounds for a wide range of traffic source models, the traffic model and service model are expanded according to error function. Based on the proposed models, the explicit end-to-end delay bound of Fractional Brownian Motion（FBM） traffic is derived, the factors that affect the delay bound are analyzed, and a comparison between theoretical and simulation results is performed. The results illustrate that the proposed models not only fit the network behaviors well, but also facilitate the network performance analysis.

关键词： statistical network calculus arrival curve service curve end-to-end delay bound

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：