A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Filters
On localized control in QoS routing
2002
IEEE Transactions on Automatic Control
Preserved Fulltext
We develop two theoretical models for studying localized proportional routing: one using the link-level information and the other using path-level information. ...
In particular, we investigate the granularity of local QoS state information and its impact on the design of localized QoS routing schemes from a theoretical perspective. ...
Given the path-level virtual network view for a source-destination pair, the "optimal" flow proportions for the paths between the pair can be computed to minimize the overall flow blocking probability ...
doi:10.1109/tac.2002.1008368
fatcat:6zanhno7yvas3ca5qf7bxjxcmy
Increasing the Capacity of Large-Scale HetNets through Centralized Dynamic Data Offloading
2014
2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Based on this model, we present a heuristic centralized data offloading algorithm, which, for a certain traffic demand, is able to increase the 5 th percentile of the data flow throughput by a factor of ...
4.5 and to halve the probability of service unavailability. ...
We observe the flow throughput 5 %-ile R 5 and the network flow blocking probability P . Fig. 2 depicts both quantities for a mean traffic density of 90 Mbps/km 2 . ...
doi:10.1109/vtcfall.2014.6966012
dblp:conf/vtc/KlessigGF14
fatcat:jhukpeylobhylafnfx4kuc6jfe
Joint routing, link capacity dimensioning, and switch port optimization for dynamic traffic in optical networks
2021
ETRI Journal
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
It was found that for an average link blocking probability equal to 0.015, the proposed model achieves a net channel gain in terms of wavelength channels ( w ) equal to 35.72%, 39.09%, and 36.93% compared ...
The optimal information is utilized for dynamic traffic in WDM networks, which is shown to achieve the desired performance with the guaranteed quality of service in different networks. ...
The networks must be designed to achieve a trade-off between network cost and network blocking probability (NBP). ...
doi:10.4218/etrij.2020-0235
fatcat:xv7jm4r4izcv3ffqnu4pebkt3i
A random compensation scheme for 5G slicing under statistical delay-QoS constraints
2020
IEEE Access
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We aim to propose a simple but effective slicing scheme and provide customized QoS provisioning for the heterogeneous traffic flows. ...
Based on the service requests of a traffic flow, the 5G core network, which connects to a 5G RAN, is responsible for selecting the appropriate NSI for this flow. ...
doi:10.1109/access.2020.3033321
fatcat:wowhslyt25d6bf3vcw4cbzyjc4
Optimal Spectrum Utilization and Flow Controlling In Heterogeneous Network with Reconfigurable Devices
2017
International Journal of Electronics and Telecommunications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The allocation of the data flow rate at device level is proposed for optimization of network fairness in a heterogeneous network. ...
Fairness provisioning in heterogeneous networks is a prime issue for high-rate data flow, wherein the inter-connectivity property among different communication devices provides higher throughput. ...
7 for the developed rate flow attribute method. ...
doi:10.1515/eletel-2017-0036
fatcat:v3totufwezhvppqkzdondaazum
Evaluation of a Multiobjective Alternative Routing Method in Carrier IP/MPLS Networks
[chapter]
2009
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To cope with the issue of exceeding bandwidth allocation, a per flow admission control is suggested for a DiffServ network, in particular a measurement-based admission control (new flow requests are blocked ...
routing for specific traffic flows. ...
(in order to minimize the service mean blocking probabilities B ms and the maximal point-to-point blocking probability, B Ms , for each service s). ...
doi:10.1007/978-3-642-01399-7_16
fatcat:udh5y7euj5f43omju5364z4fla
Adaptive proportional routing: a localized QoS routing approach
2002
IEEE/ACM Transactions on Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
a path for a flow. ...
Introduction Quality-of-Service (QoS) routing is concerned with the problem of how to select a path for a flow such that the flow's QoS requirements such as bandwidth or delay are likely to be met. ...
To account for the heterogeneity of traffic, bandwidth blocking ratio is used as the performance metric for comparing different routing schemes. ...
doi:10.1109/tnet.2002.804832
fatcat:timdz2la6baztkorcvswbcu7li
A New Method for Reconstructing Data on a Single Failure Node in the Distributed Storage System Based on the MSR Code
2021
Wireless Communications and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
As a storage method for a distributed storage system, an erasure code can save storage space and repair the data of failed nodes. ...
An optimal repair strategy based on the minimum storage regenerative (MSR) code and a hybrid genetic algorithm is proposed for single-node fault scenarios to solve the above problems. ...
In the network topology, a newcomer becomes the root of tree T to fix the topology, and the repair time and the flow topology are minimized to satisfy T = min c time max β ω + c traffic ∑degree mid − 2 ...
doi:10.1155/2021/5574255
fatcat:z3z7f6aqg5acvia6cfjzj227sa
Accelerating Data Regeneration for Distributed Storage Systems with Heterogeneous Link Capacities
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we investigate two approaches to the problem of minimizing regeneration time in networks with heterogeneous link capacities. ...
Previous results have been mainly focused on the minimization of network traffic in regeneration. ...
We develop the information flow graph method from [3] . ...
arXiv:1603.05163v1
fatcat:jl4y4x4mbfgepmqs32rqo4o2ae
Performance Analysis of Probabilistic Multipath Transmission of Video Streaming Traffic over Multi-Radio Wireless Devices
2012
IEEE Transactions on Wireless Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A probability generation function (PGF) and z-transform method is applied to derive the PGF of packet delay and any arbitrary moment in general. ...
Multihoming support can be enabled to allow for multiple simultaneous associations with heterogeneous networks. ...
Then, the remaining flow zero-inflated with a probability 1 − ϑ 1 is considered to derive the flow splitting probability ϑ 2 for the channel of the second largest bandwidth. ...
doi:10.1109/twc.2012.021512.111397
fatcat:ckl6e4buxnhntdlx73dxawdcpy
Optimal Traffic Splitting Policy in LTE-based Heterogeneous Network
[article]
2017
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Therefore, we target to minimize the average delay of the system subject to a constraint on the blocking probability of background and foreground users. ...
Moreover, single connectivity to the small cell may increase the blocking probability of foreground users. ...
Thus, our objective is to minimize the average delay in the system subject to a constraint on the total blocking probability. ...
arXiv:1710.11453v1
fatcat:e4dgbqqnefgmxapukfi4z5hyxq
INFLUENCE OF TRAFFIC MIX ON PCU VALUE OF VEHICLES UNDER HETEROGENEOUS TRAFFIC CONDITIONS
2013
International Journal for transport and traffic engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Passenger Car Unit (PCU) can be an appropriate measure to represent the relative impedance caused by a vehicle in heterogeneous traffic. ...
The interaction between moving vehicles under such traffic condition is highly complex in nature, which can be represented in terms of the amount of impedance caused to flow of traffic by a vehicle type ...
heterogeneous traffic flow on mid block sections of urban roads to a highly satisfactory extent. ...
doi:10.7708/ijtte.2013.3(3).07
fatcat:s7rrf4ptmrfb5dbipmvcqkjcjq
Page 4071 of Mathematical Reviews Vol. , Issue 82i
[page]
1982
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
to the road traffic flow pattern which is the main factor of the noise generation. ...
Hence, we consider a sequence of (GJ/M/s) systems in which the traffic intensities converge to one from below, the arrival rates and the numbers of servers go to infinity, but the steady-state probabilities ...
Dynamic traffic grooming: the changing role of traffic grooming
2007
IEEE Communications Surveys and Tutorials
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
, policy design, view: -Minimize the blocking probability -Minimize the provisioning time (time to setup a connection for an arrival, traffic delay, etc.) ...
flow for the node-flow pair (n, s). ...
doi:10.1109/comst.2007.358970
fatcat:svejo53v5rfkvkvqjhiogporzy
A layered broadband switching architecture with physical or virtual path configurations
1991
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Mathematical programs minimizing path bandwidth usage subject to meeting grade-of-service requirements are formulated for both methods. The relative merits of these methods are compared. ...
Switching at the higher layer is performed to reduce blocking at the next smaller time scale. ...
For this case and in the absence of a capacity constraint (C2), the optimization of a concave function subject to flow requirement (C 1) gives a solution for which nonzero flow exists only on the shortest ...
doi:10.1109/49.108679
fatcat:fiyjfi6mnvbificdollwxz7on4
« Previous
Showing results 1 — 15 out of 24,726 results