نتایج جستجو برای: line congestion

تعداد نتایج: 433968  

2005
Samer Lahoud Géraldine Texier Laurent Toutain

In this paper, we introduce a novel framework for the off-line flow allocation problem for traffic engineering in MPLS networks. We use a multi-stage optimization that considers minimizing successively congestion, resource consumption and operational costs. The framework is based on linear programming and presents an efficient solution for the problem both in terms of computational complexity a...

Congestion Risk Management is one of the most important subjects of Transmission management in deregulated power system and world electricity market, especially markets of zonal or local pricing in which Firm Transmission Rights (in other words Financial Transmission Rights) are the main elements. In this study, considering subjects of Financial Rights of Transmission Congestion, methods of opt...

Jason W. Black Richard C. Larson

Networked Infrastructure systems deliver services and/or products from point to point along the network. Demand for the services provided by such systems is typically cyclic, creating inefficiencies in capacity utilization. Congestion pricing provides incentives to shift demand from peak time periods to lower demand periods. This effectively increases the capacity of the system without the need...

2010
P. Eardley J. Babiarz

The purpose of this document is to describe a general architecture for flow admission and termination based on aggregated (pre-) congestion information in order to protect the quality of service of established inelastic flows within a single DiffServ domain. Status Table of

2012
Khaleel Ahmad Sunil Kumar Jayant Shekhar

During the last few decades, mobile communication has developed rapidly. The increasing dependency of people on telecommunication resources is pushing even more current technological developments in the mobile world. In Real-time multimedia applications, such as Live TV or live movie, video conferencing, VoIP, on-line gaming etc. are exciting applications to the success of 4G.In today’s Interne...

Journal: :Energies 2023

This paper presents a control strategy aimed at efficiently operating service area equipped with stations for plug-in electric vehicles’ fast charging, renewable energy sources, and an storage unit. The requirements here considered are in line the perspective of operator, who aims avoiding peaks power flow point connection distribution grid, while providing charging minimum time. Key aspects wo...

Journal: :E3S web of conferences 2021

With the rapid growth of highway traffic, congestion toll station has become a common phenomenon in peak hours. However, at serious impact on normal operation expressway. When queuing vehicles overflow station, queue leader will lose control, and main line be seriously disturbed. This paper analyzes causes stations, studies characteristics different channels traffic flow, then establishes flow ...

H. Zare Haghighi M. ‎Khodadadi‎,

In recent years, the assessment of environmental performance has been received considerable attention by environmental policy indicators and decision makers. In this regard, this paper applies data envelopment analysis (DEA) as a management tool for evaluating the environmental performance of the firms and uses the extended bounded adjusted measure (extended BAM) for including undesirable outpu...

Bita Alipasandi Neda Alipasandi Shahram Jamali,

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...

2014
Daniel J. Harvey David R. Wood

The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph G is equivalent to determining the minimum vertex congestion of an embedding of G into a tree. Using this result, we prove sharp lower bounds in terms of both the minimum degree and ave...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید