To: Frank A. Coluccio who wrote (501 ) 7/22/2000 11:14:50 PM From: ftth Read Replies (1) | Respond to of 46821 Hi Frank, well for starters regarding the terminology, we can just drop the P-DAMA reference, in favor of a description or some other term. As long as it's understood we could call it "Betty"<g>. I don't have a P-DAMA reference to point you to unfortunately. DAMA in general isn't widely used. There are essentially 3 methods for controlling a DAMA (demand-assigned multiple access) system: contention-based distributed; contention-based centralized; polling. With polling the master asks the slaves periodically if they need resources; with distributed, the intelligence is in the end stations; with centralized there's a master. Centralized is what applies here. In general for centralized DAMA, when a station has demand for channel resources it requests it, and if granted holds the resource until it specifically releases it (or the system releases it). In packet-DAMA, only a single (variable sized) packet is granted (and only a single small request packet is sent). After that packet has gone, a completely new request has to be made to send another packet. I should note that the term/acronym PDAMA is not used in the DOCSIS spec. There is no quickie name assigned to the process in the spec. So I'm open to calling it something else but PDAMA seems good and concise. It'd be awfully hard (and very time consuming) to do detailed descriptions of upstream and downstream, and without pictures it's awfully hard to explain many parts of it. So I'll take the easy way out and just give a link to the latest document from the DOCSIS 1.1 spec family that relates to what we're talking about here (MAC and PHY):livelink.cablelabs.com And if there are specific pieces to talk about in more detail, at least that way there is a baseline reference to pictures, tables, terminology, and sections.