检索结果-内蒙古大学图书馆

User-assisted bearer split control for dual connectivity in multi-RAT 5G networks

WIRELESS NETWORKS 2020年第5期26卷 3675-3685页

作者： Antonioli, Roberto P. Guerreiro, Igor M. Sousa, Diego Aguiar Rodrigues, Emanuel Bezerra Silva, Carlos F. M. e Maciel, Tarcisio Ferreira Porto Cavalcanti, Francisco Rodrigo Fed Univ Ceara UFC Wireless Telecommun Res Grp GTEL Av Mister HullPostal Mail 3225 BR-60416200 Fortaleza Ceara Brazil Fed Inst Educ Sci & Technol Ceara Paracuru CE Brazil

One of the most important functionalities for the dual connectivity (DC) technology in non-stand-alone (NSA) fifth generation (5G) networks is the flow control algorithm (FCA), which has the role of correctly splitting the data traffic of users in DC. However, delays in backhaul links and the time between two executions of the FCA may limit the effectiveness of the split ratios computed by the FCA in situations where unexpected channel variations or an increase in the traffic load happen. In this context, we propose a heuristic mechanism where the user assists the FCA in performing a faster and finer adjustment of the bearer split ratios. The proposed mechanism works based on a single scalar value and can be combined with any existing FCA. Besides the adjustment of the bearer split ratios, the proposed mechanism may also trigger handover/disconnection when it detects problems in one of the user connections, which is a novel feature that is not present in existing solutions. Simulations demonstrate the gains provided by the proposed mechanism in terms of user satisfaction, total system rate and user throughput.

关键词： 5G mobile networks Dual connectivity flow control algorithm User assistance

来源：评论

学校读者我要写书评

暂无评论

A fast flow control algorithm for real-time emergency evacuation in large indoor areas

引用

FIRE SAFETY JOURNAL 2009年第5期44卷 732-740页

作者： Chen, Po-Han Feng, Feng Nanyang Technol Univ Sch Civil & Environm Engn Singapore 639798 Singapore

Evacuation in all emergency is always an important issue for shopping malls, subway stations and other Populous indoor places. The purpose of evacuation is to evacuate people from the danger zone through exits within the shortest possible time. To help evacuation missions to be carried out efficiently and effectively by rescuers, a fast evacuation approach is needed. The proposed fast flow control algorithm in this paper Calculates evacuation paths in accordance with the floor plan (which contains detailed locations and dimensions of corridors and exit doors) and the total number of evacuees. The calculation is based on minimum overall evacuation time and all optimal number of evacuees assigned to each evacuation path. An example is presented at the end of the paper to illustrate real-time implementation of the proposed fast now control algorithm. (C) 2009 Elsevier Ltd. All rights reserved.

关键词： flow control algorithm Real-time evacuation Virtual reality (VR) Augmented reality (AR) Path-finding algorithm

来源：评论

学校读者我要写书评

暂无评论

Self-adaptive congestion control for multiclass intermittent connections in a communication network

引用

QUEUEING SYSTEMS 2011年第3-4期69卷 237-257页

作者： Graham, Carl Robert, Philippe INRIA Paris Rocquencourt F-78153 Le Chesnay France Ecole Polytech CNRS UMR 7641 F-91128 Palaiseau France

A Markovian model for intermittent connections of various classes in a communication network is established and investigated. Any connection alternates between being OFF (idle) or ON (active, with data to transmit), and evolves in a way depending only on its class and the state of the network, in particular for the routes it uses among the network nodes to transmit data. The congestion of a given node is a functional of the throughputs of all ON connections going through it, and causes losses to these connections. Any ON connection reacts to its losses by self-adapting its throughput in TCP-like fashion so as to control network congestion. The connections interact through this feedback loop. The system constituted of their states (either OFF, or ON with some throughput) evolves in Markovian fashion, and since the number of connections in each class is potentially huge, a mean-field limit result with an adequate scaling is proved so as to reduce dimensionality. The limit is a nonlinear Markov process given by a McKean-Vlasov equation, of dimension the number of classes. It is then proved that the stationary distributions of the limit can be expressed in terms of the solutions of a finite-dimensional fixed-point equation.

关键词： flow control algorithm Multiclass system Mean-field limit Chaoticity McKean-Vlasov equation Nonlinear Markov process Stationary distribution

来源：评论

学校读者我要写书评

暂无评论

A credit-based flow control algorithm for broadband access networks

引用

COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING 2000年第2期34卷 279-295页

作者： Song, SW Wilfrid Laurier Univ Dept Phys & Comp Waterloo ON N2L 3C5 Canada

