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.
Filters
ItswTCM: a new aggregate marker to improve fairness in DiffServ
2003
Computer Communications
Preserved Fulltext
We point out that yellow packets play a significant role in achieving proportional fair sharing of excess bandwidth among aggregates. ...
To solve the unfairness problem, we propose a new TSW based three color marker (ItswTCM) which achieves proportional fair sharing of excess bandwidth among aggregates. ...
It is an aggregate marker which is intended to achieve proportional fair sharing of the excess bandwidth among aggregates in a DiffServ network. ...
doi:10.1016/s0140-3664(02)00237-2
fatcat:2l76lfyppneiznc7kykwng47fm
A provision-aware fair bandwidth distribution marker algorithm for DiffServ networks
2011
Journal of Network and Computer Applications
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.
Previous work on fair sharing of network bandwidth did not adequately address the Under-Provisioned Network (UPN) condition. ...
The rise in demand for real-time applications on the Internet necessitates Quality of Service (QoS). ...
A single DiffServ Code Point (DSCP) is then assigned to each packet in a behaviour aggregate. Flows with the same DSCP are said to belong to one Per-Hop Behaviour (PHB) (Nichols et al.) . ...
doi:10.1016/j.jnca.2010.10.015
fatcat:iel3slqsrvb6jgjek2lwk3h3oa
An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks
2016
EURASIP Journal on Wireless Communications and 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 2017; you can also visit the original URL.
The file type is application/pdf.
The quality of service (QoS) requirements do not define a marker algorithm for service classes and managing network traffic to provide fair bandwidth sharing among aggregate flows. ...
The results show that the proposed marker algorithm is not affected by the number of flows and outperforms the previous marker algorithms in terms of fairness. ...
In [33] , an Improved time sliding window Three Colour Marker (ItswTCM) algorithm was proposed for the treatment of unfair sharing of bandwidth aggregates, with the main idea being to inject more yellow ...
doi:10.1186/s13638-016-0566-8
fatcat:dz2lutuoj5devpqdfi7qkrz4wa
Study of TCP and UDP Flows in a Differentiated Services Network Using Two Markers System
[chapter]
2001
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 2018; you can also visit the original URL.
The file type is application/pdf.
Therefore, we argue unfair distribution of excess bandwidth in an over-provisioned networks as well as unfair degradation in an under-provisioned network for TCP and UDP flows traffic. ...
That is, flows in Two Markers System somewhat fairly share the excess bandwidth and experience degradation in proportion to their target rates. ...
Conclusion We have described the analysis for the interaction of TCP and UDP flows in a diffserv Network using the Two Markers System. ...
doi:10.1007/3-540-45508-6_15
fatcat:jgpt2pj3tbcczptnm6rqycy57a
Fair Stateless Aggregate Traffic Marking Using Active Queue Management Techniques
[chapter]
2002
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 2006; you can also visit the original URL.
The file type is application/pdf.
Traffic marking is an important component of this framework. In this paper, we propose two new aggregate markers that are stateless, scalable and fair. ...
The second marker, Stateless Aggregate Fair Marker (F-SAM) approximates fair queueing techniques to isolate flows while marking packets of the aggregate. ...
In our work, we utilize these AQM mechanisms to propose two alternate methods of edge aggregate marking in diffserv edge routers for allocating tokens to an aggregate of incoming flows. ...
doi:10.1007/3-540-45812-3_17
fatcat:yrsmuiim5bajhnlzwincvxxleu
Loss differentiated multicast congestion control
2003
Computer Networks
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 2006; you can also visit the original URL.
The file type is application/pdf.
requirements while providing multirate max-min fairness in the network. ...
By marking the layersÕ packets appropriately and dropping them differently during congestion, the RALM protocol guides receivers to their stable optimal subscription levels that satisfy their bandwidth ...
Fig. 6 . 6 Layer marking and feedback aggregation in a packet marker. ...
doi:10.1016/s1389-1286(02)00372-9
fatcat:gkiwue3vhvgejkitar4ie2kkei
Two-Differentiated Marking Strategies for TCP Flows in a Differentiated Services Network
[chapter]
2001
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 2005; you can also visit the original URL.
The file type is application/pdf.
Therefore, we argue the use of TCP-friendly building blocks (or modules) and fairness modules in the diffserv architecture regarding this issue, and propose Two Markers System (TMS) that is able to properly ...
mark packets and fairly share the bandwidth to each flow for their targeted sending rates. ...
Acknowledgement This research was supported in part by Information and Telecommunication Research Center(ITRC) contracts. ...
doi:10.1007/3-540-45412-8_15
fatcat:evfhsrlvpvdq3dzajs2crtmwwq
Adaptive packet marking for achieving fairness in DiffServ networks
2005
Computer 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 2008; you can also visit the original URL.
The file type is application/pdf.
Current DiffServ (Differentiated Services) networks supporting Assured Forwarding (AF) service succeed in providing minimum rate guarantees, but fail to distribute network capacity in a fair way. ...
The proposed approach can be implemented using a Bandwidth Broker architecture, whereby a centralized Bandwidth Broker sets the control parameter of the adaptive markers, based on the current traffic contracts ...
in an aggregate flow, and the target rates. ...
doi:10.1016/j.comcom.2005.04.007
fatcat:br46fb2ecrdjnopybs6chl7gby
Intelligent Traffic Conditioners for Assured Forwarding Based Differentiated Services Networks
[chapter]
2000
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.
Issues related to bandwidth assurance in Assured Forwarding based Differentiated Services (Diffserv) networks have been discussed in recent research papers [7][8] [11] . ...
The bias due to these factors needs to be mitigated before bandwidth assurance for a paying customer can be articulated in Service Level Agreements (SLAs). ...
Discussion The previous sections have presented various methods for ensuring a fairer distribution of bandwidth for flows in an AF-based Diffserv network. ...
doi:10.1007/3-540-45551-5_46
fatcat:ddsppiijx5dsrdyw2vu5rs27ua
A Feedback Based Adaptive Marking Algorithm for Assured Service
[chapter]
2007
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.
We propose an algorithm to realize proportional bandwidth allocation in DiffServ networks. ...
According to the feedback information, ingress routers adjust Committed Information Rates (CIRs) of different aggregates using AIMD way to let the network reach an exactly subscribed state. ...
Hongjun Su [7] proposed an improved time sliding window based three color marker, but this algorithm can get better fairness only for low to middle level of provision. ...
doi:10.1007/978-3-540-72590-9_116
fatcat:oyejkcx5nrbynnwhwnkbb7haju
STATELESS AGGREGATE FAIR MARKING SCHEDULER FOR DIFFERENTIATED SERVICE NETWORKS
2013
Journal of 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 2017; you can also visit the original URL.
The file type is application/pdf.
In this study, we propose a Stateless Aggregate Fair Marking (SAMQ) with Multiple Queue Priority Scheduler for Differentiated Service (DiffServ) networks. ...
In case of lower priority, Stateless Aggregate Fair Marking technique is utilized. ...
As an alternative to normal max-min fairness technique, in this study we propose Stateless Aggregate Fair Marker technique (F-SAM) for differentiated service networks. ...
doi:10.3844/jcssp.2013.63.73
fatcat:btf5f4yf6naqncez656q3fgxji
TCP throughput guarantee in the DiffServ Assured Forwarding service: what about the results?
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
TCP has the property to share in a fair manner the bottleneck bandwidth between flows while DiffServ network provides a level of service controllable and predictable. ...
This paper proposes to look forward to the results obtained in terms of TCP throughput guarantee in the DiffServ Assured Forwarding (DiffServ/AF) service and to present an overview of the different proposals ...
In the following sections, we present an extension of this dynamic approach but with a fair sharing of the excess bandwidth.
B. ...
arXiv:cs/0703139v3
fatcat:mi4aj2cyxrgq7o34fjy7xtmfoi
Feedback-Based Adaptive Packet Marking for Proportional Bandwidth Allocation
2007
IEEE Transactions on Parallel and Distributed Systems
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 2008; you can also visit the original URL.
The file type is application/pdf.
However, analyses in the literature show that the current DiffServ networks are biased in favor of an aggregate flow that has a smaller committed information rate (CIR) when aggregate flows with different ...
In order to mitigate this unfairness problem, we propose an adaptive marking scheme which provides the relative bandwidth assurance in proportion to the CIRs of the aggregates. ...
We assume that many flows are aggregated and compose a class of AF PHB. The two terms, an aggregate flow and a service class, will be used interchangeably hereafter. ...
doi:10.1109/tpds.2007.25
fatcat:w7ght6odgrfqdhilg5btmprfna
TCP throughput guarantee in the DiffServ Assured Forwarding service: what about the results?
2008
Annales des télé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 2019; you can also visit the original URL.
The file type is application/pdf.
TCP has the property to share in a fair manner the bottleneck bandwidth between flows while DiffServ network provides a level of service controllable and predictable. ...
This paper proposes to look forward to the results obtained in terms of TCP throughput guarantee in the DiffServ Assured Forwarding (DiffServ/AF) service and to present an overview of the different proposals ...
In the following sections, we present an extension of this dynamic approach but with a fair sharing of the excess bandwidth.
B. ...
doi:10.1007/s12243-008-0053-2
fatcat:x6xmfazuorca5dsqrhtamokdxm
AIMD Penalty Shaper to Enforce Assured Service for TCP Flows
[chapter]
2005
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 2005; you can also visit the original URL.
The file type is application/pdf.
The main novelty of this shaper is that the shaping applies an AIMD penalty delay which depends on the out-profile losses in a DiffServ network. ...
Many studies explored the guaranteed TCP throughput problem in DiffServ networks. Several new marking schemes have been proposed in order to solve this problem. ...
In [5] , a fair allocation of excess bandwidth has been proposed based on a traffic conditioner. ...
doi:10.1007/978-3-540-31957-3_34
fatcat:xcblllbgq5hc7ivbnvk6qxljg4
« Previous
Showing results 1 — 15 out of 203 results