Next Steps for the IP QoS Architecture

Huston, Geoff

doi:10.17487/rfc2990

Cited by 127 publications

(50 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[5]). The monitors used tcpdump 4 to measure the traffic that traversed Hub 1 and Hub 2, respectively.…”

Section: Test Setup and Resultsmentioning

confidence: 99%

“…5 It was sent from the router to Monitor 2, which means that it could not cause collisions but only lead to congestion in the queue of the router's outgoing network interface. We generated 11 classes of background traffic, which always lasted for 50 seconds, starting from the 25th second, and consisted of 10 to 100 (in steps of 10) and 120 packets per second, respectively.…”

Section: Test Setup and Resultsmentioning

confidence: 99%

See 1 more Smart Citation

MINI: Making MIDI Fit for Real-Time Musical Interaction over the Internet

Welzl

Mühlhäuser

Borchers

2007

Ninth IEEE International Symposium on Multimedia Workshops (ISMW 2007)

View full text Add to dashboard Cite

show abstract

“…[5]). The monitors used tcpdump 4 to measure the traffic that traversed Hub 1 and Hub 2, respectively.…”

Section: Test Setup and Resultsmentioning

confidence: 99%

Section: Test Setup and Resultsmentioning

confidence: 99%

MINI: Making MIDI Fit for Real-Time Musical Interaction over the Internet

Welzl

Mühlhäuser

Borchers

2007

Ninth IEEE International Symposium on Multimedia Workshops (ISMW 2007)

View full text Add to dashboard Cite

show abstract

“…Note that in DDCA a node need not maintain the network topology and link-state information, as in sourcebased routing algorithms. The information in the delay and cost tables can be distributed to nodes using distance (or path) vector protocols [18].…”

Section: Probe-based Distributed Heuristicmentioning

confidence: 99%

Algorithms and protocols for stateless constrained-based routing

Zhang

Krunz

2003

Computer Communications

View full text Add to dashboard Cite

Quality of service (QoS) routing has generally been addressed in the context of reservation-based network services (e.g. ATM, IntServ), which require explicit (out of band) signaling of reservation requests and maintenance of per-flow state information. It has been recognized that the processing of per-flow state information poses scalability problems, especially at core routers. To remedy this situation, in this paper we introduce an approach for stateless QoS routing in IP networks that assumes no support for signaling or reservation from the network. Instead, our approach makes use of the currently unused two bits in the DiffServ (DS) byte of the IP packet header. Simple heuristics are used to identify a low-cost delay-constrained path. These heuristics essentially divide the end-to-end path into at most two 'superedges' that are connected by a 'relay node'. Routers that lie on the same superedge use either the cost metric or the delay metric (but not both) to forward the packet. Standard hop-by-hop forwarding is performed with respect to either metric. Two different approaches are presented for implementing the relay-based forwarding. In the first approach, a probing protocol is used to identify the relay node and the routing metrics of the superedges. Tunneling and packet encapsulation are then used to forward packets from the source node to the relay node and then from the relay node to the destination node. The second approach does not require probing, but instead relies on the time-to-live (TTL) field in the header of the IP packet. Simulations are presented to evaluate the cost performance of the various approaches. q

show abstract

“…The providers will then need to make sure that these requirements can be delivered accordingly. Matching these service requirements to a set of control mechanisms in a consistent manner remains an area of weakness within the existing IP QoS architectures [1]. As well as the need to provide dynmnic traffic management, monitoring and control, other operation or policy issues such as service management, security, customer management, accounting and billing also must also be addressed.…”

Section: Introductionmentioning

confidence: 99%

“…It provides a distinct route or path info from a source node to adestination node and viee versa on a hop-by-hop basis. (1), end-to-end path ID or routing option, billing option, and also other rules and policies. These records are constantly monitored and updated.…”

mentioning

confidence: 99%

A Policy-Based Bandwidth Resource Provisioning Architecture

Chieng

Marshall

2003

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

Abstract:We present a policy-based, agent-enhanced resource provisioning architecture, which facilitates flexible and quantitative end-to-end bandwidth reservation and management on aper-user, per-application or per-flow basis. Based on this architecture, various session level Service Level Agreement (SLA) negotiation schemes involving bandwidth allocation, service start time, guaranteed session duration can be introduced. The results show how these negotiation schemes can be utilised for the benefits of both network users and providers.

show abstract

Next Steps for the IP QoS Architecture

Cited by 127 publications

References 7 publications

MINI: Making MIDI Fit for Real-Time Musical Interaction over the Internet

MINI: Making MIDI Fit for Real-Time Musical Interaction over the Internet

Algorithms and protocols for stateless constrained-based routing

A Policy-Based Bandwidth Resource Provisioning Architecture

Contact Info

Product

Resources

About