EP0853403A2 - Extension de porteuse dans les réseaux Ethernet - Google Patents
Extension de porteuse dans les réseaux Ethernet Download PDFInfo
- Publication number
- EP0853403A2 EP0853403A2 EP98300110A EP98300110A EP0853403A2 EP 0853403 A2 EP0853403 A2 EP 0853403A2 EP 98300110 A EP98300110 A EP 98300110A EP 98300110 A EP98300110 A EP 98300110A EP 0853403 A2 EP0853403 A2 EP 0853403A2
- Authority
- EP
- European Patent Office
- Prior art keywords
- duration
- network
- sec
- data
- layer
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 claims abstract description 46
- 238000004364 calculation method Methods 0.000 claims abstract description 6
- 239000012634 fragment Substances 0.000 claims abstract description 5
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 claims description 24
- 238000000034 method Methods 0.000 claims description 24
- 238000001514 detection method Methods 0.000 claims description 12
- 230000007246 mechanism Effects 0.000 claims description 12
- 230000001419 dependent effect Effects 0.000 claims description 5
- 230000000644 propagated effect Effects 0.000 abstract description 3
- 239000010410 layer Substances 0.000 description 61
- 238000007726 management method Methods 0.000 description 11
- 238000012986 modification Methods 0.000 description 11
- 230000004048 modification Effects 0.000 description 11
- 230000006870 function Effects 0.000 description 8
- 239000000835 fiber Substances 0.000 description 6
- 238000004458 analytical method Methods 0.000 description 4
- 230000001934 delay Effects 0.000 description 3
- 238000012360 testing method Methods 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 230000008901 benefit Effects 0.000 description 2
- 230000002457 bidirectional effect Effects 0.000 description 2
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005538 encapsulation Methods 0.000 description 2
- 230000006855 networking Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000011664 signaling Effects 0.000 description 2
- 241000287219 Serinus canaria Species 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000000295 complement effect Effects 0.000 description 1
- 230000008878 coupling Effects 0.000 description 1
- 238000010168 coupling process Methods 0.000 description 1
- 238000005859 coupling reaction Methods 0.000 description 1
- 238000013144 data compression Methods 0.000 description 1
- 238000006731 degradation reaction Methods 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000013213 extrapolation Methods 0.000 description 1
- 239000011229 interlayer Substances 0.000 description 1
- 239000002346 layers by function Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 238000000926 separation method Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/44—Star or tree networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/40—Bus networks
- H04L12/407—Bus networks with decentralised control
- H04L12/413—Bus networks with decentralised control with random access, e.g. carrier-sense multiple-access with collision detection [CSMA-CD]
Definitions
- This invention relates to Ethernet networks.
- a network is a communications facility that permits a number of workstations, computers or other equipment (hereinafter collectively "computer(s)”) to communicate with each other. Portions of a network involve hardware and software, for example, the computers or stations (which individually may comprise one or more central processing units, random access and persistent memory), the interface components, the cable or fiber optics used to connect them, as well as software that governs the access to and flow of information over the network.
- the transmission medium In networks in which data flow is 100 Mbits/sec. ("Mbps") or higher, the transmission medium is often fiber optics. In networks in which a slower data rate is acceptable, e.g., 10 Mbps, the transmission medium may be coaxial cable or, as is often the case for an Ethernet network, twisted wires.
- network architecture defines protocols, message formats and other standards to which the computers and other equipment, and software must adhere.
- Most network architectures have adopted a model comprising functional layers in which a given layer is responsible for performing a specific set of functions, and for providing a specific set of services.
- the services provided by each layer and the inter-layer interfaces can define a network architecture.
- Protocols define the services covered across a layer interface and the rules followed in the processing performed as a part of that service.
- the International Standards Organization (“ISO)
- OSI open systems interconnect
- IEEE Institute of Electrical and Electronics Engineers
- LAN local area network
- Figure 1A depicts a network according to the IEEE Project 802 modification to the ISO seven layer model, in which two computers 10, 10' are can communicate data to each other over a physical link medium 20, e.g., cable.
- a repeater system 120 may be coupled in series with cable 20, the distances between a computer and repeater being D1 and D2. If there are no repeaters, the distance between computers 10, 10' is given by D1+D2.
- a network may have many hundreds of computers rather than two, and the distance D1+D2 separating adjacent computers may vary from a few meters to many Kms. For a computer network implemented within a single office building, separation distances D1+D2 of perhaps 200 m are typical.
- the bottommost layer 30 in both the ISO and Project 802 model is a physical layer that is concerned with connections between two machines (e.g., computers 10, 10') to allow transmission of bit streams over a physical transmission medium (e.g., cable 20).
- physical layer 30 is concerned with types of cabling, cable plugs, connectors, and the like.
- the present invention is directed to Ethernet networks adhering to the carrier sense multiple access with collision detection (“CSMA/CD”) standard.
- CSMA/CD carrier sense multiple access with collision detection
- MII Media Independent Interface
- MAC media access control
- MII data and delimiters are synchronous to the corresponding clock, and two asynchronous media status signals are provided, namely carrier sense (“CRS”), and collision (“COL").
- CRS carrier sense
- COL collision
- MII provides a two wire serial management interface for control and status gathering, namely management data clock (“MDC”), and management data input/output (“MDIO”).
- MDC management data clock
- MDIO management data input/output
- the layer above the physical layer is a data link layer that is responsible for error-free transmission of data frames between network nodes.
- a data link control protocol describes operation and interfaces of this layer, which must also shield higher layers in the model from concerns about the physical transmission medium.
- the data link layer is subdivided into MAC layer 50B and an overlying logical link control (“LLC") layer 50A.
- the media access control sublayer is concerned with access control methods to determine how to control the use of the physical transmission medium.
- the LLC sublayer 50A is responsible for medium-independent data link functions and allows the network layer 60 above to access LAN services independently of how the network is implemented. According to the 802 architecture, LLC sublayer 50A provides services to network 60 in the same fashion as would a conventional data link protocol in a wide area network.
- the MAC sublayer 50B provides services to the overlying LLC sublayer 50A, and manages sharing of the transmission medium among the different stations on the network.
- a media access management function receives a frame from the data encapsulation function after the necessary control information has been added. Thereafter, media access management is responsible for ensuring physical transmission of the data.
- the data frame in an Ethernet full-duplex environment has a maximum size of 1,518 bytes.
- CSMA/CD carrier sense multiple access with collision detection
- Physical transmission of the data may be ensured using carrier sensing to defer transmission until the network is clear.
- a transmitting station e.g., computer or user 10
- listens or monitors the transmission medium e.g., cable 20
- the media access management determines whether the transmission medium (or carrier) is presently being used. If the medium is not being used, media access management passes the data frame to physical layer 30 for transmission. Even after transmission of the frame has begun, media access management continues to monitor the carrier. If the carrier is busy, media access management continues monitoring until no other stations are transmitting. Media access management then waits a specified random time to allow the network to clear and thereafter begins transmission.
- network layer 60 concerns the routing of data from one network node to another. It is the role of network layer 60 to route data between network nodes.
- Transport layer 70 provides data transfer between two stations at an agreed upon level of quality once a connection is established between the stations.
- Transport layer 70 selects the particular class of service to be used, monitors transmission to ensure maintained service quality, and advises the stations (or users) if quality cannot be maintained.
- Session layer 80 provides services that organize and synchronize a dialogue occurring between stations, and manages data exchange between stations. As such, session layer 80 controls when stations can send and receive data, based upon whether they can send and receive concurrently or alternately.
- Presentation layer 90 ensures that information is presented to network users meaningfully, and may provide character code translation services, data conversion, data compression and expansion services.
- Application layer 100 provides a mechanism for application processes to access system interconnection facilities for information exchange.
- the application layer provides services used to establish and terminate inter-user connections, and to monitor and manage the interconnected systems and the resources they employ.
- the network shown in Figure 1A may be half-duplex (or shared), or full-duplex.
- half-duplex there is a single shared communications path, and at any given time a station can transmit and monitor, or can receive, but can never simultaneously transmit and receive.
- MAC layer 50B uses a CSMA/CD algorithm, e.g., IEEE 802.3, such that a station desiring to use the network to transmit must first listen to learn whether the network is busy. If busy, the station desiring to transmit defers transmission but continues to monitor medium status while waiting for the network to become idle. If idle, the station can begin transmitting.
- CSMA/CD algorithm e.g., IEEE 802.3
- An embodiment of the invention is intended for use with half-duplex networks, but is fully compatible with full-duplex networks.
- the CSMA/CD algorithm provides a useful pacing mechanism that will inhibit or defer access of arrival new data into the half-duplex network until the network is adequately prepared.
- Figures 1B and 1C depict CSMA/CD topologies that are found in half-duplex Ethernet network environments.
- Repeater system 120 topology of Figure 1B includes a 100 Mb/sec. repeater 130 that is coupled to 10/100 switches 140, 142, and to 100/1 switches 150, 152.
- Repeater 130 can handle a 100 Mb/sec. flowrate that is suitable for high end desktop computers, while switches 140, 142 handle a 10 Mb/sec. flowrate more appropriate to low end desktop computers. If present, switches 150, 152 handle 1 Mb/sec. flowrates suitable for even lower end systems.
- the topology of Figure 1B uses CSMA/CD in a single repeater collision domain within a server room environment.
- Figure 1C depicts a repeater system 120 topology that includes 100 Mb/sec. repeaters 130, 132, 10/100 switches 140, 142, and a 100 Mb/sec. switch 160.
- the 100 Mb/sec. flowrate available from switch 160, and from repeaters 130, 132 is appropriate for high end desktop computers, while the slower 10 Mb/sec. flowrate available from switches 140, 142 is more appropriate to low end desktop computers.
- the present invention is directed to the difficulties encountered in Ethernet networks when data, such as the packet shown in Figure 1D, is to be transmitted at high flowrates over long distances.
- the CSMA/CD access method relies upon a fundamental assumption that round trip ("R/T") propagation delay in a network is less than the time required to transmit the smallest allowable packet of information.
- R/T round trip
- the time required to transmit a packet is inversely proportional to transmission rate.
- the maximum diameter (D1+D2) of an Ethernet network is limited to 2.5 Km., e.g., the length of linkage 20 in Figure 1A cannot exceed this distance. If the transmission rate is increased to 100 Mb/sec., the physical size must shrink to approximately 205 m. By extrapolation, if a transmission rate of 1000 Mb/sec. (i.e., 1 gigabit/sec) could be achieved, the maximum network size would shrink to about 20 m, an impractically small size, especially as standard commercial building wiring practices require a network diameter of up to at least 200 m. Unfortunately, according to the prior art, a 200 m network distance would preclude a 1000 Mb/sec. flowrate Ethernet operating in a building whose network cabling was constructed in accordance with standard practices.
- An embodiment of the invention circumvents the limitation inherent in prior art carrier sense multiple access with collision detection (“CSMA/CD”) Ethernet environments that dictates that the duration of a minimum size transmission event must exceed the network roundtrip time. At high flowrates, meeting this frame size to roundtrip time constraint can mean the resultant network diameter over which network signals are carried is too small to be practical.
- the present invention functionally decouples frame size to roundtrip time constraints for CSMA/CD segments in an Ethernet network, which allows faster flowrates over meaningful diameter distances.
- An embodiment of the invention can achieve 100 Mb/sec. and indeed 1 Gb/sec. transmission rates at up to at least 200 m diameter distances in an Ethernet environment by selectively extending the duration of the minimum size event to exceed the network roundtrip time. This extension of the carrier event is made without extending the data field (which would degrade throughput in a multi-flowrate switched environment), and without altering the frame check sequence (which would degrade error detection).
- the code implementing the media access control layer and reconciliation layer at the transmitting and receiving end of the network is modified such that at 1 Gb/sec. data rates, non-data symbols are appended to the end of short packet frames.
- the collision detection window is extended to include these symbols, and the extension is also included in fragment discard calculations.
- the extension starts on an octet boundary and is an integer number of octets in length.
- the extension is removed, however, before checking the frame check sequence, and before passing the frame to logical link control ("LLC").
- LLC logical link control
- the extension is not propagated to network links operating at flowrates slower than 1000 Mb/sec., e.g., 100 Mb/sec., 10 Mb/sec.
- the invention is backward compatible with existing slower transmission rate Ethernet networks.
- Full-duplex Ethernet environments are insensitive to network roundtrip propagation delay. As such, full-duplex Ethernet networks do not require an extension, which the (transmitting) media access control function, according to the present invention, forms only in a half-duplex environment.
- the invention is compatible with half-duplex and with full-duplex Ethernet environments.
- Figure 2A depicts an Ethernet network that extends the duration of the minimum size event at 1000 Mb/sec. flowrates to ensure it exceeds the roundtrip ("R/T") time associated with the network.
- the system shown in many ways is similar to the prior art configuration of Figure 1A, except that the transmit and receive media access control layers 50B', and physical layers 30' have been modified to include modified code, respectively 50C, 30A, implementing carrier extension, according to an embodiment of the invention.
- repeater system 120 may now advantageously employ faster repeaters because the present invention enables 1000 Mb/sec. flowrates at distances up to at least 200 m.
- the slight modification made to the network system permits the network to be fully IEEE 802 compatible as well as complaint with the 802.3 standard.
- Scaling CSMA/CD to 1000 Mb/sec. is advantageous for several reasons.
- the CSMA/CD protocol is both widely implemented and well understood, and has demonstrated low cost at flowrates of 10 Mb/sec. and 100 Mb/sec. Further, a cost advantage accrues when implementing a shared 1000 Mb/sec. system as opposed to a switched 1000 Mb/sec. system.
- all network links operate at the same rate and computer stations contend for available bandwidth resources, whereas in a switched environment, various network links can operate at different rates, and contention arbitration occurs at switch device levels as opposed to within computer stations.
- FIG. 2B depicts a CSMA/CD topology as might be used in a single repeater collision domain, for example within a computer serve room.
- repeater system 120 includes a single 1000 Mb/sec. repeater unit 130, as well as 100/1000 Mb/sec. switches 140, 142, and 10/1000 Mb/sec. switches 150, 152.
- the 1000 Mb/sec. output from repeater 130 will go to one or more server computers, whereas the 100 Mb/sec. output from switches 140, 142 are suitable for high end desktop computers, and the slower 10 Mb/sec. output from switches 150, 151 are more suitable for lower end desktop computers.
- Figure 2C depicts a CSMA/CD topology suitable for use in single repeater collision domains in which 1000 Mb/sec. horizontal runs are encountered.
- Unit 260 is a 1000 Mb/sec. switch whose 1000 Mb/sec. output is suitable for server computers, and ultra high end desk top computers.
- Units 230, 232 are 1000 Mb/sec. repeaters whose 1000 Mb/sec. outputs are suitable for higher end desktop computers, whereas units 240, 242 are 100/1000 Mb/sec. switches whose 100 Mb/sec. outputs are more suitable for high end desktop computers.
- CSMA/CD topology must support horizontal runs having a spanning diameter (D1+D2) up to at least 200 m.
- the topologies of Figures 2B and 2C are symmetrical or bidirectional in that signal flow can be right-to-left, or left-to-right.
- the design of 1000 Mb/sec. systems includes calculation of a bit budget that can depend upon many factors.
- PHY physical layer
- MAC medium access control
- Figure 2D depicts a modified network packet format used by the modified network of Figure 2A.
- Packet 200' shown in Figure 2D is similar to the prior art packet 200 shown in Figure 1D except that an extension 300 is provided as needed at 1000 Mb/sec.
- the extension ensures that a minimum size event has a duration exceeding the network roundtrip time.
- the preferred relevant minimum sizes (expressed in bytes) used in an embodiment of the invention are depicted in Figure 2D.
- the extension is made using non-data symbols that are recognized as such by MAC 50B' and PHY 30'.
- extension starts on an octet boundary, and has an extension length that is N octets in length, where N is preferably an integer.
- a data symbol represents n binary bits of information, where the range of values for the data symbol is from 0 to (2 n -1).
- the PHY layers In local area networks, it is common for the PHY layers to perform an encoding such that these data symbols are converted (or mapped) into a sequence of code symbols (or bits) before transmission onto the physical medium.
- the coding scheme employed in the prior art provides excess capacity beyond that needed to encode all necessary data symbols. Such excess capacity is available for use as either control symbols or reserved symbols. These control or reserve symbols are referred to herein as non-data symbols, i.e., symbols whose values lie outside the 0 to (2 n -1) range.
- non-data symbols that meet the following requirements may be used by the transmitting MAC layer to form carrier extension 300.
- the non-data symbols must cause the carrier sense signal ("CRS") to remain asserted throughout reception of the symbol.
- CRS carrier sense signal
- the non-data symbols must be transmittable in series one at a time or in any integer number of symbols.
- the non-data signal must not conflict with or be confused with control symbols that might be employed for frame delimiting purposes.
- the non-data symbol selected to form the carrier extension may equivalently be referred to as an extension symbol.
- the transmitting MAC selects the preferably integer value N for each packet transmitted.
- N is selected such that the sum of the length of the fields labelled (DA, SA, Type/length, DATA, FCS) when added to N is greater than or equal to 512 bytes, i.e., a duration exceeding the network roundtrip time.
- FIG. 3 depicts a simple case that was analyzed in the design of an embodiment of the invention.
- the data terminal equipment (“DTE”) model comprising a MAC layer 50B whose internal state machine operates at 125 MHz, and a PHY later 30 coupled to the MAC layer via a 16 bit-width data path.
- a medium dependent interface (“MDI”) 350 e.g., a physical connector appropriate for link media 20, is coupled to PHY 30.
- TXEN is transmit enable
- CRS is carrier sense
- !CRS is the logical complement thereof.
- COL to MAC detect is time delay from assertion of a collision signal to detection of this signal by the MAC sub-layer
- JAM is the bit pattern emitted by the MAC sub-layer when a collision is detected.
- COL to JAM is the time delay from assertion of COL to the MAC's detection thereof, reaction thereto, and production of JAM.
- Table 2 below provides estimates of repeater delays for different classes of repeaters, wherein SOP denotes start of packet, and SOJ denotes start of JAM.
- SOP denotes start of packet
- SOJ denotes start of JAM.
- Table 3A itemizes bit budget estimates for a single repeater topology, assuming a 200 m length of fiber optic cable having standard 5.05 ns/m characteristics.
- the problem represented by the data in Figure 3A is as follows. At 100 Mb/sec., total roundtrip delay in byte time may be a maximum of 64, and thus the 100BASE-FX data are acceptable. But the 1000 Mb/sec. 1000BASE-F data produces a roundtrip delay of 309.5 byte times, which exceeds the prior art limit of 64 byte times by a factor of almost five. But for an embodiment of the invention, the R/T byte ceiling of 64 would be insurmountable at 1000 Mb/sec. for a 200m diameter. However, the carrier extension provided by an embodiment of the invention advantageously raises the permissible ceiling from 64 byte times to 512 byte times (or 4096 bit times, BT).
- Table 3B depicts bit budget estimates for a single repeater topology, assuming a 20 m length of fiber optic cable having standard 5.05 ns/m characteristics. But for the present invention, the 82.25 roundtrip byte delay at 1000 Mb/sec. associated with a relatively short 20 m diameter would not be feasible, as 82.25 exceeds the prior art 64 byte ceiling.
- the above bit budget analysis provides several useful conclusions.
- the proposed bit budget can provide greater margin at 1000 Mb/sec. than is available at 100 MB/sec. in 100BASE-T.
- greater margin it is meant that at 100 Mb/sec. the margin in byte times is the different between the target 64 byte times and the actual 55.25 byte times, which is a margin of 8.75 byte times.
- an embodiment of the invention extends the target 64 byte time to 512 byte times, and at this higher flowrate provides a margin of 512 - 309.5 or 202.5 byte times.
- the minimum frame size is increased upwards from 512 bytes to provide useful topologies at 1000 MB/sec. over diameters at least up to 200 m.
- an embodiment of the invention adopts a new minimum frame size of 512 Bytes using the carrier extension 300 depicted in Figure 2D.
- bit budget analysis amply demonstrates the need for the present invention. Indeed, without the present invention, flowrates exceeding 100 Mb/sec. at diameter distances up to at least 200 m are hardly feasible. However, alternative approaches to the present invention were also considered, but were found lacking. One alternative might be to increase the minFrameSize parameter to 512 Bytes, but so doing will have harmful side effects. One side effect is degradation of the maximum small packet rate on full-duplex links where is it not necessary to use the proposed larger minimum size. Further, the size-inflated packets cannot be propagated to existing 100 Mb/sec. or 10 Mb/sec. networks without very substantial loss in performance.
- the 802.3 MAC provides a padding/stripping mechanism that conceivably could be used to increase the length of the frame in a manner that would not impact performance of slower speed networks.
- such mechanism cannot be relied upon when using protocol stacks that use an Ethernet frame format as the Ethernet frame format is incompatible with the padding/stripping mechanism.
- the challenge successfully met by an embodiment of the invention is to provide a mechanism whereby minimum frame size is extended only on 1000 Mb/sec.
- CSMA/CD networks regardless of whether an Ethernet or an 802.3 frame format is used.
- an embodiment of the invention can increase the (flowrate)x(diameter distance) product.
- an embodiment of the invention extends the time duration of the carrier event, without extending the data field, or altering the FCS field. Such extension is achieved by introducing a new mechanism that appends non-data symbols to the end of short frames. The collision window is extended to include these symbols, and the extension is included in the fragment discard calculation. Finally, the extension is removed before checking the FCS and passing the frame to logical link control 50A ("LLC").
- LLC logical link control 50A
- Pascal code provides the formal specification of desired MAC layer behavior
- generally MAC layers are not implemented using Pascal.
- MAC layers can be implemented in any fashion providing the resultant layer behaves in the manner specified by the following Pascal pseudo code.
- the IEEE 802.3 Pascal definition for the MAC layer is shown in normal type, and amended or new code according to the present invention is set forth below in bold type.
- the present invention is not limited to Ethernet networks whose MAC layers are implemented with Pascal code.
- code modification to the MAC layers is denoted as 50C
- nomenclature code modification to the PHY layers is noted as 30A.
- New transmit and receive state variables are defined as:
- WatchForCollision is modified as follows:
- the MAC (Receiver) ReceiveLinkMgmt modification is as follows:
- Table 4 shows new parameters that are used. NEW PARAMETERS USED IN AN EMBODIMENT OF THE INVENTION PARAMETER VALUE slotTime 4096 bit times interFrameGap 96 ns attemptLimit 16 backoffLimit 10 jamSize 32 bits maxFrameSize 1518 octets minFrameSize 512 bits (64 octets) addressSize 48 bits extendSize 448 octets
- Semantics associated with the reconciliation sublayer are preferably modified as follows. For the semantics of the service primitive PLS_DATA.request, EXTEND is added to the range of values communicated by the OUTPUT_UNIT parameter. For the semantics associated with the service primitive PLS_DATA.indicate, EXTEND is added to the range of values communicated by the INPUT-UNIT parameter. Implementing these changes may be accomplished using techniques known to those skilled in the relevant art.
- Tables 5 and 6 indicate the increasing slot time and minimum carrier duration does not significantly degrade throughput for full size packets. Further, the data indicate very good correlation between experiments and simulations, and confirm 200 m topologies for CSMA/CD operating at 1000 Mb/sec. according to an embodiment of the invention.
- the transmitting MAC layer creates an extension by appending an appropriate number of non-data symbols to the end of a packet.
- the extension length is such that the minimum packet carrier event has a time duration at least as large as the network roundtrip time.
- This extension functionally decouples frame size to roundtrip time constraints and permits flowrates greater than 100 Mb/sec. and indeed 1000 Mb/sec. at network diameters up to at least 200 m.
- the extension duration is implemented without extending data field lengths or altering frame check sequence fields.
- the transmitting MAC monitors the transmission medium for collisions during the duration of an extension, and treats collisions occurring before the extension end normally, i.e., appropriate backoff and retransmission will occur. Should a collision be detected, the transmitting MAC will cease to append non-data symbols to the packet end.
- the transmitting PHY layer encodes the non-data symbols produced by the transmitting MAC layer into an appropriate code for transmission onto the network physical medium.
- the receive PHY On the receiving side of the network, the receive PHY later decodes a specific non-data code and produces therefrom a non-data symbol that the receiving MAC will interpret as an extension symbol, according to an embodiment of the invention.
- the receiving MAC upon receipt of these non-data symbols from the receiving PHY, counts and then strips the symbols from the end of the incoming data stream.
- the receiving MAC includes the count number of the received non-data symbols in its calculations of received frame size, for purpose of distinguishing collision fragments.
- Embodiments of the invention have been described in detail with respect to carrier extending and sending a single packet per transmit opportunity. However, those skilled in the art will appreciate that the carrier extension aspect could also be used in an embodiment that sent multiple small packets per transmit opportunity. Such further embodiment likely would demonstrate improved utilization.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Small-Scale Networks (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US781417 | 1997-01-10 | ||
US08/781,417 US5940401A (en) | 1997-01-10 | 1997-01-10 | Carrier extension for gigabit/second ethernet networks operable up to at least 200 m distances |
Publications (3)
Publication Number | Publication Date |
---|---|
EP0853403A2 true EP0853403A2 (fr) | 1998-07-15 |
EP0853403A3 EP0853403A3 (fr) | 1999-11-24 |
EP0853403B1 EP0853403B1 (fr) | 2002-08-28 |
Family
ID=25122667
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP98300110A Expired - Lifetime EP0853403B1 (fr) | 1997-01-10 | 1998-01-08 | Extension de porteuse dans les réseaux Ethernet |
Country Status (3)
Country | Link |
---|---|
US (1) | US5940401A (fr) |
EP (1) | EP0853403B1 (fr) |
DE (1) | DE69807361T2 (fr) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7437654B2 (en) * | 2000-11-29 | 2008-10-14 | Lucent Technologies Inc. | Sub-packet adaptation in a wireless communication system |
Families Citing this family (23)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6330248B1 (en) * | 1997-12-05 | 2001-12-11 | Advanced Micro Devices, Inc. | Arrangement for transmitting data packets from a media access controller across multiple physical links |
US6611521B1 (en) * | 1998-07-14 | 2003-08-26 | International Business Machines Corporation | Data link layer extensions to a high latency wireless MAC protocol |
US6775284B1 (en) | 2000-01-07 | 2004-08-10 | International Business Machines Corporation | Method and system for frame and protocol classification |
JP2001211190A (ja) * | 2000-01-25 | 2001-08-03 | Hitachi Ltd | 通信管理装置及び通信管理方法 |
US6937571B1 (en) * | 2000-06-19 | 2005-08-30 | Advanced Micro Devices, Inc. | Method of testing a network device through a medium independent interface (MII) |
TW561739B (en) * | 2001-09-27 | 2003-11-11 | Via Tech Inc | Home PNA compliant network system and data packet transmission method providing stay-on device |
TWI271626B (en) * | 2003-06-17 | 2007-01-21 | Delta Electronics Inc | Data transmission method for microprocessors of programmable logic controller |
US7836389B2 (en) * | 2004-04-16 | 2010-11-16 | Avid Technology, Inc. | Editing system for audiovisual works and corresponding text for television news |
US7415035B1 (en) | 2005-04-04 | 2008-08-19 | Sun Microsystems, Inc. | Device driver access method into a virtualized network interface |
US7992144B1 (en) | 2005-04-04 | 2011-08-02 | Oracle America, Inc. | Method and apparatus for separating and isolating control of processing entities in a network interface |
US7415034B2 (en) * | 2005-04-04 | 2008-08-19 | Sun Microsystems, Inc. | Virtualized partitionable shared network interface |
US7443878B2 (en) * | 2005-04-04 | 2008-10-28 | Sun Microsystems, Inc. | System for scaling by parallelizing network workload |
US7529245B1 (en) | 2005-04-04 | 2009-05-05 | Sun Microsystems, Inc. | Reorder mechanism for use in a relaxed order input/output system |
US7779164B2 (en) * | 2005-04-04 | 2010-08-17 | Oracle America, Inc. | Asymmetrical data processing partition |
US7987306B2 (en) * | 2005-04-04 | 2011-07-26 | Oracle America, Inc. | Hiding system latencies in a throughput networking system |
US7865624B1 (en) | 2005-04-04 | 2011-01-04 | Oracle America, Inc. | Lookup mechanism based on link layer semantics |
US7889734B1 (en) | 2005-04-05 | 2011-02-15 | Oracle America, Inc. | Method and apparatus for arbitrarily mapping functions to preassigned processing entities in a network system |
US7664127B1 (en) | 2005-04-05 | 2010-02-16 | Sun Microsystems, Inc. | Method for resolving mutex contention in a network system |
US8762595B1 (en) | 2005-04-05 | 2014-06-24 | Oracle America, Inc. | Method for sharing interfaces among multiple domain environments with enhanced hooks for exclusiveness |
US7567567B2 (en) * | 2005-04-05 | 2009-07-28 | Sun Microsystems, Inc. | Network system including packet classification for partitioned resources |
US8510491B1 (en) | 2005-04-05 | 2013-08-13 | Oracle America, Inc. | Method and apparatus for efficient interrupt event notification for a scalable input/output device |
US7353360B1 (en) | 2005-04-05 | 2008-04-01 | Sun Microsystems, Inc. | Method for maximizing page locality |
US7843926B1 (en) | 2005-04-05 | 2010-11-30 | Oracle America, Inc. | System for providing virtualization of network interfaces at various layers |
Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4707829A (en) * | 1986-09-25 | 1987-11-17 | Racal Data Communications Inc. | CSMA-CD with channel capture |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5027348A (en) * | 1989-06-30 | 1991-06-25 | Ncr Corporation | Method and apparatus for dynamic data block length adjustment |
US5193151A (en) * | 1989-08-30 | 1993-03-09 | Digital Equipment Corporation | Delay-based congestion avoidance in computer networks |
US5461618A (en) * | 1992-06-30 | 1995-10-24 | Industrial Technology Research Institute | Adapter for transmission lines using HDLC frames |
US5619646A (en) * | 1994-09-27 | 1997-04-08 | International Business Machines Corporation | Method and system for dynamically appending a data block to a variable length transmit list while transmitting another data block over a serial bus |
-
1997
- 1997-01-10 US US08/781,417 patent/US5940401A/en not_active Expired - Lifetime
-
1998
- 1998-01-08 EP EP98300110A patent/EP0853403B1/fr not_active Expired - Lifetime
- 1998-01-08 DE DE69807361T patent/DE69807361T2/de not_active Expired - Lifetime
Patent Citations (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4707829A (en) * | 1986-09-25 | 1987-11-17 | Racal Data Communications Inc. | CSMA-CD with channel capture |
Non-Patent Citations (4)
Title |
---|
DOBOSIEWICZ W ET AL: "AN ETHERNET-LIKE CSMA/CD PROTOCOL FOR HIGH SPEED BUS LANS" MULTIPLE FACETS OF INTEGRATION, SAN FRANCISCO, JUNE 3 - 7, 1990, vol. 1, no. CONF. 9, 3 June 1990 (1990-06-03), pages 238-245, XP000166298 INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS ISBN: 0-8186-2049-8 * |
LOUNSBURY A: "GIGABIT. SIZING UP GIGABIT ETHERNET IS ALL ABOUT COMING TO TERMS WITH THE IEEE SPEC - AND LEARNING HOW THIS BIT-BLASTER CAN ACTUALLYSLOW DOWN CORPORATE NETWORKS" DATA COMMUNICATIONS, vol. 26, no. 6, 1 May 1997 (1997-05-01), page 75/76, 78, 80 XP000695154 ISSN: 0363-6399 * |
MACLEOD B: "GIGABIT ETHERNET FULL-DUPLEX REPEATERS" ANNUAL REVIEW OF COMMUNICATIONS, vol. 50, 1 January 1997 (1997-01-01), pages 501-509, XP000720916 ISSN: 0886-229X * |
MOLLE M ET AL: "FRAME BURSTING: A TECHNIQUE FOR SCALING CSMA/CD TO GIGABIT SPEEDS" IEEE NETWORK: THE MAGAZINE OF COMPUTER COMMUNICATIONS, vol. 11, no. 4, 1 July 1997 (1997-07-01), pages 6-15, XP000696500 ISSN: 0890-8044 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7437654B2 (en) * | 2000-11-29 | 2008-10-14 | Lucent Technologies Inc. | Sub-packet adaptation in a wireless communication system |
Also Published As
Publication number | Publication date |
---|---|
US5940401A (en) | 1999-08-17 |
EP0853403B1 (fr) | 2002-08-28 |
EP0853403A3 (fr) | 1999-11-24 |
DE69807361T2 (de) | 2003-04-24 |
DE69807361D1 (de) | 2002-10-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP0853403B1 (fr) | Extension de porteuse dans les réseaux Ethernet | |
US5784559A (en) | Full duplex flow control for ethernet networks | |
US6920132B1 (en) | Reduced pin gigabit media independent interface | |
US5953340A (en) | Adaptive networking system | |
EP0830768B1 (fr) | Ameliorations apportees a la regulation d'acces au reseau 802.3 et mecanismes d'alerte pour ethernet a duplex integral | |
US5574722A (en) | Protocol independent switch | |
US6272552B1 (en) | Dual channel 100Base-T link for computer networks | |
US9106427B2 (en) | Local area network | |
US6909717B1 (en) | Real time ethernet protocol | |
Chowdhury | High speed LAN technology handbook | |
US6111890A (en) | Gigabuffer lite repeater scheme | |
Cisco | Troubleshooting Ethernet | |
Cisco | Troubleshooting Fiber Distributed Data Interface | |
JPS5829244A (ja) | デ−タ通信方式 | |
Cisco | Solving Ethernet Problems | |
Cisco | Ethernet | |
Crayford | " Fast Ethernet" gets plug-and-play | |
Moorthy | Gigabit ethernet | |
Shaker | Modelling and simulation of Ethernet based networked mechanical systems | |
Rao | Ethernet Networks | |
Mick | Introduction to 100base-t: Fast (and faster) Ethernet | |
Chowdhury et al. | Trends of Ethernet | |
Kaplan et al. | The Ethernets: Evolution from 10 to 10,000 Mbps–How it all Works! | |
Pabrai et al. | Understanding and using computer networks | |
Hollenbeck | The IEEE 802.3 Standard (Ethernet): An Overview of the Technology |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): DE FR GB IT NL SE |
|
AX | Request for extension of the european patent |
Free format text: AL;LT;LV;MK;RO;SI |
|
PUAL | Search report despatched |
Free format text: ORIGINAL CODE: 0009013 |
|
AK | Designated contracting states |
Kind code of ref document: A3 Designated state(s): AT BE CH DE DK ES FI FR GB GR IE IT LI LU MC NL PT SE |
|
AX | Request for extension of the european patent |
Free format text: AL;LT;LV;MK;RO;SI |
|
17P | Request for examination filed |
Effective date: 20000509 |
|
AKX | Designation fees paid |
Free format text: DE FR GB IT NL SE |
|
17Q | First examination report despatched |
Effective date: 20001218 |
|
GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
GRAG | Despatch of communication of intention to grant |
Free format text: ORIGINAL CODE: EPIDOS AGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAH | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOS IGRA |
|
GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): DE FR GB IT NL SE |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
REF | Corresponds to: |
Ref document number: 69807361 Country of ref document: DE Date of ref document: 20021002 |
|
ET | Fr: translation filed | ||
PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
26N | No opposition filed |
Effective date: 20030530 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: SE Payment date: 20040107 Year of fee payment: 7 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: FR Payment date: 20040108 Year of fee payment: 7 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: NL Payment date: 20040121 Year of fee payment: 7 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES;WARNING: LAPSES OF ITALIAN PATENTS WITH EFFECTIVE DATE BEFORE 2007 MAY HAVE OCCURRED AT ANY TIME BEFORE 2007. THE CORRECT EFFECTIVE DATE MAY BE DIFFERENT FROM THE ONE RECORDED. Effective date: 20050108 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050109 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NL Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050801 |
|
EUG | Se: european patent has lapsed | ||
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20050930 |
|
NLV4 | Nl: lapsed or anulled due to non-payment of the annual fee |
Effective date: 20050801 |
|
REG | Reference to a national code |
Ref country code: FR Ref legal event code: ST |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20170104 Year of fee payment: 20 |
|
PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20170104 Year of fee payment: 20 |
|
REG | Reference to a national code |
Ref country code: DE Ref legal event code: R071 Ref document number: 69807361 Country of ref document: DE |
|
REG | Reference to a national code |
Ref country code: GB Ref legal event code: PE20 Expiry date: 20180107 |
|
PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: GB Free format text: LAPSE BECAUSE OF EXPIRATION OF PROTECTION Effective date: 20180107 |