79 citations found. Retrieving documents...
ATM Forum, ATM User-Network Interface (UNI) Specification Version 3.1.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

The Renegotiable Variable Bit Rate Service - Giordano, Le Boudec (1999)   (Correct)

....ordinary, time invariant, leaky bucket shaper [5] 6] In other words, this is true only with the second approach. Second, the no reset approach is in line with the Dynamic Generic Cell Rate Algorithm (DGCRA) used to specify conformance at the UNI for the available bit rate (ABR) service of ATM [7], 8] We examine later in the paper the practical implication of the no reset approach (Section 4) Our class of time varying shapers is a special case of thegeneralconceptoftimevarying shapers, defined in [9] A general time varying shaper can be defined as follows. Given a function of two ....

The ATM Forum, ATM User-Network Interface (UNI) Signalling Specification, Version 4.0, 1996. ftp://ftp.atmforum.com/pub/approved-specs/af-sig0061. 000.ps.


Scalable Resource Reservation for the Internet - Almesberger (1999)   (21 citations)  (Correct)

....the user network interface (UNI) The UNI de nes several types of physical media (i.e. multi mode ber, UTP5, etc. many bit rates (ranging from only a few Mbps to 155 Mbps and more) line codings, con guration and signaling protocols, etc. The most commonly used version of the UNI is 3. 1 [49], but many providers of ATM stacks have already implemented the next version, 4.0 [10, 18] or are working on it. UNI 4.0 adds many new features to UNI 3.1, the most interesting ones 117 Public network Private network Switch UNI UNI End system ES S S ES Figure A.1: General structure of an ....

....Calling end system 1 Called end system Figure A.2: Signaling message ows Two mechanisms that are closely related to signaling are address con guration and a directory service. Addresses are con gured either manually or automatically, using the interim local management interface (ILMI, [49]) which is based on SNMP [55] An ATM NSAP address (see section 5.1.3.1 of [49] has a length of 20 bytes. Human beings therefore usually prefer to use names instead of numeric addresses. This can be accomplished either by using a hosts le or by using a distributed directory service. ATM Forum ....

[Article contains additional citation context not shown here]

The ATM Forum. ATM User-Network Interface (UNI) Speci cation, Version 3.1, ftp://ftp.atmforum.com/pub/UNI/ver3.1, Prentice Hall, 1994.


Scalable Resource Reservation for the Internet - Almesberger (1999)   (21 citations)  (Correct)

....values in IP packets based on packet classi cation and on rate metering. The Di erentiated Services architecture generalizes this concept even more and is discussed in a separate section below. 1.2. 2 ATM One network technology for providing reservations is the Asynchronous Transfer Mode (ATM) [9, 10], which promises to provide a scalable network architecture. The design of ATM considered reservation mechanisms from the very beginning. ATM networks therefore now o er reliable reservation mechanisms and well understood trac management concepts. Corporate and public ATM networks are already a ....

....if RSVP is deployed across the Internet, it is possible to use TCP IP applications with some end to end quality of service. 1.2. 4 Di erentiated Services Traditional resource reservation architectures that have been proposed for integrated service networks (RSVP [13] ST 2 [16] Tenet [17] ATM [10, 18], etc. all have in common that intermediate systems (routers or switches) need to store per ow state information. The more recently designed Di erentiated Services architecture [19] o ers improved scalability by aggregating ows and by maintaining state information only for such aggregates. The ....

[Article contains additional citation context not shown here]

The ATM Forum, Technical Committee. ATM User-Network Interface (UNI) Signalling Speci cation, Version 4.0, ftp://ftp.atmforum.com/pub/ approved-specs/af-sig-0061.000.ps, The ATM Forum, July 1996.


On a Class of Time Varying Shapers with Application to the.. - Giordano, Le Boudec (2000)   (2 citations)  (Correct)

....ordinary, time invariant, leaky bucket shaper [7] 8] In other words, this is true only with the second approach. Second, the no reset approach is in line with the Dynamic Generic Cell Rate Algorithm (DGCRA) used to specify conformance at the UNI for the available bit rate (ABR) service of ATM [9], 10] We examine later in the paper the practical implication of the no reset approach (Section 4.4) Our class of time varying shapers is a special case of the general concept of time varying shapers, defined in [11] A general time varying shaper can be defined as follows. Given a function ....

The ATM Forum, ATM User-Network Interface (UNI) Signalling Specification, Version 4.0, 1996. ftp://ftp.atmforum.com/pub/approved-specs/af-sig-0061.000.ps.


On the Performance and Feasibility of Multicast Core Selection .. - Fleury, Huang (2000)   (24 citations)  (Correct)

....parallel processing. The growing importance of multicast communication in computer networking and telecommunications is demonstrated by the development and widespread use of IP multicast [6] and by the inclusion of multicast services in standards for asynchronous transfer mode (ATM) networks [1]. A multipoint connection (MC) is a virtual topology, de ned by routing table entries and other state information within the network, that supports the delivery of multicast data among multiple computers. The topology of an MC is usually a tree, whose edges represent communication links. Routing ....

....along branches of the tree. A multicast protocol de nes how the MC is established and maintained. A number of multicast protocols have been proposed for use in the Internet, including the DVMRP [19] MOSPF [17] CBT [3] and PIM [7] For ATM networks, a relatively simple form of MC is described in [1], although other protocols are under consideration [11, 16] In an important class of multicast protocols, called core based forwarding (CBF) protocols, a core node is associated with each multicast group. The topology of the multicast tree, shared by the group, is de ned to be the union of the ....

[Article contains additional citation context not shown here]

ATM Forum, ATM User-Network Interface (UNI) Specication Version 3.1. Prentice Hall, September 1994.


Implementing SSCOP in Hardware - Long (1997)   (Correct)

....only appropriate for bulk data transfer. Requestresponse style protocols tend to use small packets. Chesson [19] reports that 60 to 80 of traffic on current TCP IP networks is between 60 and 200 bytes in length. The average length of packets used by the standard ATM connection setup protocol [8] is 64 bytes. Several approaches have been taken to reduce protocol overhead. Since interrupt handling is expensive, one method is to reduce the number of interrupts generated by the network adapter. Network adapters usually queue packets for processing; instead of generating an interrupt each ....

ATM Forum, ATM User-Network Interface (UNI) Specification, Version 3.1, Prentice Hall, 1994.


A Qos-Based Routing Algorithm For PNNI ATM Networks - Tham, Mai, Wong   (Correct)

....Extensions The BHRA algorithm described in the previous sections is designed primarily for unicast routing under the PNNI protocol. However, PNNI 1.0 together with UNI 3.1 [18] also support point to multipoint (p2m) multicast signaling. Subsequently, in the PNNI 2.0 draft [20] and UNI 4. 0 [19], leaf initiated joining with p2m signaling has been added to enhance the multicast capability of ATM networks. An efficient multicast routing algorithm is the key to multicast applications, such as video ondemand and video audio conferencing over ATM networks. It has already attracted a lot of ....

ATM Forum, ATM User Network Interface (UNI) Specification Version 4.0, <afsig -0061.000>, July 1996


A Qos-Based Routing Algorithm For PNNI ATM Networks - Tham, Mai, Wong   (Correct)

....and switches that tend to become bottlenecks. However, the drawback is its inability to do load balancing. 5. BHRA Multicast Extensions The BHRA algorithm described in the previous sections is designed primarily for unicast routing under the PNNI protocol. However, PNNI 1.0 together with UNI 3. 1 [18] also support point to multipoint (p2m) multicast signaling. Subsequently, in the PNNI 2.0 draft [20] and UNI 4.0 [19] leaf initiated joining with p2m signaling has been added to enhance the multicast capability of ATM networks. An efficient multicast routing algorithm is the key to multicast ....

ATM Forum, ATM User Network Interface (UNI) Specification Version 3.1, <afsig -0010.002>, September 1995


The Complexity of Path Coloring and Call Scheduling - Erlebach, Jansen (2000)   (6 citations)  (Correct)

....does not exceed the link capacity. We refer to the problem of assigning paths and starting times to connection requests with the goal of minimizing the latest completion time as the call scheduling problem. A popular example of networks that support bandwidth reservation are ATM networks [40,42]. In this paper, call scheduling and path coloring are considered as o line minimization problems. We say that call scheduling or path coloring is NP hard in a certain setting if the decision version of the problem is NP complete. For a given instance I of a minimization problem, we let OPT ....

The ATM Forum, Upper Saddle River, NJ. ATM User-Network Interface (UNI) Specication Version 3.1., 1995.


SRP: a Scalable Resource Reservation Protocol for the.. - Werner Almesberger Werner (1998)   (14 citations)  (Correct)

....overhead mainly consists in the introduction of a packet type with three values (reserved, request or best effort) which can be encoded on two bits. 1 1 Introduction Resource reservation architectures that have been proposed for integrated service networks (RSVP [1] ST 2 [2] Tenet [3] ATM [4, 5], etc. all have in common that intermediate systems (routers or switches) need to store per flow state information. This requirement probably stems from the desire to provide a network service that is as deterministic as possible. Now the IETF has proposed a class of reserved service, called ....

The ATM Forum, Technical Committee. ATM User-Network Interface (UNI) Signalling Specification, Version 4.0, ftp://ftp. atmforum.com/pub/approved-specs/af-sig-0061.000.ps, The ATM Forum, July 1996.


On a Class of Time Varying Shapers with Application to the.. - Giordano, Le Boudec (1998)   (2 citations)  (Correct)

....ordinary, time invariant, leaky bucket shaper [4] 5] In other words, this is true only with the second approach. Second, the no reset approach is in line with the Dynamic Generic Cell Rate Algorithm (DGCRA) used to specify conformance at the UNI for the available bit rate (ABR) service of ATM [6], 7] We examine later in the paper the practical implication of the no reset approach (Section 4.4) Our class of time varying shapers is a special case of the general concept of time varying shapers, defined in [8] A general time varying shaper can be defined as follows. Given a function of ....

The ATM Forum, ATM User-Network Interface (UNI) Signalling Specification, Version 4.0, 1996. ftp://ftp.atmforum.com/pub/approved-specs/af-sig-0061.000.ps.


IP Integrated Services Support in ATM - Berson (1996)   (2 citations)  (Correct)

....effort service. Signalling for these new services is done by RSVP[3, 12] the Resource ReSerVation Protocol. Due to extensive telephone company support, ATM is rapidly becoming an important link layer technology. As this draft was being written, the current version of ATM signalling was UNI 3. 1[9], and UNI 3.1 is expected to be predominant in the marketplace in the near term. However, a new version (UNI 4.0) is expected to be standardized soon, and this draft will be updated as appropriate. One of the important features of ATM technology is the ability to request a point to point Virtual ....

ATM User-Network Interface (UNI) Specification - Version 3.1, Prentice Hall.


On a Class of Time Varying Shapers with Application to the.. - Giordano, Le Boudec (2000)   (2 citations)  (Correct)

....ordinary, time invariant, leaky bucket shaper [7] 8] In other words, this is true only with the second approach. Second, the no reset approach is in line with the Dynamic Generic Cell Rate Algorithm (DGCRA) used to specify conformance at the UNI for the available bit rate (ABR) service of ATM [9], 10] We examine later in the paper the practical implication of the no reset approach (Section 4.4) Our class of time varying shapers is a special case of the general concept of time varying shapers, defined in [11] A general time varying shaper can be defined as follows. Given a function ....

The ATM Forum, ATM User-Network Interface (UNI) Signalling Specification, Version 4.0, 1996. ftp://ftp.atmforum.com/pub/approved-specs/af-sig-0061.000.ps.


Off-Line and On-Line Call-Scheduling in Stars and Trees - Erlebach, Jansen (1997)   (1 citation)  Self-citation (Uni)   (Correct)

No context found.

The ATM Forum, Upper Saddle River, NJ. ATM User-Network Interface (UNI) Specification Version 3.1., 1995.


A Path Optimization Signaling Protocol for Inter-Switch Handoff .. - Wong, Leung (1998)   Self-citation (Atm)   (Correct)

....path. Thus, no further path optimization executions are necessary. 5.3 Connection Setup and Rerouting Once the crossover switch is determined, connection setup between the anchor switch and the crossover switch is performed. Connection setup is done by using the ATM UNI signaling protocol [4]. Referring to Figure 5, the anchor switch sends a signaling packet CONNECT to the crossover switch to setup the new handoff segment. The crossover switch then replies by sending a CONNECT ACKNOWLEDGE packet to the anchor switch. This message indicates that the setup of the new handoff segment is ....

The ATM Forum Technical Committee, ATM User-Network Interface (UNI) Specification Version 3.1, September 1994.


Off-Line and On-Line Call-Scheduling in Stars and Trees - Erlebach, Jansen (1997)   (1 citation)  Self-citation (Uni)   (Correct)

....durations has performance ratio at most 5 log n. 1 Introduction Call scheduling problems arise naturally in modern communication networks, e.g. ATM networks. ATM (asynchronous transfer mode) is a network protocol that allows high bandwidth connections with a guaranteed quality of service [15]. A connection request (call) can specify a certain bandwidth requirement, and the network guarantees that, once the connection is established, this bandwidth is available to it as long as it remains active. Consequently, this bandwidth must be reserved on all links along a path that connects the ....

The ATM Forum, Upper Saddle River, NJ. ATM User-Network Interface (UNI) Specification Version 3.1., 1995.


Survivable ATM Group Communications Using Disjoint Meshes, Trees, .. - Yurcik (1999)   (Correct)

No context found.

ATM Forum, ATM User-Network Interface (UNI) Specification Version 3.1.


Scheduling of Virtual Connections in Fast Networks - Erlebach, Jansen (1996)   (40 citations)  (Correct)

No context found.

The ATM Forum. ATM User-Network Interface (UNI) Specification Version


High-Performance Communication Networks - Walrand, Varaiya   (62 citations)  (Correct)

No context found.

The ATM Forum (1995). ATM User-Network Interface (UNI) Specification: Version 3.1. PTR Prentice Hall, Englewood Cliffs, NJ.


System-Level Timing Analysis and Scheduling for Embedded Packet .. - Chakraborty (2003)   (Correct)

No context found.

ATM Forum Technical Committee. ATM user-network interface (UNI) specification version 3.1, September 1994.


Network Working Group E. Crawley, Editor Request for.. - Baker Cisco Systems   (Correct)

No context found.

ATM Forum. ATM User Network Interface (UNI) Specification Version 3.1. Prentice Hall, June 1995.


Unknown -   (Correct)

No context found.

ATM Forum, ATM User-Network Interface, Version 3.0 (UNI 3.0) Specification, 1994.


On the Impact of Link/Node Failures and Network.. - SZEKELY, SZUCS.. (2002)   (Correct)

No context found.

ATM Forum Technical Committee, ATM User-Network Interface (UNI) Signalling Specification, Version 4.0, ATM Forum/95-1434R8, April 1996.


Scheduling of Virtual Connections in Fast Networks - Erlebach, Jansen (1996)   (40 citations)  (Correct)

No context found.

The ATM Forum. ATM User-Network Interface (UNI) Specification Version


Support for Leaf Initiated Join in PNNI - Tedijanto, al. (1996)   (Correct)

No context found.

ATM User-Network Interface (UNI) Signalling Specification v. 4.0, June 1996.

First 50 documents  Next 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC