Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
42,521
Table 2 - Sustained data rate and maximum distance Nominal speed Half-duplex Full-duplex Maximum distance at full speed Extended Distance Option
"... In PAGE 18: ... If the link is being operated in full-duplex mode there is an additional overhead of 4 characters for the ACK and RR responses. With 128-byte data fields these overheads lead to the sustained data rates tabulated in Table2 . The equations used are as follows.... In PAGE 70: ...s sent to the specified ULP. The FRAME TYPE is not checked. b) If the SMS CODE value is greater than or equal to 80h and the specified ULP is not supported, then an Asynchronous Alert process shall be invoked with an ALERT CODE value of UNSUPPORTED ULP. c) If the SMS CODE value is reserved in Table2 6, then an Asynchronous Alert process shall be invoked with an ALERT CODE value of UNKNOWN SMS. d) If the SMS CODE value is a non-reserved value shown in Table 26, but the FRAME TYPE or NODE TYPE are incorrect, then an Asynchronous Alert process shall be invoked with an ALERT CODE value of UNKNOWN SMS.... In PAGE 70: ... c) If the SMS CODE value is reserved in Table 26, then an Asynchronous Alert process shall be invoked with an ALERT CODE value of UNKNOWN SMS. d) If the SMS CODE value is a non-reserved value shown in Table2 6, but the FRAME TYPE or NODE TYPE are incorrect, then an Asynchronous Alert process shall be invoked with an ALERT CODE value of UNKNOWN SMS. e) If the SMS CODE value corresponds to the CONFIGURE PORT, MASTER ALERT, QUERY PORT, QUERY PROTOCOL, or QUIESCE SMS, and one of these SMSs is already outstanding in the node from this Configutor node, then generate a RESPONSE SMS with a RETURN CODE field value of OVERLAPPED... In PAGE 76: ... The same tag is also used in an ASYNC ALERT SMS if the node subsequently reports an Asynchronous Alert. The TAG value is assigned by the Master and shall be unique among the TAG values used by other nodes in the Web as indicated by the Asynchronous Alert table (see Table2 0). The receipt of the resulting RESPONSE SMS shall release the TAG value for use by SMSs other than the CONFIGURE PORT SMS, and the tag value shall no longer remain active in the Async Alert Tag pool (see 12.... In PAGE 79: ... The UNIQUE ID field identifies the node that invoked the Asynchronous Alert. The ALERT CODE field consists of three parts as shown in Table2 8, and is copied from the same field of the associated ASYNC ALERT SMS. The CONTROL field is copied from the same field in the associated ASYNC ALERT SMS.... ..."
Table 2. MO/MT Full Duplex Processing Times (in milliseconds)
"... In PAGE 12: ...ommercial service (e.g. direct Internet Protocol (IP) access, ftp access, MT ring alert). Table2 shows the average modem processing times in milliseconds running in Full Duplex mode given MO messages of size 100, 500, 1500 Bytes and MT message sizes of 100, 300, 500, 1000, and 1500 Bytes. These packets were automatically generated by the applications, rather than by interactive users.... ..."
Table 2: Packet Duration Times for Full-Duplex Ethernet
2002
"... In PAGE 2: ...annot be transmitted back-to-back. The IEEE specification calls this parameter the interFrameGap. While not defined in terms of bit times, interFrameGap happens to be 96 bit times in duration for 10Mb/s, 100Mb/s, and 1Gb/s Ethernet. Table2 lists the durations (in bit times) for the minimum and maximum packet sizes. From this table we see, for example, that the time from the start of a minimum sized packet to the start of the next packet is 672 bit times.... ..."
Cited by 7
Table 1: Comparison of interconnection networks, assuming full-duplex bidirectional data channels.
"... In PAGE 3: ... Figure 1 shows examples of 2-D HOW systems. Table1 compares the numbers of channels in the binary hypercube (i.e.... ..."
Table 1 Description of a host processor. 2. in full-duplex mode,
Table 1. Level of misrouting for the full-duplex and half-duplex chaos networks at full load.
"... In PAGE 6: ...Table1 shows the level of misrouting at saturation for each traffic pattern under the two network configurations. Note that each time a packet is derouted, its path increases by 2 hops.... ..."
Table 2: Communication results for simple graphs in the one-port, full-duplex, store-and- forward and constant time model ([8, 9]).
"... In PAGE 7: ... For surveys presenting results for general graphs and for di erent models of communication, we refer the interested reader to [8, 9]. We recall in Table2 some results that will be useful in the following. Let Kn denote the complete graph.... In PAGE 8: ...e ned in Section 2.2. Lemma 2 On the star graph S(n), the broadcasting time veri es: BroadS(n) n + n?1 X k=3 dlog ke : Proof. As noticed in Table2 , in Section 2.2 , the property holds for n 3.... In PAGE 9: ...osS(n) be the gossiping time for the star graph S(n) under the model de ned in Section 2.2. Lemma 3 On the star graph S(n), the gossiping time veri es: GosS(n) 3n 2 ? 2 + n X k=4 dlog ke : Proof. Using Table2 , this lemma is straightforward for n = 3. Assume the proposition holds for n ? 1, n gt; 3.... In PAGE 9: ... Step 2 costs exactly one time unit. Step 3 can be implemented through an optimal gossiping protocol in the complete graph, which costs GosKn = dlog ne + odd(n), as recalled in Table2 . Thus, the recurrence equation of the gossiping algorithm is the following.... In PAGE 17: ... Perform again a gossiping within the columns. The rst and third steps are gossiping on a complete graph Kn?1, thus each such step costs dlog(n ? 1)e + odd(n ? 1) as shown in Table2 . The transposition step only costs one communication step.... ..."
Table 2 shows the results of the NDT half-duplex detection algorithm. In case 1, the path between the client and NDT server is build from full-duplex Fast Ethernet links. Note that throughput value reaches 94% of the link capacity, and the connection is receiver buffer limited. In case 2, the client was changed to a half-duplex condition. Note that the throughput drops to 70% of the link capacity and the connection rapidly transitions between the receiver buffer limited and send buffer limited states, while the connection spends the majority of the time in the receiver buffer limited state. In case 3 the NDT server was changed to a half-duplex condition and the client was returned to a full-duplex condition. The same half-duplex signature remains.
2003
"... In PAGE 9: ... Table2 - Half Duplex link detection Congestion Finally the NDT looks for signs of congestion. It is obvious that a Fast Ethernet link shared by ten TCP streams will provide each stream with approximately 10 Mbps of throughput.... ..."
Cited by 2
Table 9: Basic gures for several link technologies. All gures refer to full duplex links. An 8 bit into 10 bit encoding has been assumed for the LVDS case.
in Italy.
2001
Table 6. Cycles spent in each function per packet for each frame-ordering method.
2005
"... In PAGE 10: ... The reduction in per-frame processing requirements en- ables a 6-processor NIC configuration to reduce its proces- sor and scratchpad frequency from 200 MHz to 166 MHz. Table6 shows the per-packet cycle requirements for each portion of NIC processing for the 200 MHz software-only and 166 MHz RMW-enhanced configurations. Both con- figurations achieve line rate for full-duplex streams of maximum-sized packets.... ..."
Cited by 13
Results 1 - 10
of
42,521