This paper presents a flow control algorithm for a general-purpose computer-based residential gateway (RG) in a broadband access network. flow control (bandwidth allocation) is one of the key elements in the RG software that is called the RG operating system. A credit-based flow control algorithm is proposed in this paper. The algorithm provides guaranteed services to CBR (constant bit rate) applications and allows VBR (variable bit rate) applications to share the link bandwidth within their delay tolerances through a credit system. The algorithm has been implemented in a real-time RG operating system which enables a personal computer to serve as an RG in an Asynchronous Transfer Mode-based (ATM) broadband access network. An experimental study on the efficiency of the algorithm and the methods of credit management is also presented in this paper. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： residential gateway broadband access networks flow control algorithm

来源：评论

学校读者我要写书评

暂无评论

Local and congestion-driven fairness algorithm in arbitrary topology networks

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2000年第3期8卷 362-372页

作者： Mayer, A Ofek, Y Yung, M Lucent Technol Bell Labs Murray Hill NJ 07974 USA Synchrodyne Inc New York NY 10038 USA CertCo Inc New York NY 10004 USA

Typically, bandwidth reservation is not made for data applications. Therefore, the only way to provide minimum bandwidth guarantees to such an application is by using a fairness mechanism to regulate the access to the network and by controlling the packet loss (i.e., congestion) inside the network. There are numerous works treating fairness in ring networks, however, there are almost no such works on fairness in arbitrary topology networks. The context of this work is fairness in an arbitrary topology network, the MetaNet, which employs convergence routing, a loss-free routing technique which is a variant on deflection routing. We note that minimum bandwidth guarantee combined with loss-free routing are the desired quality-of-service (QoS) attributes for most data applications. While developing the mechanisms, we also present performance measures to assess the new access- and now-control algorithm: i) Locality and congestion-driven-only the subnetwork containing conflicting traffic streams becomes involved in the fairness regulation, Furthermore, the fairness regulation is activated only when congestion occurs, This implies that when there is no congestion, nodes can access the network immediately and freely, which is a key requirement for distributed computing. ii) Scalability-the data-structure sizes used in the algorithm are a function of the switching node degree, and use constant space control signals of two bits only (the ATR I standard, for example, dedicates four bits in the header of each cell to generic flow-control). iii) Linear access time in the congested subnetwork-measured by "the maximal clique in what we call the conflict graph to which a node belongs," and a frequency which is inverse linear in this parameter (when the traffic pattern stabilizes).

关键词： Network Topology Telecommunication Network Routing Computer Networks Telecommunication Congestion control Quality Of Service Local Fairness algorithm Congestion Driven Fairness algorithm Arbitrary Topology Networks Bandwidth Reservation Minimum Bandwidth Guarantees Fairness Mechanism Packet Loss Congestion Meta Net Convergence Routing Loss Free Routing Deflection Routing Quality Of Service Qo S Data Applications Performance Measures Access control algorithm flow control algorithm Locality Subnetwork Conflicting Traffic Streams Fairness Regulation Distributed Computing Scalability Data Structure Sizes Switching Node Degree Space control Signals Linear Access Time Conflict Graph Traffic Pattern Routing Bandwidth Network Topology Convergence Quality Of Service Telecommunication Traffic Distributed Computing Size control Asynchronous Transfer Mode Frequency

来源：评论

学校读者我要写书评

暂无评论

flow-control METHODOLOGY FOR VIRTUAL-CIRCUIT NETWORKS

引用

IEE PROCEEDINGS-I COMMUNICATIONS SPEECH AND VISION 1993年第6期140卷 494-504页

作者： DEY, S VARSHNEY, PK Department of Electrical and Computer Engineering Syracuse University Syracuse USA

An input rate flow control methodology for a virtual-circuit computer network is presented. Power is used as the performance measure of a virtual circuit and network power, which is the product of all of the virtual circuit powers, is used as the network performance measure. It is shown that the network power has a unique maximum point in the feasible region of the throughput space. A distributed flow control algorithm is presented and proof of convergence is given. Several numerical examples illustrate the algorithm.

关键词： COMPUTER NETWORKS flow control algorithm

来源：评论

学校读者我要写书评

暂无评论

flow-control SUPPORT FOR EFFICIENT REALIZATION OF THE EDA MODEL

MICROPROCESSING AND MICROPROGRAMMING

引用

MICROPROCESSING AND MICROPROGRAMMING 1992年第1-5期34卷 175-178页

作者： WU, HD THORELLI, LE SMAI, AH ROYAL INST TECHNOL DEPT TELECOMM & COMP SYSTS-10044 STOCKHOLM 70SWEDEN

Two classes of messages are defined in the EDA model, short and long messages. A flow control method has been investigated, which grants the short messages higher priorities to compete with long messages for the bandw... 详细信息

关键词： PARALLEL PROCESSING INTERCONNECTION NETWORKS flow control algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：