CA2105866C - Method and apparatus for buffering data within stations of a communication network - Google Patents

Abstract

Communication controller (3), for buffering data packets, interfaceable with a host processor (I) and a communication medium control unit (2) employing packet numbers assignment storing in a transmit queue (9) and a receive queue (10). Each transmitted or received data packet is assigned a unique packet number (N Ti , N Rj) and dynamically allocated buffer storage (6) by a memory management unit (7) transparent to both the host processor (1) and th e control unit (2). The packet number is stored in a packet number queue (9, 10) with pointers corresponding to the physical addresses where the data packet is stored. Mechanism is provided to interrupt the host processor (1) upon completion of any preselected number of data packet transmission.

Description

WO 92/2(HD2~ PC'f/US92/03502 implements the network protocol. ~'he second type of local area network is referred to as a "distributed network"
which does not require a centralized network controller, and instead provides each station within the network with a communication controller having a medium access cawtrol (MAC) unit that locally implements the naawork protocol within each communication controller.
In a distributed local area network, packet switching is a technique commonly employed to dynamically allocate the communication resources of the network among multiple communicating stations. According to this technique, messages to be communicated between stations are partitioned (by the transmitting station's processor) into packets, having a fixed maximum size. The packets are 'then ascribed a station (i.e. source) identifier. The packets are then placed an the communication medium by the station's communication controller. Such packets are then sensed and selectively processed by the communication controller of the destination station in the network.
Any packet from one station to another station contains various fields of information specified in accordance with a predetermined network protocol. The information typically includes the identity of the source station, the identity of the destination station, and various other information concerning the characteristics of the packet. In same network protocols, a number of different types of packets may appear on the communication medium in accordance with the network protocol.
Typically, these packets relate to either communisation control or data-transfer functions.
To mare fully appreciate the problems associated with conventional communication controllers used in the stations of distributed local-area-networks, reference is made to Figs. 1 through 3.
In Fig. 1, a distributed local area-network 100 is shown, comprising a plurality of stations (i.e. nodes 102A
~ ~. v ;' . ;; .. v. '. : - . . . . ;:.
:.: . ;., . .~, , ~ ~ ;,: . ;; : : ' ; . :, . ; ~.v;;
::. ;.; ~, ; ,,. . ;. . . ,v: . . ::: ': , ,;, .,,. :: :. .. ; .. : ; : " ,..
.v : ..~.. . . . ; . .

WO 92/20028 PcT/US92io35oz through 102M) which are operably associated to a communication medium 103, such as a cable. In Fig. 2, each station is shown to generally comprise a host processor (e. g., CPU) 104, a program memory 105, a system memory 106, a communication controller x.07, a system bus 108, and a communication medium interface unit 109. The processor, program memory and system memory are each associated with a system bus 108, and the system bus, in turn, is interfaced with communication controller 107, as shown. The communication controller is interfaced with the communication medium by way of the communication medium interface unit. Typically, the communication medium interface unit is suitably adapted for the particular characteristics of the communication medium ' being employed in the network.

In general, communication controllers, and LAN

controllers in particular, are usually integrated into a system architecture and software environment by providing the means for supporting two independent data queues in software: a transmit queue and a receive queue. Lach queue is associated with a process, namely, the transmit process and the receive process of the low-level software co~nunications driver.

Thw transmit queue holds the elements that the software intends to transmit. In a packet-switched environment of a local area network, these elements are y .

usbally data packets that include a block of data to be w,;, transmitted and some associated information like the , destination for the blocx of dated The receive queue hold the elements that the station has received, again usually packets with a block of data and associated information such as the sender of the data block.

Elements aye added to the transmit queue by the software driver whenever it needs to transmit information.

Elements are removed from the transmit queue after successful transmission is assumed. Removal of the ,:, t . .,..~, ::~ ~ . ,: . ~>.: . ; ',.;,: :" ;,-. ... ; ~; ,:,, ...' ,.:.-..

~, ~ .
a.
:

y , .
,;, ;
4 :. ~.
in..
't r ' 5~ ~.
:
f .l ,ii t li nl...

.2., ' ~ .~
r ~.. ,.5~''. . r ' ..~ a ~, ' -': "' .,' . .
' ~ ;..
' ' "' ..
' '.
'~' :
~
~
;
..

. , y .
. .
~. ,1 ~
.
.
,,.;
.
.y. . ..
,5 ..:.
..
., ' y. n s':. ,'~'..' .. .':'... .
.....
_~.1"'~. 1 ~.
~.f I.

.~. f .i . ..
~riS r.',r ' '-~:.':,.nl..",.:~e~S...:... ,.n, . .~ .... i.. n ... ., n WO 92/20028 P~L'~f'/US92/03502 elements can be done either by the low-level software driver or by the communication controller. Elements are added to the receive queue by the communication controller whenever a relevant packet is received, and are removed by the low-level software driver upon processing the packet.
The transmit and receive queues are managed by software in system memory, and eventually meet the communication controller. The interface between the queues and the communication controller determines the behavior of the queues during the addition of receive elements and removal of transmit elements.
Management of the transmit and receive queue elements at the level of the communication controller has been attempted in a variety of ways.
For example, some prior art communication controllers are as simple as a single element queue, in which the controller can handle only one transmit and one receive element at a time and the host processor must be involved in feeding the queue. Representative of this type of prior art is the 90C&5 Communication Controller from Standard Microsystems Corporation of Hauppauge, T~ew York. A major shortcoming of this type of communication controller is that it is highly sensitive to interrupt latency of the host processor.
An alternative type of prior art communication controller employs queues for transmit and receive commands while storing corresponding data packets in a randomly accessible memory associated with the communication controller. Representative of this type of prior art is the 90C66 .Communication Controller from Standard Microsystems. Advantageously, this communication controller design is substantially less sensitive to interrupt latency in comparison with the above-described communication controller.
Using an altogether different technique than the command queuing scheme described above, the prior art has wo 92/2ooz8 PCTlU~92/03502 sought to extend the transmit and receive data queues into the communication controller by simulating transmit and receive data queues in the data packet buffer memory of the communication controller. In general, there have been 5 several different approaches to implemeni~ing this generalized memory management technique.
For example, according to one approach, many transmit and receive data elements can be managed as a "ring buffer," in which data packet buffer memory is configured as a number of memory elements which can be sequentially allocated and accessed. Prior art representative of this approach includes the 8390 NIC
Communication Controller from National Semiconductor Corporation, and the Etherstar~ Fthernet Communications Controller from Fujitsu Corporation. Significant shortcomings and drawbacks of the "ring buffer"
communication controller are inefficient memory utilization, high CPU overhead and memory fragmentation.
According to an alternative approach for simulating transmit and receive data queues at the communication controller level, a disjointed array of memory storage locations are linked together with the use of address pointers compiled in accordance with a '°linked list". The major subcomponents of such a conventional "link-list"
communication controller 107' axe shown in fig. 3. In general, communication controller 207' comprises a CPU
interface unit 110, a link-list processor 111, a medium access control (MAC) unit 112, and a MAC interface unit 114. Associated with the controller is a data packet buffer memory (RAM) 113. The CPU interface unit interfaces system bus 108 with the link-list processor and the data packet memory buffer by way of an address and data bus, as shown: The MAC interface unit interfaces the medium access control unit 109 with the link-list processor and~the data packet buffer memory, also by way of an address and data bus, as shown. Prior art VVO 92/2x028 PC.°T/i1S92/0~50~

representative of the above type device includes the 82586 and 82596 Communication Controllers from Intel Corporation.
In order for the link-list communication controller to find the memory storage location where a packet begins, .
as well as the storage locations where each one of the buffers (comprising a packet) begins, the ;software driver must perform a number of computations: Sush packet address computations and the necessity of managing numerous address pointers create high software overhead.
Also with this prior art approach, memory utilization is inefficient owing to the fact that pointers and link--list structures utilize memory and due to the fact that link-lists use fixed memory allocations between transmit and receive queues.
Thus, there is a great need in the art far a communication controller. that can efficiently manage its data packet buffer memory and interface with transmit and receive queues in system memory, while buffering data packets in a manner which is characterized by simplicity, high performance, flexibility, low software overhead, arid efficient memory utilization.
Accardingly, it is a primary abject of the present invention to provide a method and apparatus for buffering data packets in a communication controller in a way which generally satisfies the above-described criteria.
It :is a further object of the present invention to provide such a method and apparatus of buffering data packets in a communication controller, in a way which . ,..
transmit and receive data queues can be managed independently of he host processor (CPU), and insensitive to its interrupt latency time.
It is a further object of the present invention to provide such a method and apparatus of buffering data packets in a communisation controller, in which data packet buffer memory is dynamically allocated so as to ~~~'~~~
optimize memory utilization without burden on the host processor.
A further object of the present invention is to provide such a method and apparatus of buffering data packets in a communication controller in which data packet buffer memory appears to the host processor as two linearly mapped fixed-length regions of memory space for the transmit and receive queues, respectively, while in actuality, the size of the buffer memory is much greater, and the data page storage locations for each data packet are arbitrarily assigned, need not be contiguous, and number thereof is dependent on the actual length of the.
data packet to be stored.
A further object of the present invention is to Z5 provide such method and apparatus in the form of a communication controller, in which buffer memory space between transmit and receive data packet queues is shared and dynamically allocated to optimize memory utilization.
A further object of the present invention is to provide such a communication controller, in which dynamic allocation of buffer memory is transparent to the host .....
processor and the medium access control unit of the communication controller.
These and other objects of the present invention will become apparent hereinafter.
Summary of invention According to one of the broader aspects of the present invention, a method of buffering data packets in a communication controller is provided. zn the illustrated embodiments, the communication controller is interfaced with a processor for processing data packets, and includes a control unit four accessing a communication medium. ".
In general, the method comprises providing a data packet storage means which is operably associated with the communication controller. The dada storage means includes WO 92/20028 ~C.TI~Js~92/035~2 ~~~5~6~~
a plurality of data page storage locations. A packet number is assigned to a data packet to be stored in one or more data page storage locations. Then, the data packet , is stored in one or more of the data. page storage locations. These one or more data page si~orage locations are specified by 'the corresponding packet number assigned to the data packet. After storing the dai~a packet, the packet number assigned to the data packet is stored in a packet number queue which is maintained in the l0 communication controller. The packet number queue is capable of storing one or more of the packet numbers, with each packet number corresponding to one stored data packet. Then, sometime later, the packet number is retrieved from the packet number queue and used to access the data packet from the one or more data page storage locations specified by the retrieved packet number.
zn a preferred embodiment, the packet number queue has a depth sufficient. to queue a plurality of packet numbers, each of which corresponds to a data packet stored ~0 in data packet storage means. For each data packet to be stored (i.a. loaded) and subsequently retrieved (i.a.
unloaded) the above process is carried out, although not necessarily in sequential order.
Preferably, the data storage 1~cations and packet numbers are dynamically allocated: Tn such an embodiment, the number of data page storage locations required to store each data packet is~first determined. The required number of free data page storage locations are then allocated for storing the data packet. Thereafter, tha unic,~ae packet number is assigned to each allocated data page storage location. In addition t~ dynamic packet number and page storage location allocation, linear-to-physical address conversion is employed to create memory access windows in the data packet storage means. In this way, writing into or reading from the data packet storage means appears as if accessing a fixed memory storage n :..i , "; i ~. ,... -;.::.,r...~:;. ;. ,, ';e a~ 4v ,' ,'~.
a. i: .,.. :,:, ....:.;;:.,'.~. ;,, , ;:, ,' ,%,':: .:' ..' ''... ' ..
'~.:''.;,r -.,..,~~.. ~ , .:~.~,~.;.~. .:,;~' .~.~'.,~'~. . '.. .''.'. . ';.,' ' ,...,,.. ..'...~ '. .. ::~.. .,~'.. .. ..:, :~...~: . ... . ;~ .. , WO 92/20028 PC.'f/iJS92l03SQ2 ~~~~~~~4'j space, when in fact, the actual physical storage locations being accessed are situated elsewhere, in buffer memory, unbeknownst to both the processor and the medium access control unit.
Preferably, a pair of packet number queues are independently maintained for packet number~> assigned to transmit and receive data packets, respectively. In this way, using dynamic packet number and page allocation, variable length transmit and receive data packet queues can be effectively maintained in the data packet storage buffer. Consequently, memory utilization is according to first-come-first-serve principles.
According to another aspect of the present invention, a high performance communication controller is provided. In the illustrated embodiments, the communication controller is interfaceable with a host processor and is operably associable with a data packed ~ ' storage means including a plurality of. data page storage locations for storing one or more data packets.
In general, the communication controller comprises a control unit, a memory management means, data packet transfer means, a packet number queue, and packet number transfer means. The control unit is for accessing a communication medium. The memory management means manages the data packet storage means by assigning a packet number to each data packet to be stored therein and by allocating ore or more of the data page storage locations for storing each said data packet. The packet numbers are accessible to one or both of the processor and the control unit.
The data packet transfer means is provided for transferring one or more data packets between the processor and the data packet storage means. Also, the ...', data packet transfer means facilitates transferring one or more data packets between the data packet storage means and the control unit. The packet number queue facilitates storage of one or more packet numbers, each of which ,.. , ,. ,, , ~ ,, .._ . .. ,..,. . ,......, . . .:. , ;_ , ;..,, ,:- ,~: .
;,: ,. ,,. .: . ;.. ". ,:. . . . ,: ; :. ,. : : ;. .
l:
".
~( ... i ).n..
: 1 i t ' t.
~i1 ~~~ 1 iY.
;:.,'.~ ". ;' " . , . n,.~ .. .,,' ':s '.~.~' .~..~'; ...:, .:~.:, 'i:..
.!~..' ..'. ~ .; .. ';
,. . ' ~~~
., ~
f .1\1 ,::r t 1 7 .'' ; , wo gzezoozs P~-revs9zea~~oz >:--corresponds to a stored data packet. The packet number transfer means, on the other hand, facilitates transferring packet numbers between the packet number queue and at least one of the control unit and the 5 processor, arid between the memory management unit and at least one of the control unit and the processor.
In an illustrated embodiment, packet number queues axe provided for both transmit and receive data packets, and packet numbers are assigned by the memory management 10 unit. The memory management means provides memory access windows into the data packet storage means so that the actual physical storage locations are transparent to the processor and the control unit. Such memory access windows are realized by providing the memory management means with a linear-to~physieal address conversion unit that maps linear addresses into physical addresses.
According to another aspect of the present invention, a data communication controller is disclosed, having a mechanism for automatically generating transmit interrupts to the host processor.upon the completion of any preselected number of data packet transmissions deteranined by the host processor. The mechanism utilizes a transmit packet number queue structure having first and second storage locations for removing packet numbers. In one embodiment, the mechanism is adapted to automatically generate a transmit interrupt upon transmission of the data packets associated with each particular record or packet sequence transmitted by the host processor.
3A brief Descri~tion.of the Drawinas For a more complete understanding of the present invention, the detailed description of the illustrated embodiment is to be taken in connection with the following drawings, in which:
Fig. 1 is a schematic representation of a local area network system pex-znitting a plurality of stations to fVO 92/20~2~ PCf/lJS~2/03502 m access to a shared communication medium allocated in accordance with a network protocol;
Fig. 2 is a block functional diagram of a prior art station within the local area network of fig. 1, showing the major components of the station; and Fig. 3 is a black functional diagrarci of a prior art station illustrated in Fig. 2, showing functional subunits of a link-list communication controller incorporated therein.
Fig. 4 is a high-level schematic representation of a w communication controller constructed in accordance with the present invention, illustrating the basic parameters utilized by the host processor (i.e. CFU) and the medium access control unit during data-communication operations;
Fig. 5 is a high-level schematic representation of ' the communication controller illustrated in Fig. 4, with the addition of linear address generation capabilities at the sides of the host processor and the medium access control unit, in order to facilitate sequential data-byte transfer in the preferred embodiment of the present invention;
Fig. 5A is a high-level schematic representative of the communication controller of the present invention, which as seen by the host processor and the medium access control unit, has a memory access window for transfer of ,.,..
data packets having up to a maximum number of data bytes, the addresses of which are linearly ordered as shown;
Figs. 6 and 6', taken together, form a schematic representation of a data buffering method aaaording to a first embodiment of the present invention, illustrating data packet queueing in system memory, packet number assignment, linear address generation for data packets to be transferred to data packet buffer memory, and linear-to-physical address conversion for storage of the data packets;
.'> : -,.: ';'. ' .:.. , ,:;... .. . , ',:~ . ;;, ;;.'' ;' ;' . :;; , ,_,., ;:; ,.:.~ . .~ .'.
.a. ~,~
:.f ' . . ', ;.:, ..~,, ~..v' "'':. 1.;... :..: m .i ,': .. ,~..i:.'~' ~;: ~. , . .
,. . :., . ~ . ~..:'.. ' , ...:: ' .:.':.. .., ":,: ,:, ," .~ ,~. "., ..'.'~.. . , .,n. , ,~~....'~ . ~i . :.:.:~ ,,, ~ ,.... ,~...,: .,,..
' .n . . ; .;.;~: ~',., ~ :,;. . ,,...~,'.. ; .':..,. '.-" .'.,:;. ~~,:' '.::,:, ~:::..'~ ' ,.. :.; '- ..~'.
. i.;. . '..;'~'. ~'.
..1' .
-,' 1 ~1Y... . ..
i:. h. : ~t .
s ': . ... ;: !., : ..... , :,..:, ,:'~~,~ ' ~ ,.t: . ;~: !i:;~ ~..,y. ..v:..
';.. . .., ...

WO 92/20028 ~'~'/IJS92103502 ..-.

Fig. 7 is a block functional diagram of the communication controller according to the first embodiment o.f the presewt invention, showing its subc;omponents integrated together and interfaced between the host processor and the medium access control unit;
Fig. 7A is a block functional diagram of the memory management unit of the communication controller of Fig. 7;
Fig. 7B is a schematic representation of an address conversion table implemented in the address conversion unit shown in Fig. 7A;
Fig. 7C is a schematic representation of a packet number and physical page allocation table implemented in the page allocation and management unit shown in Fig. 7A;
Fig. 8A is a schematic representation of the data packet storage format employed in the data packet buffer memory of the communication controller of the illustrated embodiment; ' Fig. 8B is a schematic representation of the data packet transmission format employed by the communication oontroller of the illustrated embodiment during transmission of data packets over the network communication medium;
Figs. 9 and 9', taken together, form a schematic representation of a method of data packet buffering according to a second embodiment of the present invention, illustrating data packet queuing in system memory, packet number assignment, linear address generation fox data packets to be transferred to external buffer memory, and linear~to~phys2cal address conversion for storage of the data packets;
Fig. 10 is a block functional diagram of the communication controller according to the second embodiment of the present invention, showing its subcomponents interfaced between the host processor and the medium access control unit, with the external buffer dV0 92/20028 PC.°T/US92/03502 t ~~ ~~a~~~

memory interfaced with the memory management unit and other subcomponents;
Fig. 10A is a block functional diagram of the memory management unit of the communication controller of Fig.
10;
Fig. 1oB is a schematic representation of an address conversion table implemented in the address conversion unit shown on Fig. 10A; .
Fig. 10C is a schematic representation of a packet number and page allocation table implemented in the page allocation and management unit shown in Fig. 10A;
Fig. 11 is a block functi.ona3 diagram of the communication controller according to the third embodiment of 'the present invention, showing transmit and receive packet number queues in operable association with the CPU
interface unit so as to automatically generate transmit interrupts to the host processor in a flexible manner; ~ w .
Fig. 11A is a block functional diagram of the w transmit and receive packet number queues and CPU
interface unit of one embodiment of the communication ' controller of Fig. 11;
Fig..llB is a block functional diagram of the ' transmit and receive packet number queues and CPU
interface unit of an alternative embodiment of the communication controller of Fig. 11;
Fig. l2A is a flow control diagram illustrating operations undertaken by the host processor during loading of a transmit data packet into the data packet buffer memory of the communication controllers of 'Figs. 7, l0 and ~0 11;
Fig. 12B is a flow control diagram illustrating operations undertaken by the medium access control unit during unloading of a transmit data packet from the data packet buffer memory of the communication controllers of Figs. 7, 10 and 11;
~-.,,;

2 1: s~ i '~:~J
'Sr' ~1 . ....
t 1 ' ,r C
nl~:~.n 1 ' t t .\ ~ ' . x ..'~~ ~ v:w ;; ~ ~ .. :
:n " r::~ t~' i.. ' ;; y ~:' r _ .~ . 1~, '' n r ..
,:', ...o.~.
t ~'O 92/2U028 Pc'T/~1~92/03502 i---,' 1~
Fig. 12C is a flow control diagram illustrating optional operations undertaken by the host processor, upon receipt of an interrupt, in order to determine status of a particular transmit data packet;
Fig. 13A is a flow control diagram illustrating , operations undertaken by the medium access control unit during loading of an incoming receive data packet into the data packet buffer memory of the communication controller of Fig. 7; and Fig. 13B is a flow control diagram illustrating operations undertaken by the host processor during unloading of a receive data packet from the data packet buffer memory of the communi-cation controller of Figs.
7.
Detailed Descriution of the Illustrated Embodiments Referring to Fig. 4, the method and apparatus for buffering data packets in accordance with the present invention is schematically illustrated in connection with a host processor {i.e. CPU) l and the medium access control (MAC) unit 2 of a communication controller 3. As illustrated, transmit and receive data~packet queues 4 and 5 are managed in the station's system memory by a software based low-level driver under the control of the host processor. While not represented, the medium access control, unit typically comprises a microsequencer running a micropragram or state machine (i.e., an algorithm) which effectuates the network protocol and ultimately, the communication controller's access to the communication medium. To carry out the network protoool; each medium .
access control unit in each station communication controller must perform the same algorithm. Processor °°interrupts'° provided by the communication controller are the basic scheduling events upon which the low-level driver manages the flow of data packets between transmit w w and receive r~ueues, and the communication controller.

WO 92/2tD02f3 PCTlUS92/03502 As illustrated in ~'ig. 4, the communication controller of the present invention generally comprises data packet buffer memory 6 for queuing transmit and receive data packets; a buffer memory management unit 5 (i.e. facility) ? which as illustrated, includes an address conversion (i.e., mapping) unit 8; and transmit and receive packet number queues ~ and 10 for queuing packet numbers assigned to transmit and receive data packets,respectively. Address conversion unit 8 is 10 operably associated with buffer memary 6 and in general accepts as input packet numbers NT; and ~TR~ and produces a set of physical addresses defining available storage space (i.e. locations) within buffer memory 6.
On the host processor side, packet number transfer 15 means 11 is provided for transferring packet numbers from the host processor to transmit packet number queue 9, as well as from the host processor to address conversion unit ' 8. F~acket number transfer means ~:2 is also provided for transferring packet numbers from receive packet number queue 10 to the host processor, as well as from the host processor to address conversion unit 8.
On the medium access control unit side, packet number transfer means 23 is provided for transferring packet numbers from transmit packet mrmber queue 9 to 'the medium access control unit, as well as from the medium access control unit to address conversion unit 8. Packet number transfer means 14 is also provided for transferring packet numbers from medium access control unit to address conversion unit 8, as well as from the medium access control unit to receive packet number queue 10. In order to transfer data packets between transmit packet queue 4 and buffer memory 6, and between buffer memory 6 and the medium access control unit, data packet transfer means 15 is also provided. Also, to transfer data packets between receive packet queue 5 and buffer memory 6, and between buffer memory 6 and the medium access control unit; data Wo 9zez4oz8 Rc~reus9zeo3soz packet transfer means 16 is provided. Typically, data packet transfer means 15 and 16 are in the farm of data buses, well known in the art.
Tn principle, memory management unit 7 determines which data storage locations are available in buffer memory and dynamically allocates an arbitrary yet sufficient number of those storage locations to an available packet number, so as to be able to store the corresponding data packet. The i-th transmit data packet Dr; in transmit queue 4 is stored in buffer memory 6 by issuing a packet number NT; to 'the address conversion unit of the memory management unit. Address conversion unit 8 then generates a set of physical addresses AT;' which provide access to corresponding storage locations which have been allocated in buffer memory. D'pon generation of these physical addresses, the host processor copies transmit data packet DT; from transmit queue ~ into the physical storage locations specified by the assigned packet number through the address conversion process.
Then, packet number NT; is inserted into transmit packet number queue 9 for subsequent use by the medium access control unit, during packet unloading operations.
While packet numbers corresponding to transmit data packets DT; can be assigned by the host processar hand by the medium access control unit for receive data packets DRS), the memory management unit of the illustrated embodiment assigns all packet numbers. To achieve this function, the memory management unit further includes a packet number assignment unit 17 which accepts and decodes memory' starage requests RT; and RR~ from the host processor and medium access control unit, respectively. In response, the packet number assignment unit assigns a packet number to each corresponding data packet, for which a memory storage request has been made. Tn turn, packet numbers NT; and NR~ are issued to the host processor and medium access control unit, respectively. In the fVO 92/20028 PC'f/LJS92/03502 ~~~v1%.)~

illustrated embodiment, each packet number will be a unique number, digitally represented within the communication controller and host processor.
To transfer each memory storage request RT; from the host processor to packet number assignment unit 17, request transfer means 18 is provided. To transfer each assigned packet number NT; from packet number assignment unit 17 to the host pracessor, packet number transfer means 19 is provided. Similarly, to transfer each memory request RR~ from the medium access control unit to packet number assignment unit 17, request transfer means 20 is provided, whereas packet number transfer means 21 is provided for transferring each assigned packet number NR~
to the medium access control unit.
After loading a number of transmit data packets DT;
into buffer memory 6 in accordance with the above-described method, transmit packet number queue 9 will contain a number of packet numbers arranged in a sequential order, such that the first packet number inserted into the queue is the first one to be removed from the queue. Each transmit data packet Dt;
corresponding to packet number NT; in the transmit packet number queue, is stored in buffer memory s in a manner and location completely transparent to the host processor and the medium access control unit. The assigned packet numbers in the transmit packet number queue ~, retain all queue information relating to the transmit data packets stored in buffer memory 6.
The following process is carried out by the medium access control unit, in order to unload from buffer memory 6, the transmit data packet which corresponds to the packet number first to be removed from transmit packet number queue 4.
The medium access control unit first reads out the i-th data packet number NT; from the removal location of transmit packet number queue 4. This retrieved packet 'CVO 92120028 PCT/U~92103502 i:..-...

number is then provided to address conversion unit B which generates physical addresses AT;' that specify the physical storage locations in which the data bytes of the corresponding data packet DT; are stored. From these accessed storage locations in buffer memory, the data bytes comprising the transmit data packet DT; are read out by the medium access control unit and subsequently placed on the communication medium 103. After transmission of data packet DT;, the medium access control unit can write transmit status data into storage locations associated with the physical storage locations from which. data packet DT; was read out. After transmit status data is written into buffer memory 6, an interrupt to the host processor is generated. The host processor, maintaining a software queue of assigned packet numbers NT;, gains access to transmit status data in these physical storage locations, by selecting packet number NT; from the removal location in the software queue. The selected packet number NT; is then converted into the allocated physical addresses AT;' by the address conversion unit. After transmit status data is read and utilized by the host processor, the host processor issues a release command F(Nji) to packet number assignment unit 7, in order to release the storage locations in buffer memory 6 that have been allocated to packet number Nr;. In this way, these released storage locations will be free for future allocation to either transmit or receive data packets.
The communication controller of the present w invention operates much in the same way for loading and unloading of receive data packets DRj. For example, the medium access control unit issues a request R~~ to the memory management unit for allocation of a number of storage locations in buffer memory 6, sufficient to store the j-th incoming receive data packet, DRS. In response to request R~~, a packet number NR~ is assigned to the j--th receive data packet, DRS and then provided to the medium iV0 92/20028 Pf.'T/US92/03502 2'~ ~~
1~
access control unit. The medium access control unit issues assigned packet number NR~ to the address conversion unit of the memory management unit, which generates a set of physical addresses ARC that specify and provide access to storage locations in buffer memory 6, for storing receive data packet DRS which corresponds to packet number NR~. With access to allocated storage locations within buffer memory 6, the j~-th receive data paclcet D~~ is read from the medium access control unit into the allocated 20 storage locations. After loading receive data packet DR
into buffer memary, corresponding packet number NR~ is placed into the insertion location of receive packet number queue 10 of the communication controller. Receive status data concerning the receive data packet DRj, can be written into one or mare of those storage locations which have been allocated to receive packet number NR~. The .
nature of such receive status data can relate to the integrity or the type of data packet dust reviewed.
Subsequently, an interrupt to the host processor will be generated indicating that unloading of a receive data packet can take place when desired by the host processor.
Prior to the packet unloading operation, however, the host processor can read receive status data stored in buffer memory, in a manner similar to transmit status data storage and retrieval discussed above.
After loading a number of receive data packets DRS
into buffer memory 6 as described above, receive packet .
number queue 10 will contain a number of packet numbers, also arranged in a sequential order such that the first w packet number into the queue is the first one to be removed from the queue. Also, each receive data packet D~j, corresponding to packet number NR~ in receive packet number queue 10, is stored in buffer memory ~ along with transmit data packets, and in a manner and location '.
completely transparent to the medium access control urfit and the host processor. As with the stored transmit data dV~ 92/20028 PCT/US92103502 2~.~~86~
zo packets, the assigned packet numbers in receive packet number queue 10 retain all queue information relating to the receive data packets stored in buffer memory.
The following process is carried out by 'the host processor, in order to unload from buffer memory 6, the receive data packet which corresponds to the packet number first to be removed from transmit packet number queue 10.
The host processor first reads out the j~th data packet number NR~ from the removal location of receive packet number queue 10. This retrieved packet number NR~
is then provided to address conversion unit 8, which generates the physical addresses AR~~ that specify the physical storage locations, in which the data and status bytes of the corresponding data packet DRS are stored.
Upon generating an interrupt, receive status bytes are read out by the host processor from storage locations in buffer memory 6. After checking the integrity of the .
received data packet DR} and transferring the receive data packet from buffer memory to receive data packet queue 5, 2o the host processor issues a release command F(NR~} to packet number assignment unit 17 in order to release the storage locations in buffer memory.f> that have been allocated to packet number NR~. In this way, these released storage locations will be free for future allocation to transmit or receive data packets.
A significant feature of the present invention described above is that all during the loading and unloading operations of data packets, the physical storage locations in buffer memory 6 are transparent to both the host processor and the medium access control unit. The kaost processor and medium access control unit acquire necessary access to buffer memory 6 by providing a packet number to the memory management unit, and then transferring the corresponding data packet into or out of the buffer memory, as desired. Conversion of packet numbers into ,.,.., ..-.;~ ;,,'. ,.'.;..', :..~.... '.;.~.. ,..,,; ,.,,~. :-~.., .;..:;.
~,..;;y,~.,',:. ~... ".:: ~.~',~:., ; .... .~. ':;..., '-.!. ,.., " , .:.',: '"s. . . .~y:. -(', ":;. . ':':~ ,~~.; .. "'.''.' .'-::' . :... : ' :. .. '~,... . ~ :, .. .
1..".r. ,';'::: :v,;::~ -'~:::. ~ :~ .;,..~.',. ...,' :.,~5:.
':'.°!'.... ~..~.. , :..:,,.'.. ...., :'..~.: ! .'~:..,~.:::i., ...~~.,.,~..., . . .:~ ..
.,:.:;:~.~ ,~,:':~. ,'~~.:.''~ . . ~ .. :,'..,., -v..~..:; .:,..,. ,..Y',; ::
.'~ ..'.'.:r ::.:..;~. ~.';,:~...w.; '. , , ...V.
a,~.''m ,' ~.':; ..n .,'',:....,;~; ;~. ~, :...... ~ ' ;:.;... ' ~.' ,~:~
'~:!;.~~.~ . ~~..':~, :. .,..,.: ~, ..'~~ ~ .'.. '..!'...;... .'::..., ; ....
.
' ...:!'; '.'r,' .'~; ;. . ... . ':. . . :. . ..'.. ~:.!. V , ;..:~ ,.,'. ' .:. ~: " .~'.' . ....'..
. ,,'~..: ~ i '~,..:'..~.. .,~'. ,~,.. . , ;,.,." .:.,.'..:, ~ '.! : .;.;, ~ ;
,:,.. :,: '.:.'.~. ~.1 . .,. ~;,, ~,. ' 's. .., ; -.,; , '. , ~', , .;:.,_ ,. ;:,.~ , '.ir' !.'.:;' ' :'. '.' ~ .,,;.., ;,::~~.. :.:;'~...
~..~;~~, ,fir" ,,,,'..,,.. , ', ~.:~:'~ '. .'.~' ;: :,': ~:~'''. . ~ . .. :.:
~'~.~. ' ~' ..,:, ,' ..
'~ ''i ...::. ~;:: .:~.; , ~ ','. .~..~, '~..,.';: :...,~:: "':~ ~.~;::: :
.,.:' ; ~.,,.::~. ' ... :' ~ v.,....:;~. ~:;. ';.~..; ' w. ',~ ,,.', . .

WO 92/20028 pCT/U~92103502 physical addresses and determination and allocation of free storage locations within buffer memory, occurs completely transparent to the host processor and the medium access control unit. Advantageously, this reduces substantially the overhead of the software--based low--level drivers, as well as the algorithm-based medium access control unit.
The above-described method and apparatus for buffering data packets within a communication controller has assumed that the host processor end medium access control unit are each capable of transferring, as complete elements, data packets (DT; and DRS) to and from the buffer memory of the communication controller. Conventional host processors and as medium access control units are Z5 typically limited to transferring up to a few bytes of data at a time, over their respective data buses, and data ' packets Dt; and DRS will typically comprise a number of data .
bytes. Consequently, depending an the length of the data packet, each data packets D7; and DR; will require a particular number of data-byte '°transfer operations" in order to completely transfer a data packet between the host processor and the buffer memory, or between the medium access control unit and the buffer memory. This data transfer~requirement has been satisfied by another aspect of the present invention, described hereinbelow.
In the first'illustrated embodiment of the present invention, the,packst length can vary between 64 to 1518 bytes per data packet and buffer memory 6 (e.g. RAM) is preferably divided into eighteen pages, each of which contains 256 bytes of storage locations. In such an embodiment, each storage location is of sufficient bit length to store a byte of date. :Cn order to maintain physical storage lodations transparent to the host processor and the medium access control unit while permitting data byte transfer, a windowing-type memory accessing technique is employed. In essence, thin .., ... . . . ':: ; '' ;~ ;~ . ~. : -.,y .~' . ::', ;::: . ,. . :r; ; ,v' ';.
'~ .. .;:.., , ; ...;: , '.
v~
.
'. , a :~:
..: ; ;;, ... .. ~ .:~ ~,., v, v ': ,., > ., ,;;:, WO 92/2U02~ PCTltJ~92/03502 2:~~~~~~

technique involves the host processor and medium access control unit either writing a packet of data bytes into or reading a packet of data bytes from an apparently fixed, linearly addressed window of storage locations in buffer memory 6. In actuality, hocaever, such data bytes are , written into or read from other physical storage locations that have been preallocated to the corresponding packet number by the memory management unit of the communication controller. In order to clearly illustrate this feature of the present invention, reference is made to Figs: 5 and 5A, in particular.
Tn Fig. 5, a communication con'croller 3 similar to that illustrated shown in Fig. ~, is shown interfaced between host processor Z and medium access control unit 2.
In Fig. 5A, communisation controller 3 according to the present invention is schematically illustrated to emphasize 'that the fact that the buffer memory is seen by .
both the host processor and the medium access control unit as a pair of transmit and receive memory storage areas or memory access windows, WCp" and W~C~ each of which appear fixed in tex-ms of address specification, and grovide a '°window" of access to the buffer memory. Specific-ally, memory access windows W~FU and W,~~ are each defined by a fixed set of linear addresses ranging from a.minimum value to a maximum value, with each consecutive address value being separated by a fixed address increment. In the illustrated embodiment, this 11-bit linear address range extends from {00000000000} to {1111111111} specifying a maximum range of eight pages (e.g. 2 kilobyte range) of storage locations in the buffer memory, with each page containing 256 bytes of storage location. As illustrated in Fig. 5A, memory access windows W~pu arid W~~ are generated by linear address generators 23 and 2~ at 'the host processor and medium access control unit, respectively.
These linear address generators perform according to the abcave-described specifications and generate linear .;.,;: .,.. . ::~ ....: ,,.:.,.:, , ,,;. ,.. ... _ ... ; , ,.,, ;, . : :. :, , , ~. : ,4 ; , ~;,',. . , : ;.:..
u,. . ' ...~.i, ...,.'., . ,..,.~~ .' ..'..... ~.:.~~,: ;: :; "t. ,'i..~1 .:.~ :. ~..~~..:...i ~~...~ . . ....,:, . . .,. .
~ w~...' ,,i.'. ~::. : . ..' .. ~ ." ...,~.~ ,..:~i ' ..'' ~..-''~ ~ '.,,' .
...~ .'~. ..... .~i:.~..~ .,' .,.. ,:. . ...
~,; .~
S
'~ ~,!' . ~ ..

'dV~ 92/20028 P~'IiJS92/03502 addresses which, in essence, define the length of the data packet and the relative location of each byte within it.
Memory access window W~PU serves two principal functions, namely: it provides the host processor random access to the bytes of storage locations within pages of buffer memory 6 in order to (i) store tranamit packet DTI
and (ii) retrieve each receive packet DRS, 'without concern for the physical location of each allocated page in buffer memory. Memory access window W~,A~ serves two similar functions, namely: it provides the medium access control unit random access to the bytes of storage locations within pages of buffer memory in order to (i) retrieve each transmit data packet DTq and (ii) store each receive data packet DRS, also without concern for the physical location of each allocated page in buffer memory.
According to this embodiment of the present invention, each assigned packet number NTq or N,~~ in combination with the set of linear addresses AT; or ARC are provided to the address conversion unit of the communication controller, and together are used to convert the fixed linear addresses AT; and ARj into physical addresses AT;' and Any' respectively, defined within buffer meaaory 6. xn this way, while the host processor is simply writing the bytes of a data packet into a linearly arranged set of storage location within memory access window W~pu, such data bytes are actually being mapped into a dynamically allocated pages) of storage locations that have been arbitrarily allocated within buffer memory 6, while being shared amongst transmit and receive data packets alike.

3~ Referring now to Figs. 6 and s', the process of accessing buffer memory 6 through the memory access window W~PU, is illustrated in connection with storing transmit data packets into one or more pages of the buffer memory.
A~ illustrated in Fig. 6, four transmit packets DTo through DT3 are qusued up in the transmit data packet queue

4 ready to be stored in'buffer memory 6. One data packet 'W~ 92/20028 PCf/LJS92/03502 ,' .

at a time is assigned a unique packet number alt; and then given a set of linear addresses, represented as AT; for transmit data packet DT;. As understood, the length of each data packet DT; is proportional to the number of bytes contained in the data packet, and the more bytes contained within the data packet implies that a greater range of linear addresses AT; will be required to write data packet DT; into data packet window W~~", defined above. For illustrative purposes only, transmit data packet DTo contains six pages of data bytes. Thus, the range of linear addresses which need to be generated to write this memory access into data packet window W~~" begins at {000 00000000} and terminates at about (101 11111111} as Shown. On the other hand, data packets Ds3 and DT4 each contain about two and one-half pages of data bytes, and thus the range of linear addresses which need to be generated to write each data packet into memory access window W~~, begins at {000 00000000} and terminates at about {010 00111111} as shown.
In the illustrative embodiment of Figs. 6 and 6', each set of linear addresses for a transmit data packet DT;
is represented as AT;, and as indicated, has two components, namely: a first address component A1 comprising the first three most significant bits (MSB) of A1;, and a second address component AZ comprising the eight least significant bits (LSB) of At;. As will be explained in greater detail hereinafter, within the memory management unit of the first illustrated embodiment, address component A~ represents the page (e. g. first, second, third, etc.) of the data packet to which the data byte belongs, whereas address component Az represents the byte address within that particular page (i.e. offset).
Similarly, each set of linear addresses for each receive data packet DR j is represented as AKA , and 1 ike AT; , has two components: namely a first address component Al comprising the first three most significant bits of ARj, and a second . .. . ;. ~ : ,.;. ' ~:: .:. ,, . . . : ; ;,: . - ~ : : : : ; ~:. . ~.: . , n ~:.H I4 vl.. ~:n l: ' ..J'. .i . .l ., ..P ;.~.~'t~.
.w..s7.~H4 ... t'.?.~".f'~ ~ \.!';~.. 6, y .'.Y. ,.1.. ~ ~ n W J<u"~ '~......:
Y.~',n I . . nf"
. . ~' ,.,. A 'k ~.i :; ; ~:....,' . ; ,. .. . ' , ~... !.. :.,. ... .4 ;...;
~. ~ . ~ .~ . ~ ' ~ . ~ .~~. ~. .~:. , ~, .. '.. , . :.: .~, . , r WO 92/20028 R~'ftU~92/03502 address component AZ comprising the eight least significant bits of ARC. In the illustrated embodiment discussed above, address components A~ and Az represent similar features defined within 'the memory management unit of the

5 particular embodiment. Notably however, with respect to linear address generators 23 and 24, pegs distinctions of any sort are neither made nor recognized. Only within the memory management unit are there page differentiations.
As illustrated in Fig. 6, each data packet undergoes 10 packet number assignment prior to generation of the linear addresses. As discussed hereinabove, this involves the host processor placing a Request RT; to the memory management unit, and in return, a packet number NT; is assigned to the data packet DT;, to which one or more pages Z5 of data byte storage locations have been dynamically al~.ocated in buffer memory 6. This dynamic allocation process will be described in greater detail below in connection with specific illustrated embodiments of the communication controller according to the present 2o invention. Assigned packet number NT; and the set of linear addresses AT; for data packet DT;, are then utilized by the memory management unit to produce a set of physical addresses AT;' within buffer memory 6, that are sufficient to store the bytes of the data packet. Notably, owing-to 25 the dynamic memory feature of the present invention, each page of data bytes within the data packet need not and will not be stored in contiguous page storage locations, as illustrated in Fig. 6'.
Two important points should be made at this juncture regarding the present invention. First, the linear-to-physical address conversion process within the memory management unit is completely transparent to both the host processor and the medium access control unit.
Consequently; neither the host processor or the medium access control unit know just where any data packet may be stored in buffer memory; all that the host processor and WO 92!20028 Pf.'T/US92103502 medium access control unit have is a packet number assigned to a corresponding data packet stored somewhere in buffer memory 6. Secondly, the host processor and the medium access control unit are each capable of (i) accessing the packet numbers from 'the transmit and receive packet number queues 9 and 10, and (ii) writing into and reading from fixed memory access windows (W~~" and W"~~) defined by a delimited range of linear addresses.
Consequently, buffer memory 6 is seen by the host processor and medium access control unit as a set of independent memory areas consisting of contiguous byte storage locations, having a length equal to the memory access windows W~~, and W~~, e.g. 2 kilobytes.
Referring to Fig. 7, a lower~level representation of the communication controller of the first embodiment of the present invention, is presented. As shown, communication controller 3' comprises a central processing unit (CPU) interface unit 30, a medium access control (MAC) interface unit 31, medium access control unit 2, transmit packet number queue 32, a receive packet number queue 33, data packet buffer memory 34, six switching devices M~ through M6 in the form of multiplexers, and memory management unit 35. In the illustrated embodiments, only data and address lines are shown, with control lines removed in order to avoid obfuscation of the present invention. Also, in the illustrated embodiments, Carrier Sense Multiple Access with Collision Detection (CSMA/CD) has been selected as the network protocol for medium access control unit 2. As will become apparent hereinafter, there are several differences between the first and second illustrated embodiments. For example, in the first illustrated embodiment of Figs. 7 through 7C, -all the above-identified components would be implemented as digital circuits integrated on a single chip using known IC manufacturing techniques. In a second embodiment illustrated in Figs. 10 through lOC, all components except ~V~ 92/20028 PCf/US92/03502 for the buffer memory would be realized on a single chip, with input and output ports provided far an externally interfaced (i.e, aff chip) buffer memory. Other .important differences with respect to buffer memory storage, will be described hereinafter. Nevertheless, it is understood that principle of the invention disclased in this .first embodiment but not in the second embodiment and vice versa, can be combined in a variety of manners to provide additional embodiments, all of which are embraced by the ZO spirit of the present invention.
In Fig. 7, CPU interface unit 30 generally comprises logic circuitry suitable for interfacing the address, data and control lines of system bus 37 with buffer memory 3~, memory management unit 35, and transmit and receive packet number queues 32 and 33, invalving multiplexers M2, M3, M4, and M6, as shown. While not shown, CPU interface unit 30 also includes a transmit interrupt storage register, a receive interrupt storage register, an MMU interrupt storage register and an interrupt generating circuit.
Each storage register is adopted to store an interrupt code. The output of each storage register is read by the interrupt generating circuit and depending on the content of what is read, it generates a respective interrupt which is provided to the host processor over a designated line 38. As will be described in greater detail. hereinafter, interrupt codes far transmit and receive interrupt storage registers are provided from transmit and receive packet number queues 32 and 33, respectively. The interrupt code for the MMCT interrupt storage register is provided by memory management unit 35. The interrupt generating circuit is adapted to generate each respective interrupt to the host processor under a particular condition. The first condition is for generating a receive interrupt and odcurs after the medium access control unit has written receive status bytes into buffer anemory 3~ after a data packet reception. The second condition is for generating WO 92f20028 T'~C.'T/U~92/03502 E' transmit interrupt and occurs after medium access control unit has transmitted one or more transmit data packets, and it might be time to store more transmit data packets in buffer memory.
The third condition is for generating an HLiHLJ interrupt and , occurs after a requested free page becomes available in buffer memory 6 and a packet number is assigned to a transmit data packet. When the low-level driver executed by the host processor, receives an intern;~pt, it will instruct the host processor to determine the source of the interrupt. The interrupt generating mechanism will be described in yet greater detail hereinafter.
Preferably, buffer memory 34 comprises a randomly-accessible memory (RAM) storage device which has a plurality of data byte storage locations. In the first illustrated embodiment, with on-chip random access buffer memory, the total memory size could be, for example 4608 bytes. With each. page of memory having 256 bytes storage capacity, a memory of 4608 bytes provides 18 pages. In the illustrated embodiment, this requires an additional 144 5-bit storage locations for realizing the "address conversion table" of Fig. ?A, and 18 6-bit storage locations for realizing "packet number and memory page allocation" table 'of Fig. ?C. Berth -of these tables will be described in greater detail hereinafter..
Referring to Fig. 8a, the storage format of a data packet DTi or DRS in buffer memory 34, is illustrated. As specified by linear addresses ranging from {00000000000) to (11111111111), a data packet may contain up to eight w pages of data bytes for storage in buffer memory 34.
According to the storage format illustrated in Fig. 8A, the first two data byte storage locations are designated for transmit or receive status bytes. The next two-byte storage locations are designated for the data-byte count of the packet. All successive byte storage locations are . designated for storage of data bytes of the data packet.

wo 9zizooas PcT~us9zfo3soa In the illustrated embodiments, this data count can .range from &4 to 1518 bytes.
As hereinbefore described, the medium access control unit of the illustrated embodiments includes a state machine which performs all of the control operations necessary to carry out the CSMA/CD protocol. On the one hand, the medium access control unit is interfaced with communication medium whereas, on the other hand, the medium access control unit is interfaced with the MAC
interface unit 31, as shown.
MAC interface unit 31 generally comprises logical circuitry suitable for interfacing the address, data and control lines of MAC bus 39 with buffer memory 34, memory management unit 35, and transmit and receive packet number queues 32 and 33, involving multiplexers M~, M~, M5, and M6, as shown MAC interface unit 3lalso includes a data packet storage register (not shown) in communication with data bus lines 39.
In the illustrated embodiment, transmit and receive packet number queues 32 and 33 are realized by first and second first-in-first-out (FIFO) storage units, respectively. Each FIFO storage unit~32 and 33 has a plurality of packet number storage locations, which in the illustrated embodiments, is of depth eighteen. Notably, however, in other embodiments the depth of these units may be greater or less than eighteen depending an the particular application. In the first embodiment, the length of each storage location is of bit length five, .
which is sufficient to digitally represent a range of eighteen packet number, corresponding with the eighteen total pages of memory in buffer memory 34.
While not shown in Fig. 7, data lines from system bus 37 extend through CPU interface unit 30 and emerge therefrom as lines 41A, 41B, 41C, 41D, 41E which connect respectively, to the data input of first FIFO storage unit 32, a first input of multiplexer MZ, a first input of i~'O 92/20028 PGf/US92/03502 multiplexes M4, a first input of multiplexes M5, and a first multiplexes M6. Similarly, data lines from MAC bus 39 extend through MAC interface unit 31 and emerge therefrom as lines 42A, 42B, 42C, 42D and ~42E to connect 5 respectively, to the data input of second FIFO storage unit 33, a first input of multiplexes M~, a second input of multiplexes MG, a second input of multiple~;;er M5, and a second input of multiplexes M~. While not shown, at first linear address generator is contained within CPU interface 10 unit 30, and a second linear address generator is contained with MAC interface unit 31. In order to operably associate the first linear address generator with memory management unit 35, eleven-bit address lines 43 from CPU interface unit 30 connect to a first input of 15 multiplexes M3. Similarly, in order to operably associate the second linear generator linear generator with memory management unit 35, eleven-bit address lines 44 extend from MAC interface 31 and connect to a second input of multiplexes M3. While not shown, control lines from a 20 conventional arbitrator circuit (not shown) to connect to control inputs of multiplexers M~, M4, M5, and M6 in a manner well known in the art. Similarly, while not shown, multiplexes M~ is controlled by the medium access control unit, whereas multiplexes MZ is controlled by the CPU
25 interface unit. , As seen by the host processor (CPU), each storage location in first FIFO unit storage unit 32 resides logically at the same address in the communication controller. Similarly, as seen by the medium access 30 control unit, each storage location in second FIFO storage unit 33 resides logically at the same address in the communication controller. In general, the storage.
locations of FTFO storage unit 32 includes a first insert storage location into which each packet number NT; can be written, and a first removal storage location from which each packet number NT; can be read. In practice, the . v:v ,: . ; : .,' ~,.,,; ,: , ..,,; , ;, . ;:;, .~ . ,. .....
':v . :;:: a v.. : ~- .; ... , ,~:. : ~:, : .;, .v ~;,. ,.: , :.... . .,.,; , .. ,:
.~ .a ,..::,. ~ ; ,.,;:. <.°;., . ~;:. ; ... ;... ~,: ~ ,.:w,. ,;.:::. ,;;
.,:.:.. . . .~. ,.. ::. :w:: ;:,:
. ,':'.;:
,:, ,. .. : ~ . .: . : ,. , ~: , . . ~. ; : , w; ~: ., , ..: .: .. ., ,.:..:
.. .: .~ .
~; r: . ~, : , .:...v ." ; . ~';:

WC) 92/20028 ~ ~ ~~' J' U ~ ') P(.'T/US92/03502 insert and removal locations are indicated by the pointers of the addressing system used in implementing FIFO storage device 32. The first insert storage location is advanced by the host processor writing a packet number into FIFO
storage unit 32. On the other hand, the first removal storage location is advanced by the medium access control unit reading a packet number from FIFO storage unit 32.
Constructed as such, a packet number can be written into the insert storage location of FIFO storage unit 32 by the host processor, and a packet number stored in FIFO
storage unit 32 can be selectively read therefrom by the medium access control unit. FIFO storage unit 32 also has a port which provides an °'empty" signal when the FIFO
storage unit contains no packet numbers. As illustrated, this ''empty" signal is transmitted by way of line ~5 to both the transmit interrupt storage register in CPU
interface unit 30 and to MAC interface unit 31.
Similarly, the storage locations of second FIFO
storage unit 33 include a second insert storage location, into which each packet number NR~ can be written, and a second removal storage location from which each such packet number can be read. Insert and removal locations of .FIFO storage unit 33 would also be indicated by the pointers of the addressing 'system, as discussed above.
°fhe second insert storage location is advanced by the medium access control unit writing a packet number NR~ into FIFO storage unit 33. The second removal storage location .is advanced by the host processor reading a packet number from FIFO storage unit 33. Constructed as such, a packet number can be written into the stoxage location of FIFO
storage unit by the medium access control unit, and a packet number stored in the removal storage location an be selectively read therefrom by the host processor. Similar to FIFO storage unit 32, FIFO storage unit 33 also has a w port which provides a "not empty" signal when the FIFO
storage unit contains one or more packet by way of line ,,. ~,:, ,., .,; :~. , :: : Y ,: .;: ': -:.
ir.
t,..
S
...C , ,., ) n S .,.''-~'.'~:i . !~ .~ .' Y o.~,. I . ..~,~ s . r , .. , ,. , .
1..~1-~' ~..' " . , ..... ..:. . ' .: :.~. " .' ~':"~ .':.," :i~...:.
...~~....'..., .~ . ,,.,.. ~ '.
' : '. .. .,. ~: ,,.;,.... .' .."; .,... ... ,.... . ...: ,.. ; ~ ~ ~:;n '.
.".~.. ' '..1 WO 92/20028 PCT/US92t03502 3 2 ;:
46, numbers. As illustrated, this "not empty~~ signal is transmitted to -the receive interrupt storage register contained within CPU interface unit 3d.
As illustrated in Fig. 7, the output of first FIFO
storage unit 32 is provided to a second input of multiplexes M; by way of line 47, whereas the output of the second FTFO storage unit 33 is provided to both the CPU
interface unit and an input of multiplexes Mz by way of lines 48A and 488, respectively. The outputs of multiplexers My and MZ, in turn, are provided to first and second 'inputs of multiplexes M3 by way of lines 49 and 50, whereas eleven bit address lines 43 and 44 from CPU
interface unit 30 and MAC interface unit 31, respectively, are provided to inputs of multiplexes M3. By way of lines . .
51A and 51B, the two outputs of multiplexes M3 are provided to two inputs of the memory management unit, which as indicated, have been designated fox addresses AT; or ARC and packet numbers NT; or NR~
Tn order to selectively transmit Requests Rv; and RR~
to the memory management unit, data line 52 is provided between the output of xnultiplexer M4 and the request input port of memory management unit 35. In order to issue assigned packet numbers NT; and NR~ from the memory management unit to the host processor and medium access control unit, respectively, data lines 53A and 53B are provided, as shown. To selectively transmit page releases F(Nr;) and F(NR~) to the memory management unit, data line 54 is provided between the output of multiplexes and in the release input port of the memory management unit.
In order to provide the host processor and the medium access control unit selective access to single~part buffer memory 34, the output of multiplexes M6 is connected ..,. .
to the data port of buffer memory 34 by way of lines 55.
Physical output from the memory management unit is ..,,.. , ,.,, ,,, , , . , .:. ..: : ~~.~.,.;::, .,, . . ., ;.. , .; . , : ;:.
. ... ; , :
. , r.. . .~. ;: ~. ~ , : ~. '::: . ~ ~ . ., ,. , .. ; ; ': :. ' ;' ~ . : , ..
;; ,,.,, ,,, , ~;. , , ~ ,'',, , ;, : . ., ;~ . ;.:. :.; .; ,, , ; :~.: .,- : ~. ~:: , .,' '::;
., ~.
,~
''-, ' ;' ~ . :. ...,;

Y!'~ 92/20028 PC'f1U~921035~2 ~~~~~ a provided to the address input port of buffer memory 34, by way of lines 56 as shown.
With the above-described arrangement, host processor can transfer packet numbers NT; and NR~ to memory management unit 35 through selective control of multiplexers Mz and M3. The medium access control unit can transfer packet numbers NT; and NR~ to memory management un9.t 35, through selective control of multiplexes M~ and M3. Transfer of linear addresses to windows W~p" and WP"e~are achieved through selective control of M3.
Referring to Figs. 7A, 7E and 7C, the various functional subcomponents of the memory management unit of the first embodiment of the present invention, will now be described.
As illustrated in Fig. 7A, memory management unit 35 of the first embodiment comprises address conversion unit 60, page allocation and management unit 61, and packet number assignment unit 62. The function and operation of the memory management unit and its functional subcomponents identified above, are best understood in terms of what the host processor and the medium access control unit are required to do during data packet starage within any particular embodiment of the present invention.
In general, to store a data packet in buffer memory 34, a request for storage space, RT; or RR~, must be made.
Each,such request (i) specifies how many (M) pages of data byte storage locations are required to store the data packet, and (ii) solicits a unique packet number, to which M free (i.e., vacant) pages of buffer memory will be allocated. When the request has been satisfied, the assigned packet number NT; or NRj Can be obtained from bus lines 53A, 53B. In the illustrated embodiment, sat~afaction of a memory storage request requires the cooperative involvement of page allocation unit 61 and packet number assignment unit 62 in order to carry owt several critical functions.
. ; .,, ;,:. , r ,;,,. ::v ; ;' ' < : .,, v. : .y'.-:, :;, ,.. ;y~. v ;, ::..
:;: ;
~.~.. .: .~... : ,:; .. , -y.: . .. ' .,;, ,... , ~: . ;. : . ' ~ :~ .. '.
. r-:,... ......' '~...',..: '.'~~. ~ :..'..., . :''9 .i:' :~'~':: .~'~, . :.' ,.,: ::." , ~. '.,..,:. ,. ...,., , ;..";r ~.'..',:, r ;','.~, : '. : ', , .'~~ ~ . v '.,.. .... ' ; . ~ ' , ..
... : . '~ .... p.". :r~ ~' ~ ~ . '.~,,~ ~.. :..,',y ., . .: .:.. ,.'.~ , . .
,.
..v..;.'..~'... "..:, r . ,'~ ~'.'~. . .':.... ,, .. .~.'rs ':~:' ~n. ...;,..
. '~ ~: ~.,',' . .~.. . .. ~~'' '... .'.
:.~
a ' . ." ~,.:..' .,..; . ,. ~ ,.:: : ',~ .: , ,. '.. , : ..,... '. : ~,, ~.:' ' ;~ F r .', :., ~.~~,. '.
: :,'. -~'yi.~ i'~'': :.,':.: : ; '~.~.' ~ ,',' ~~. ,'. '~:~:.~ ,".'. .'.,:.~' v.', ~.. ' : .r: : '-''.' ~ ,.,.' .~.... ';~:..". ' .
".'...: . , .. ~.... ", . .'.,..:.. ',. ',.,. .:.,. ~:: .. ' , . ,.: .' ' ...
.. ;.,, ~ ' "... : 1' : ~..'.., :..1 .~:,~,~;. '. ~ ~ ..,... ...~. . .. ..

WO 92/2Ua28 P~ T/US92/'03502 : .. .. , In particular, page allocation and management unit 61 stores information relating to free (i.e., vacawt) pages in buffex memory 34, and is capable of updating this , information upon the presence of a Release (i.e. F(NT~), F(NR~) or storage space Request RTq, RR~) . This page .
allocation information can be stored in a table of the type shown in Fig. 7C. As discussed hereinabove, the buffer memory of the first illustrated embodiment has eighteen pages of 25s data byte storage locations. Thus, each page in buffer memory is represented in the first row of the table by CK, which ranges from 0 to 17 as shown. w While values of CK are shown in base-ten notation, these page numbers are in actuality represented as five bit digital numbers, for reasons which will become apparent hereinafter.
In the second row of the table of Fig. 7C the page status is indicated below the page number. For example, if page CK is occupied, then there is no packet number present in the table entry location associated with it. On the other hand, and if.page CK is free, or not occupied, then a free-marker or flag "F" is placed therein, as shown for pages 11, 12 and 13. In the third row, the data pac3tet which occupies a particular page is indicated by placing its packet number in its table entry location.
For example, since data packet DTo has been allocated six ' pages, i.e:, 0, 1, 2, 9, to and 15 in buffer memory, ;
packet number NT; = 0 is written in each column of pages 0, 1, 2, 9, to and 15 as shown. In this way; by simply referring to this table, it is possible to quickly determine (i) what pages in buffer memory are free and (ii) what data packet (identified by its packet number) has been allocated to any particular memory page. Using this table it is also possible to release those pages of buffer memory which have been allocated to a particular packet number. All that is required is to search the third row for a particular packet number (e.g. NT; _ ~) and ~.
.,, , . -.;; , ,: :., ~.,; ,. ,,,. ,.., ., :;. ,~, ,,.. . f; : -,.~. . . , ;;
,;,: :.. w . , ; ,...: ,; .., ,. . , ;,,, ,,,,, - ., .:,: -;; . ,;:; . . ; v: . ::;; ,. ' : . . , ,'.' "':, : .
;~:.: ; ~'. . ;. : .. ; ., ,; ~: ; . , .
", w .". "': . '.'r ':'. v.:; . , ~ -. ~- : ': ;v,v' ~~; , v . ''..:; ;: ,;; ..-,;,. ~.:.~::, .
1. .... n(. ~S
\ i .
S . . ~,SS.. ..
4' . n .. . u. .., ..., ,.. ..Te,. ,.,.. , . . ~., . ,. ,. .. . . ,. ~. . n. . .. ..
. ... . . .. ,.. . .

WO 92/2(102 ~~ lPC'~°/US92103502 ~.~~~~~3J
delete each occurrence of this packet number and insert the free-marker "F" in the second row above each deleted packet number.
When a request R1; from the host processor for M free 5 pages appears at packet number assignment unit 62, a sequence of operations occur. First, a "page request"
signal is generated by packet number assignment unit 62 and transmitted to page allocation and managemewt unit 61 over line 63. In response to the page request signal, the 10 second row of the table of Fig. 7C is searched to determine if there is a free page available for allocation to an available packet number. If there is a free page available at the time of the page request signal, then the available packet number is assigned to the data packet Dr;
15 and then it is written into the.third row of the table below the free page. Then, page allocation and management unit 61 transmits to packet number assignment unit 62 over line 64, a °'page request granted'° signal, and upon the receipt thereof, packet number assignment unit 62 counts a 20 page as having been allocated to the assigned packet number. This page allocation process is carried out sequentially for each page request, that is, by allocating a single free page at a time through granting of page requests, until M free pages have been allocated, After 25 each free page allocation, the assigned packet number is written into the third row of the table, under the allocated free page. Upan completion of M sequential page allocations to the assigned packet number, packet number ' assignment unit 62 then places the assigned packet number 30 Ng; onto data bus lines 53A. This °'valid" packet number is transmitted to CPU interface unit 30 where it is stored in the MMU interrupt storage register, which can be read by the host processor:
~f, however, it is determined after any number of 35 sequenta.al searches through °the table of Fig. 7C, that there are not M free pages available in buffer memory at . ,,, V, . ;,; ,, . ,; : .. ... , ;:,: :...: ; . : .; . ~r ., .r.:: -. ~ . .
:,, ~ , .~ . : , : ,, ,.; .: . :, v:. ..
. .. ..,.;.. .. :: : .. . . ,,;,.,-.. , , ;.. ,. ,... ,,, ,,~ . ,;,;..<. ;;.:
:; :. ~:, . , ~~ .. . .
.,,; . ,_.,.., ..... : :: :, :.,. ; .. ,,.... ,,, .. ;; , , .. .;... ,.;:,~ :
.:. , .:: .. ~.;. ,.. ;.._:: ,:;:
;. , ..,.., , ' ~~ ; ~.-: v~: ;, ~ ~. ...:: v , ...;..;. ;:.. ,.,,, .., ".
,,., v . -, ~ . .. : ...:: ,, , . ..,;. ~:: v.: y,y :; . :;:,,, ;.;., , , , r ;;: ; ,; . , ~v;; . , ,~ . . : . -: ; .

W~ 92/20026 PCT'1U~92/03502 the present time, then a '°page request denied" signal will be generated by page allocation and management unit 61 and transmitted to packet number assignment unit 62. In response, packet number assignment unit 62 places and "invalid" packet number onto data lines 53A. This invalid packet number is transmitted to CPU interface unit 30 where it is stored in the MMU interrupt storage register.
As discussed hereinabove, this register is read by the interrupt generating circuit, which, in response, will generate an MMiJ interrupt to the host processor. Then, upon reading this five-bit MMU interrupt storage register, the host processor will determine that its request RT; has not been granted. Since, however, the host processor has ample buffering capabilities for storing transmit data packets, the page allocation and management unit 61 will continue to sequentially search the second row (i.e., page status row? of the table of Fig. 7C, and will allocate the required number of free. pages, one by one, as they become released. After each additional free page has been allocated, a "page request granted" signal is generated and transmitted to packet number assignment unit 62. When packet number assignment unit 62 has counted M number of free pages as having been allocated to the assigned packet number, packet number assignment unit 62 will place the assigned (valid) packet number onto data bus lines 53A.
The assigned packet number :is then transmitted to CPU
interface unit 30 and stored in the MMU interrupt register. As described above, the interrupt generating unit will read this register and in response, produce an NlMU interrupt to the host processor in order to cause it to read the MMU interrupt storage register and find that the requested buffer memory space has become available arid allocated to the packet number in the storage register.
This packet number can be used by the host processor to load a transmit data packet from the transmit queue in °
., WO 92/20028 PCTiUS92/03502 3?
system memory to the transmit queue being maintained in buffer memory 34.
After the packet number is no longer needed by the medium access control unit, the pages allocated to 'this packet number can be released by transmiti~ing a Release F(NT;) or F(NR~) to page allocation and management unit 61, along with the packet number. This release operation involves simply deleting each occurrence of the assigned packet number NT;, NR~ in the third row of the table of Fig.
l0 ?C, and to insert therefor in each corresponding column in the second row, the free-marker "F".
The operation of memory management unit 35 is different when attempting to satisfy a request RR~
presented by the medium access control unit in order to obtain a packet number and storage space in buffer memory 3~. Unlike a request RT; from the host processor seeking a packet number and storage space for a transmit data packet of known byte length, the length of an incoming data packet is typically not known to medium access control units performing most protocols, fc~r example, the Etlxernet~ protocol. Moreover, even in certain networks using the IEEE 802.3 protocol, where data count information is provided, the medium access control unit in principle will not want to rely on this~information.
Thus, when receiving an incoming data packet, an alternative procedure for memory storage requisition is carried out by the memory management unit of the first embodiment. This alternative procedure will be described below.
When a memory storage request R~~ from the medium access storage unit appears at packet number assignment unit 62 as shown, a sequence of operations occur. First, a "page request'° signal is generated and transmitted to page allocation and management unit 61. In response to the page request signal, the second row of the table of Fib. 7C is searched to determine if there is a free page ...

i~'t~ 92/2U028 PCTIL~S92103502 .
~~.~~8~~ ~.'~~

available for allocation to an available packet number.
As in the case of transmit packet requests, if there is a free page available at the time of the page request signal, then the available packet number is assigned to the incoming data packet DRS and then it is written into the third row of the table of Fig. 7C, below the free page. Then, page allocation and management unit 61 transmits to packet number assignment unit: 62, a "page request granted '° signal, and upon receipt: thereof, the packet number assignment unit 62 counts a first page as having been allocated to the assigned packet number. At this stage of the process, the memory management unit does not know if a single page of buffer memory is sufficient to store the incoming data packet. However, presuming that a single page of buffer might b~ sufficient, packet number assignment unit 61 places the assigned packet number NR~ onto data line 538. The assigned packet number is transmitted to MAC interface unit 31 and stored in the packet number storage register (not shown). The medium access control unit reads this register and uses the packet number to load the first page of data bytes into the first allocated page in buffer memory 34. The process by which packet loading occurs involves linear-to-physical address conversion, using the packet.number and address on conversion unit 60. Notably, only linear addresses corresponding to a first page (e.g. 256 data Bytes) are generated and provided to the address conversion unit in order to write in the first data page of the incoming data packet. The details of this address conversion process will be described in detail hereinafter.
Sf another page buffer memory is required to store the complete incoming data packet, then the medium access control unit presents to the. packet number assignment unit 62, a second request for an additional page of memory to be allocated to the originally assigned packet number.
The above-described page allocation process is carried out ''.
.
.
~

, :... ,.. ~. !,ivf,.; "::. ., ~ ' ' . ,.'~. .' s~.' ., ...: . .. ~ .~.. . :'-,., ,' ~' ,. , . ':.;,; . .: ..: , ~:..:. .~ .,~ . '' ~. . i' ~., " ~ y'., .
.. ' ,.,'... '.'' . .:'~ ; , '.' . ,. ,. '~:....
~i'''." ' , ' .' ''? .,.. ,;,. ..:.' , ,, ' . :.~" ~.!..
: .;: ~: ",: . :.:. .' ..

fV~ 92/20028 ~' ~ I~ ~ ,J ~ P~Cf/US92/03502 by again transmitting a page request signal to page allocation and management unit 61. If an additional free page is found after searching the table of Fig. 7C, then this page is allocated to the originally assigned packet number, and the data in the table of Fig. 7C is used to update page allocation information contained in address conversion unit 60. Then, a page request granted signal is transmitted to packet number assignment unit 62. In response, the assigned packet number is again placed onto lines 53B and appears in the packet number storage register in the M.~C interface unit. This prompts the medium access control unit to write the second page of the incoming data packet into buffer memory 34. This is achieved by simply providing to the address conversion unit, the assigned packet number and a set of linear addresses corresponding to the second page of data bytes within the incoming data packet. For each additional page needed to store the incoming data packet, the above process of additional page requisition, page allocation, 2a address conversion information updating, linear address generation and packet number presentment, is performed.
When sufficient pages have been allocated and the entire incoming data packet is received. and stored into buffer memory 34, the data packet and page allocation table of Fig. 7C will be complete, and using this table, the information regarding address conversion will have also been completely updated. At this stage, the medium access control unit will write the assigned packet number NRJ into the insert storage location of second FIFO storage unit 3a 33. In this way, when the assigned packet number NR~ is read out from FIFO storage unit 33 by the host processor during data packet unloading operations, this packet number arid its complete range of linear addresses will simply ensure access to the corresponding data packet, 3~ wh~:rever it may be physically stored in buffer memory.
Thereafter, a receive interrupt to the host processor is wo 92e2oo2a ~creus9zeo3so2 ~:~.~~~~~0 4n generated automatically as described hereinabove, in order to notify the host processor that a receive data packet is stored in memory buffer 34 and is ready for unloading. , Tf, however, during 'the page request and allocation process described above there is not a free page .
available, then reception of the incoming data packet will be lost. This is because the medium acce~a control unit does not have ample buffering capabilities.; if it did, .
then it could buffer a page of incoming data bytes while awaiting for a free page of 'buffer memory to become available. When a free page is not available, page allocation and management unit 61 generates a "page request denied°' signal that is transmitted to packet number assignment unit 62. In response, an invalid packet number is placed on data lines 53B and the medium access control unit will issue a free F(NR~) to page allocation arid management unit 61 in order to release all pages allocated to the assigned packet number which corresponds to the inc~ming data packet ''lost'° due to insufficient buffer storage space. This release operation involves simply detecting each occurrence of the assigned packet number in the third row of the table of Fig. 7C, and to insert therefor in each corresponding column of the second row, the free-marker '°F°° .
Having described the function and operation of page allocation and packet number assignment in the memory ' management unit of the first embodiment, attention is now directed to the address conversion unit thereof.
In general, address conversion unit 6o converts each set of Linear addresses generated for a particular data packet, into a corresponding set of physical addresses in buffer memory 34: Most importantly, it does sa in a manner completely transparent to the host processor and the medium access control unit. To carry out this address 35' conversion process, address conversion unit 60 requires ~
information regarding the relationship between each packet r - .:, ,. : ~ . ,,;.. ; ? , ,.:-~-:~.~ ~.;. ~', , ;. , :; ~"; ,.. ::: , -~;
:: ':'. , '';. : '. ' : .., . . , . ;':: . ~ . , ,. , ::': ; ; , v . ,':
: r . :. ':.,. .: :... r. , . .; ,~. ~..; > . ; . : .; ..~.w. , .. ., . .! , .
.:. . s;..
r . :: ~ . .~, . a . _ ' ''i.
v ' W ;:~., ,..:~',:!. ,y.;, .~,y' ,' -1:i.. .;~. m- ?.~'. , . . . ~
..;:~...,.,';:.., .. ! .,. .. ~ :. ~ . :.,~,: ,;., : .~, ..., ~~. '.~', ~~~.. . ... ~'.' , .
;,,~.. , ., ~ ,,.~.'.,. ..~.'.. ..
.. i ;.. . .:.~..' ..... .~.,~. ...~. ", '. ~~.,~~ ~...~' ..-. .:.~ ...~, .;
"...,,'.;'; :~,, ,.,~, , :, ~.;', ,,.. ~ ' v~ '~. ~~'...' ,;~ .' ~,:'~~ ;.,: : ,.~, .: ~. ~ ',~' , ..". ',.... ~ :'.

si. a~ r~;-~ ~n W~ 92/2(?02~ ~;. ~ 1.) J r~ ~'~ J Pf.T/~Jfi92/03502 number (Nr~, or NR~) and the pages allocated to it at any particular instant in time. This information is, of course, not static but rather changes over time in a dynamic manner. For example, at one instant when packet number N1; = 0 is assigned to a long transmit data packet, this packet number may have eight pages (CK) allocated to it; whereas at a later time, when packet number N~~ = 0 is assigned to a short data packet, this packet number may have only one page (C~) allocated to it. ~.Chis time variant nature of page allocation and packet number assignment is characteristic of dynamic page allocation and dynamic packet number assignment of the present invention.
As illustrated in Fig. 7B, the Address Conversion Table shown embodies essential information regarding the relationship between each valid packet number and the pages allocated to it by page allocation arid management unit 61. This Address Conversion Table is simultaneously constructed during memory allocation, using the information contained in the table of Fig. 7C. To achieve the necessary data transfer functions, write and data lines 65 and 66 are provided between units 60 and 6l, as shown.
As illustrated, the.Address Conversion Table has eighteen columns, one column~for each gasket number.
Initially, these packet numbers, ranging from 0 through 17, can be allocated to either type of packet upon a first-came-first-serve basis, as described above. As shown, the Address Conversion Table has eight rows, each row corresponding to a page of data (e. g., 256 bytes}
within a packet. For each data packet, either stored or about to be stored in buffer memory, a packet number has been assigned and each page of data in the data packet will most likely not be stored in the same page of buffer memory. For example, the data bytes comprising transmit data packet DTO, assigned packet number °°0°~, are stared in pages (CK) 0, 1, 2, 9, 10 and 25. ~y searching for the ~1'~ 92/2002 PCT/US92/03502 4a assigned packet number in the table, the physical page locations (i.e., CK) in buffer memory can be simply determined.
As illustrated in Fig. 6 and 7A, each linear address has a first linear address component A~ and a second linear address component A2. As discussed hereinabove, the first linear component within 'the memory management unit, represents the page of a particular data byte within the data packet, whereas second linear address component represents the location of the particular data byte within the specified page. Using this relationship, Address Conversion Unit 60 is reduced to generating a physical address A' which also has two components: the first physical address component A~' being the physical page location CK, and the second physical address component AZ' being the physical location of each byte within the physical page location CK. This process is achieved for transmit data packets (i) by using the packet number and the address conversion table of Fig. 7B, to convert ''on the fly" the three-bit linear address component A~ into the five bit physical address component CK, to which linear address component A~ has been allocated; and (ii) by simultaneously passing the eight-bit linear address component AZ to the output, to provide the eight bit physical address component A'z. The result is a thirteen-bit physical address AT;' _ { CK, AZ) where C~ represents the five most significant bits and AZ represents the eight least significant bits. The thirteen-bit physical address AT;' is then provided to the address port of buffer memory 3~, to facilitate reading out and writing in data bytes of the corresponding data packet. The above address conversion process is performed in the same manner for each receive data packet DRS, in which each linear address ARC _ {A~, A~) is converted into physical address ARj' _ (CK, AZ), defined above, . . ,,,, , ;.: , , _: , , : ; . ' ; ~. .. ~ :; ; ;;: : : ~,: , ,. "..~;..., , .,:
. , ,,,. ., ~ :.;. . ,, ,;, .:;. a ..
. , % , .1': ,; ' ' w . ' . , .: .:: ... ~. ., ,, . ,; , ..,. , . .. ., W~ 92/2028 r' r> ; ~ :f~ PCT/U~92103502 The first embodiment of the present invention described above is characterized by the capability of mapping a data packet into one or more fixed length pages (of 256 bytes) of buffer memory, in a completely transparent and memory efficient manner. This technique is preferred in applications where buffer memory is to be provided on a single-chip communication controller, and efficient memory utilization is a consideration more important than high capacity data packet queuing within the communication controller. In an alternative second embodiment of the present invention, it is possible to enhance data packet queuing within the communication controller, at the expense, however, of less efficient memory utilization. This can be achieved by simply making the storage capacity of each page in buffer memory equal to the byte length of memory access windows W~~" and W~"Gy which in the second illustrated embodiment is also 2 kilobytes in length. The second embodiment of the present invention will now be described below, with reference to 'Figs. 9, 9', 10, 10A, 10B and 1.OC.
In Figs. 9 and 9', the process of accessing buffer memory according to the second embodiment of the invention, is illustrated. Queuing of data packets in the second embodiment is identical to that in the first embodiment. The packet number assignment process is, however, slightly different in the second embodiment, in that a packet number will be assigned to a data packet so long as a single free page in buffer memory is available for allocation. If there is such a free page available, 'then the page will be allocated to an available packet number and thereafter this packet number will be assigned to the data packet requesting buffer storage space and a packet number. There is no need for the memory management unit to make two or more page requests in order to allocate sufficient buffer memory to store a particular length data packet.
.~~., ~:,;: ; . : : ,,.. y,,:. .., ' . .':'.. ~.: ,;: , , :.:v ': . . v : ::
.: ;: ' , .,:. ,., . :... .. .
,. .,;; .;.~ ;..,: ,:.;, ..,_ ,: . ,.. ,, ..; , ... .,, .: ,,.,, ';.;. :'.
;:
' r.... , ,..;.,., ;::, ;,! .w ~..- ,,.....:~ , ~ ~."~~..... r.. . ,,y; ~
~'.,,;, -,,.~ , ~,.'' ;,. .:...
<'n ,,.'y;n ~:~: . ;y:~ ~ : ;~.~' ..r~ ..~' :. ..~ : "y~ . ~:..:. , ~.'.. ,' -:;,.
,, :,.. ,.. .: .~:.,,.;, ....' ~, ~.~ :~. ~ ... ,, ...
_~,.,..,.. ,,..-~~ , ~ .;.:. :..,;,;,~ ~ , .,,,,. ,'.~, .,,..; , . ."'~~:. . i ~. ~~" , .... : ;. ,. :. : :'.: ~ ::. :.. -:'~. ~' ~.. ~ y .;.. -WO 92i2002~ . , . ~ , P~T/US92/03502 In the second embodiment, linear address generation is same as in first embodiment. Again, the purpose of the linear address generation process is to generate a set of linear addresses which define the length of the data packet and to use these linear addresses to either write into or read from memory access windows W,~~, or WMe~, the data packet assigned to a particular packet number.
As illustrated in Fig. 9', address conversion in 'the second embodiment is different in one important respect.
That is, each data packet written into or read from a memory access window W~~, or WNe~, is about to be or has been stared within a single page of buffer memory, which in the exemplary embodiment, has a length of 2 kilobytes. The details of this address conversion process will be described hereinafter in connectian with the communication controller of the second embodiment.
In Fig. 10, a communication controller 3' according to the second embodiment of the present invention, is shown. All structural components of this embodiment are identical to those shown in Fig. 7 in connectir~n with single chip communicator controller 3 of the first embodiment. As such, similar structures are indicated by similar reference numbers. Cne apparent difference shown in Fig. 10 is that buffer memory 34' is not contained on the communication controller 3', but is realized on a separate TC chip interfaced with communication aowtroller chip 3' of the second embodiment.
Fig. 10A illustrates the functional subcomponents of the memory management unit of the second embodiment of the present invention. As illustrated, memory management unit 35' comprises address conversion unit 50', memory allacation. and management unit 61' and packet number assignment unit 62', which are functionally analogous to their corresponding units in the memory management unit of Fig. 7A.

di'~ 92/20028 ~~ '' . ,~~ P~.-rius9zio3soz ,.--,, Packet number assignment unit 62' is adapted ~to receive Requests RT;a~ RRj from the host processor and medium access control unit respectively, and in response engages memory allocation and management unit 61° to 5 search for and allocate a free page to the data packet associated with the request. Tf a free page exists, then it is allocated to an available packet number which is written into the third row of the table oi' Fig. IOC. This table is maintained by memory allocation and management 10 unit in a manner similar to the table of Fig. 7C. Also, as illustrated in Fig. 10C, each free page of memory is indicated by the free-marker °'F", to facilitate identification of free pages during each page request ' search through the table. Aside from the fact that the 15 table of Fig. 10C accounts for thirty-two pages in external buffer memory 34', the principal difference with ,this table is that only one physical page location (i.e., CK) is allocated to each packet number. This is consistent with the principle that each data packet can be stored 20 entirely within a single page of allocated buffer memory.
Tf the host processor presents a request Rr; to packet number assignment unit 62°, the packet number assignment unit will transmit a page request signal to memory allocation and management unit 61', which, in 25 response, searches through the second row of the table of Fig. 10C in order to find the first free-marker °'F°'. Upon finding the first free-marker, the available packet number is written into the third row in the same column entry occupied by the first free-numbert the free marker is 30 deleted: and a page request granted signal is transmitted to packet number assignment unit 61°. Tn response, packet number assignment unit 62 places the assigned packet number onto data lines 53A; which transmits the packet number to the. transmit interrupt storage register in CPU
35 interface unit 30. The host processor immediately reads this request to obtain the assigned packet number.
..
v::.'. '. : .. ,;. , ; ;: ,, :.:. :: ; , : ~: : ~ ... ..
,,.
", . : ,.. : . ,:: ,..: ~, ,;;. , :.:. ,' ' . ;: ~:;,: ., . ;. , ,, ..,> v.:y: ,.,:;:,, . : ~ ,..... ~,,;.,r . .:r ;:~ , . ,,. , ,," ,.,,.,....,..
.,,,, ; -..,..:.
. , ;<;. . , ..; , ... . . . .;. .. . ,.., ,. ,. . , ;. . ;;., ,. ,,:. , : .. ,. ., ,~.,,, ; :;,:. ::.: ,.,,; ,,.,,, ; ::.v v:r': ~;' ...'; ;. .. .,. ,., ~ . . v:~ ': '° . ; , . ': :, , . ; : , ~
;.,, , , , , .~, , . , ;..
,;. ,..... . ,,,, .. ; :,:, y., ; .. v': ;~' ''v:~ , , ::.., , .~.. :; ,.. ~ .
.- ~: : ; ..::., : .. : ~:.

wo 92izoo2s ~crms~zio~soz .-..

If memory allocation and management unit 62' does not find any free pages available in buffer memory 34' after a search through table of Fig, IOC, then a page request denied signal is transmitted to packet number assignment unit 61', which in response, transmits an invalid packet number to the transmit interrupt storage register in CPU interface unit 30. Upon reading this register, the host processor ascertains that a buffer memory is presently not available for storage of a transmit data packet, and thus must await for a MNiU
interrupt to be generated. Upon transmission of the page request denied signal, page allocation and management unit 62' continues to search the second row of the table of Fig. lOC until a free-marker is found. At this point, the corresponding page is allocated to the available packet number and the packet number allocation unit transmits a (valid) assigned packet number to the MMU interrupt storage register, by way of data lines 53A. The interrupt generator reads this register and in response, generates a 2o MMU interrupt to the host processor, notifying it that a packet number has been assigned to its request for data storage space in buffer memory 34'.
Tf the medium access control unit presents a request R~~ to packet number assignment unit 62°, the packet number assignment unit will transmit a page request signal to memory allocation and management unit 61'. The page allocation~unit 61' will search for a free page and allocate it when found, in a manner performed in connection with satisfying request RT;. The result is a packet number transmitted to the receive interrupt storage register in MAC interface unit 31, where it is read by the medium access control unit. Tf, however, a free page is , not available, the memory allocation and management unit will not continue to search for a free page, and thus the incoming data packet will become lost.
::' : ..: : :: :w :: .,. v. ' > .;:;..., ,. ... ~ '; ,.: , ;, ..,, ;
... :. .. ;;.. . ;,>, . ..., .x ..<.: wh':; r ~4. :
n : . ~"....s : :.. ' .c .. y.~,: i~. . . ..:t c...ct~: %,..<,> .,.~ u;a.-. ..w,:
.. ...,.,.:. .....v't.... ....~.r,.x..;,:.:..~..:...,~~, , .,.. .....;....>. . . ,. . .. n,. ~ ,J ..r....:.:.,.. ...:.~. :: ....
.:...u...,. w . ~. :. , v... ;.!..,.~.,..-yw . :..: ~ . :... ~ .s.
. . : ....,:::.. ,:
,..:.... .,.. , , WO 92/2(302y'C.'T/U~92/03502 ~ ~ ~~r~~

As with the memory management unit of the first embodiment, allocated pages can be released by both the host processor or the medium access control unit by presenting to page allocation and management unit 62', a Release F (NT; ) , F (N~~ ) simultaneously with t:he corresponding packet number, as described hereinbefore in connection with communication controller of Fig. 7. Each released page in buffer memory 34' will 'thereafter hold the free--marker "F" in each corresponding page entry location in the table of Fig. 10C.
When writing into or reading from data packet windows W~P~ and W~~, linear addresses must be converted into physical addresses, as discussed hereinbefore. The address conversion process occurring in address conversion unit 60', utilizes the Address Conversion Table of Fig.
108. This Table is functionally analogous to the address conversion table of Fig. 7B. To achieve necessary data .
transfer, write and data lines 65 and 66 are provided between unit 60' and 61' as shown. Again, all of the data in the table of Fig. lOB is obtained from the table of Fig. 10C, which is used to update the Address Conversion Table after each new page allocation, as well as page release operation within memory allocation and management unit 61'. ~
Alternatively, however, instead of using a table to implement address conversion unit 60', a simple one-to-one identity function, such as Ck = NT;, can be used in effectuating linear-to-physical address conversion.
Advantageously, this approach eliminates the use of the Table of Fig. 10B and markedly simplifies the Table of Fig. 10C by eliminating the need to maintain the third row thereof.
As illustrated in Fig. 10A, each linear address AT;
(and ARC) has eleven-bits which represent within the memory management unit of the second embodiment, the physical location of the particular data byte within the data ~.~.,~;.~,. a ~ i t. : s,r n, -~ r !..:?.,.v ~.~. ~.. ~':.t!(., r..uYn:;~...~r M ...e,-..', ., . sw?, t ,. ~.

wo ~zrzooz~ , ,_ ,. ; ; Pcrrus9zro3soz ~'~f~~~u packets. The page within the buffer memory is not specified by these linear addresses. For transmit data packets, the address conversian process is achieved (i) by using the packet number and the address conversion table of Fig. lOB (or function CK~NT;, to convert °°on the fly°° .
the packet number NT; into the five-bit physical address component CK, to which the packet number NT; has been pre-allocated; and (ii) by simultaneously passing 'to the output line 56, the eleven-bit linear address componewt AT;
which is representative of the eleven bit address component Az. Each resulting sixteen-bit physical address Af; ° ° { CK, AT; ) is then provided to the address port of buffer memory 34 to facilitate reading out or writing in the bytes of the corresponding data packet. The above address conversion process is performed in 'the same manner for receive data packets DR', in which each eleven bit linear address A~j is converted into a sixteen-bit physical address ARC _ { CK, AR j } .
The communication controller of the above described embodiments generate transmit and receive interrupts to the host processor by detecting empty and not empty signals from the transmit and receive packet number queues 32 and 33, respectively. Using this technique, transmit interrupts are generated only when the entire transmit packet number queue 32 is empty, whereas receive interrupts are generated any time there is at least one packet number in the receive packet number queue 33. In certain applications, however, it may be desired or required to generate a transmit interrupt after each data packet transmission or after the completion of a predetermined number (M) of data packet transmissions which constitute the data of a particular record or data packet sequence being transmitted. Unlike transmit interrupts, however, the generation of a receive interrupt after each data packet reception will be required in nearly all applications, as it is uncertain as to when or CVO 92/2002 ~ ~ ~ r~ ~ ~ ,~~ PCf/LJS9210350~

whether subsequent data packet receptions will occur. Tn addition to such flexible transmit interrupt generation capabilities described above, buffering of corresponding packet numbers would also be desired in order to avoid the need of maintaining software--based packet number queues in system memory, for transmit status monitoring operations.
To achieve these objectives, several transmit interrupt generating mechanisms are described below.
In Fig. 11, a third embodiment of the communication 20 controller of the present invention, is shown. All major structural components of this communication controller 3 "
are identical to those shown in Fig. 7, and as such, similar structures are indicated by similar reference numerals. The only significant difference shown in Fig.
11 is that first packet number queue 32' comprises a functionally independent FIFO storage unit 32A' which is connected to the insert storage location of functionally .
independent FIFO storage unit 32B'. Also, the first removal location of the transmit packet number queue 32' 2o is connected to the first input on multiplexer M~ by way of line 47'. The removal storage location of FIFO starage unit 32B° provides the second removal storage location of the transmit packet number queue 32' and, is connected to CPU interface unit 30 by way of line 70, in Larder to provide packet numbers to the host processor when needed during transmit status monitoring operations. In order to generate transmit interrupts to the medium access control unit (i.e. to initiate unloading of transmit data packets), the "not empty" port of FIFO storage unit 32A' is connected to MAC interface unit 31 by way of line 45A'.
Similarly, in order to generate transmit interrupts to the host processor (i.e, CPU), the "not empty" port of FIFO
storage unit 32B' is connected to CPU interface unit 30 by way of line 45B'.
To obtain a clearer understanding of the transmit interrupt generating mechanism of this aspect of the wo 9zezoozs Pc~reus~2ro~soz ~1~~~~
invention, reference is made to Fig. 11A which illustrates an embodiment of the packet number queues within communication controller 3 " . While transmit packet number queue 32A' can be implemented as a pair of discrete 5 FIFO storage units configured in the manner illustrated in .
Fig. 11, a more efficient approach is illustrated in Fig.
11A. In particular, a single FIFO storage unit 71 of storage depth 18 is addressed using a pointer control system 72 that functionally emulates a transmit packet 1.0 number queue having a single insert location and first and secand removal locations. As illustrated, pointer control system 72 generates pointers PST, PZT arid PST in response to write signal WP~T and read signals RP~.~ and Rp~T, respectively. Write signal WPiT is generated by the host .5 processor (i.e. CPU) and is provided to pointer control unit 72 in order to move (i.e. advance] point or PST. By this operation, pointer P1T is able to designate (i.e.
address), at each instance in time, the insert location into which each packet number Nr; is to be written in FIFO
20 storage unit 71 by the host processor after completion of a transmit packet loading operation. Read signal RF2T is generated by the medium access control unit and is provided to pointer control unit 72 in order to move pointer P2T. By this operation, painter PZT is able to 25 designate, at each instance in time, the first removal location from which each packet number can be read and provided to multiplexes M~, as illustrated in Fig. 3.1.
Notably, each such packet number corresponds to the next data packet awaiting transmission. Read signal RP3r, on 30 the other hand, is generated by the host processor and is provided to pointer control unit 72 in order to move pointer PTA. By this operation, pointer P3T is able to designate, at each instant in time, the second removal location Pram which each packet number NTt-azT can be read by 35 CPU interface unit 30, as shown.

,~ PCT/~J~92/03502 ~t~:~~)J_) In order to generate a "not empty" signal when a packet number resides in the second portion of the 'transmit queue (i. e. , between pointers PZ.~ and PST) , arithmetic unit 73 and comparator unit 74 are provided.
Tn operation, arithmetic unit 73 compares pointers PTA and PTZ (i.e. compute ~zT=P3r'PZr) and this value dzT is then provided to comparator unit 74. In the illustrated embodiment, pointers PST Pzr and P3T are each 5-bit words.
If dzT ~ 0, indicative of the second portion of the l0 transmit queue not being empty, then a logical "1" is generated; otherwise a logical "0" is generated. The output of comparator unit 74, in turn, is provided to the interrupt generating circuit 75 in CPU interface unit 30.
Only if the output of comparator unit 74 is a logical "~L'°, then a transmit interrupt to the host processor is generated. As illustrated, packet number I~T;.azr at 'the second removal location can be read by CPU interface unit 30, as shown.
As illustrated in Fig. 11A, receive packet number queue 33 is conventional in that it comprises a single FIFO storage unit 80 of storage depth 18. FIFO storage unit 80 includes one insert location, one removal location, and a non-empty signal port. Pointer control unit 81 generates pointers PAR and PzR in response to write signal WP~iR and read signal RPzR, respectively. Write signal WP~R is generated by l~AC interface unit 31 and is provided to pointer control unit 81 in order to move (i.e., advance) pointer P». By this operation, pointer P»
is able to designate, at each instance in time, the insert location into which each packet number NRj is to be written in FIFO storage unit 80 by the medium access control unit after completion of a receive packet loading operation. "
Read signal RPzR, on the other hand, is generated by host processor and is provided to pointer cr~ntrol unit 82 in order to move pointer PzR. By this operation, pointer Pz~
is able to designate, dt each instance in.time, the sole VNO 92/2Ua28 PCT/US92/03502 .~.-., r~ rp r~
Na~.~~ ~~t~ 52 removal location from which each packet number NR~.azR is provided to multiplexes Mz and can be, read by CPU interface unit 30, as shown in Fig. 11. Notably, each such packet number corresponds to the next received data packet awaiting to be unloaded by the host processor.
In order to generate a "not empty" signal when a packet number resides in the receive packet number queue (i.e., in locations addressed between pointers PAR and Pz~) arithmetic unit 82 and comparator unit 83 are provided.
In operation, arithmetic unit 82 compares pointers PzR and PAR (i.e., computes ~zR=PZR'°P1R) and this value dzR is then provided to comparator unit 83. In the illustrated embodiment, pointers PAR and PzR are each 5~-bit words. As in the transmit queue, if bZR~O, indicative of the receive queue not being empty, then a logical "1" is generatedt otherwise a logical "0" is generated. The output of comparator unit 83, in turn, is provided to the interrupt generating circuit 75 as shown. anly if the output of comparator unit 83 is a logical "1°', then a receive interrupt to the host processor is generated. As illustrated, packet number NR~.dzR at the sole removal lpcation of the receive queue 33, is provided to CPU
interface unit 30 for storage in a receive packet number storage register (not shown) which is readable by the host processor.
As a result of the transmit queue structure illustrated in Fig. 1lA and described above, transmit interrupts are automatically generated for each packet number, and each such packet number is accessible to the host processor without requiring storage of the sequence of issued packet numbers (NT;} in system memory.
While not Shown, 'the pointer control system of the transmit packet number queue will include an arithmetic unit and aomparator unit of the type described above for generating "not empty" signals provided to the MAC

!)Vt~ 92/20028 interface unit 31 over line 45A', as illustrated in Fig.
11.
In order to provide yet greater flexibility in the generation of host processor interrupts, and in.particular to selectively generate transmit interrupts after transmission of a particular number of data packets, the communication controller of Figs. 11 and 11A is further modified as shown in Fig. 11B. In such an embodiment, transmit packet number queue 32' and receive packet number 33 of Fig. 11B are similar to those illustrated in Fig.
11A, with the provision of minor modifications to the transmit packet number queue 31 " described below. .
Specifically, each storage location of FIFO storage unit 71° in Fig. 11B is six bits in length, rather five bits as in Fig. 11A. The sixth MSB bit is provided in order to encode the occurrence of a "transmit interrupt"
upon transmission of the corresponding transmit data packet. 'In the illustrated embodiment, the host processor adds either an interrupt generation bit (e:g. "1") or a non-interrupt generation bit (e. g. "O'°) to each assigned 5-bit packet number NT; in order to produce a stream of encoded packet numbers (NT;'} to CPU interface unit 30', as shown. Which packet numbers to encode for transmit interrupt generation, can be decided, for example, on the basis of the known length of each particular record or sequence of packets to be transmitted. In this way, if a transmitted message contains five data packets, then only the fifth (i.e. last) data packet number NT~ need be encoded to generate a transmit interrupt upon completion of data packet transmission of the particular data packet sequence. In such an exemplary case, the packet number sequence (Nz;'} issued and stored in transmit queue 33' ,, might be, for example, as followsv (000000, 000001, 000010, 000011, 100101}. The transmit interrupt issued to the host pr~cessor upon detection of the interrupt generation bit of packet number NT4, in assence, notifiesv .: .; y.~,:,;.,: ~ . :.,,~. . . .... ~ . ., ,~ . ,.... ;. , .. , ,' ,.. ; , . :; ° : . .r :, .. . ;v v ~ . :' .. .,: . . ::.: ; ...: . ~. .. ,,., , , , ; . ; .. .., ,,.., ., ., .
,.. , . ,.., ,.. . : ,;: . ~. .: . ...'.. . ., .. . , r .. . ; :. : , ". .: .
; :: . : ; ..:: , ,.. ,.,. . . , . : ,.: :. ;., :: ,, .
..,;. ;. ; .. ,.. , ,~; ,. .. ,;. ~ :. ," ~ , ;:.;: , . . :": , ': - ,: W':.' ' , .:,' : :' ' ' .:.f~:' ~, . n ..
.'.
"':' .' ', ..., ..i' ,... .,~ ,. .',.',. . .' :.~~..' " ,.';'" .: ~:. :..:' n.
:-'.''' .. '.'i:.~ I .a~.....,.' '. .' ,... . .. ..

fVO 92/20028 P~f/LJ~92/03502 ~~~~U~~ 54 the host processor that this particular data packet sequence has been transmitted.
As illustrated in Fig. 11B, CPU interface unit 30' is also different from CPU interface unit 30 in several important respects. First, a sixth-bit (MSB) comparator .
unit 85 is provided to determine whether tike sixth bit of the packet number NT;-azr at the "second removal location, °' is,either "1°' or °'0", with the former indicating interrupt generation, as discussed above. All six bits of the packet number Nr;_s2r from the sixth bit camparator output are readable by the host processor. The output of comparator units 74 and 83 are provided to interrupt generating circuit 86, as shown. The 5-bit packet. number NRa~a2~ read from the sole removal location of receive packet number queue 80 is also readable by the host processor.
In order to enable CPU interface unit 30° to sequentially search through transmit packet number queue 71' until an interrupt-generation bit (i.e. a logical °'1'°) is found within the sixth-bit of a packet number in the second portion transmit queue, a read pointer (P~) sequences 87 is provided. As shown, read pointer sequences 87 is provided with two inputs, namely, the output of comparator unit 74 and the output of sixth-bit comparator unit 85. The output of read painter sequences 87, in turn, is provided to the first input of logical OR
gate 88. The read signal far transmit status determination, RSV, is provided to the second input of CR
gate 88. The output of pR gate 88, on the other hand, is a read pulse signal RP3T which is provided to pointer control unit 72 in order to selectively control the movement of pointer P3T
Read pointer sequences 87 operates as follows. The ' output of read painter sequences 87 will be logical "1"
only when (i)8zT is not equal to "0" (indicative that the second portion of the transmit queue is not empty) and (ii) the output of sixth-bit comp~rator unit 85 is ''0".
". ,, : : , :., ' : ; I --: . ,, ...: , :: : . .;: ~,;~: : :. ., ' v. .
' ~ .~~. . . :~ .'.'',~~ ..'~,~.~.~ ' ~... ~~..,.. ;.:':.,~,,,. :: ~ ,.:,...
,;.:" .'~~.'r,, ,.,;.:n~.. .:.'. :.'i~ ' :..: ~''..'. .... ...
~m...~'., '-...~.'~ -.:,.. ~....., , :.... ..;:.,.. ' .~:', w..l~~:'. .".'..:
, ,.:i .. ,.:1,. '.~:~. . ,.:". ...,'.' . '..,.,..,. ': ,., '..:
~-.....: ,.., , ,~ ,'.a.~ , . ':: ..; ':.:. . . . ;. '. 1 : ,..~.:' 1 f~fY~<',''"~S;°W
..,;. ~~~. .I'.;.. ~ :'i .~ :,.~'. . , ..' '.'. ,~'.:' ,':iS ' ~~~,. :.~.~~
:.~...... ~' . ~:,.
::.,.,'' , .. . ~:. ,,.,:' 7 : v .. ,. :.' . ... v.. ,. .. ..'..v .~ .'. :' . ~ ' . I ,. .' , . ' ..:::,. ,. ~, ~ ..'., ~ .y.,:. .'.. ~ '. : ~. ~ ~ .. . , '. .. '. '. ' ~ ';:.':>', '.,:~~..,. . ..~.. ':.~ ".,:, ' '...;- .. .:~' , .:~~. ..,..:. :
',:~. ,,., ..w:..: ~'.".:'.... " . .. '.~: ..' .'..'; . .....~ f ''~'.~.~ '':.~~..;.: .'..':~~ -.,':,, ,~;.,'' .~..::: '~,~' ~ '..~::'~: ~.';' ' '.'...: ;: '~y .:'.:. ~'.'.. .. :_ ... ~.. .. .

WO 9Z/20pZ8 PCT/US~2/03502 ~~.~1~~~~ 5s performs. However, full appreciation of, the control operations of medium access control unit is best achieved by obtaining a more complete understanding of the CSMA/CD
protocol.
Tn the CSMA/CD protocol, only one type of "data packet" may be placed on or otherwise transmitted over the communication medium. The transmission format of data packets within this scheme, is illustrated in Fig. 8B. As shown, the data packet transmission format: consists of a sequence of octets placed on a common communication channel.
According to the transmission format, seven octets W~ 92/20028 P~'f/US92/03502 ~~.~~3~;~

operation of the communication controllers in connection with the loading and unloading of data packets in both data transmission and reception modes of operation. While the description of operation applies equally to communication controllers of the first, second and third embodiments, the communication controller of Fig. 7 will be selected for illustration purposes.
Referring to Figs. 5A, 7, 8A, and 11A, loading of a transmit packet into buffer memory 34 by the host processor, will be considered.
As illustrated in Fig. 12A, the first step in loading a data packet involves the host processor requesting allocation of a particular number of pages from the memory management unit. The request RT; will continue to be outstanding until the number of pages requirecl are allocated and an assigned packet number is issued to the host processor. Then, the assigned packet number is ~ ..
written into the packet number input port of the memory management unit. The packet byte count is then written into the third and fourth byte locations in packet window WCs,. Thereafter, data bytes of packet DT; are copied from the transmit data queue in system memory into window W~~", starting at the fifth data byte storage location defined in the window. After loading data packet into buffer memory 34, the host processor writes the packet number used to load the transmit data packet, into the insert '.~ ' storage location of transmit packet number queue 32.
Thereafter, the host processor resumes its normal operations, and will not act upon the just loaded packet number until a transmit interrupt is generated.
In Fig. 22B, the operations involved in unloading a transmit data packet from the buffer memory, are illustrated. When the medium access control until is not engaged in its data gacket reception mode, it can unload transmit data packet from buffer memory 34 provided there is a packet number in removal storage location of the ,:
::
;i;:
. ~ : :~.
::.; ',:~... °,~'.. : .r;...,' ~ ,:'.', .~,;'':: ~,v~'. .;,,~ :~',,,..
,...,.;.; .,;;-7.,..,,,:....;~:..~ ;,~,,... ., ;.:, :.,'~ ,.",,.,,..
; ,' .I, , ~ ,- . ..; , , ;:;., ; ;,; ~,;,; , ; ,, , : . ,'i , ' . . ..,r : ~ .': ,; ~ , , " : . ;,; ,,,, .;;, ,,., , ,,; ~ . : . ;
,.:;:: ;, ', , S ..1...15.. . . . . .
.~
:, , ' .. ;'~ ~~...,;.. . ~'~.,,'s ~'..:.. ;..~.'~ ...~'.:' '~.; i S ' :".
..~. '.~.'~~~.i~..' ,.'.. f. . ~.: .a ':~~ ... ~. n, :'.' .: ,,,.: .;. .~?: .;'~ ,-1~;~.,. ..."
',.,,. ., ~.~~ ..

fVO 92/20028 PCT/US92/U3502 ~~.~ ~~~~ i 58 first FIFO storage unit (i.e., transmit packet number queue) 32. To determine if 'this condition exists, the "empty" signal transmitted from FIFO storage unit 32 to MAC interface unit 31 over line 45, is checked to determine its value. If :it is logical "0", then 'there is , at least one packet number NT~ in FIFO storage unit 32t otherwise, if it is logical "1", then the FIFO storage unit is empty and no transmit packet unloading is possible. In response, the medium access control unit first reads a packet number from the removal location FIFO
storage unit 32. This packet number is then transmitted to the packet number input port of the memory management unit, to generate physical addresses corresponding to stored data packet. Then the byte count in the third and fourth byte storage locations in the memory access window W"~~ are read out by the medium access location control unit and stored. Notably, this byte count indicates what the linear length of the linear addresses must be in order to read out the data bytes of the stored packet. The data bytes of the stored packet are then read (i.e., copied) from the memory access window W"~~ by generating linear addresses indicated by the byte count. These unloaded data bytes are transmitted over the communication medium in the normal course. If the data transmission is successful, then the medium access control unit may simply release the pages allocated to the unloaded transmitted data packet. Alternatively, it can write transmit "pass"
status bytes into first and second byte locations of window W"~~, to the host processor.
If at any time first FIFO storage unit 32 is empty, a signal indicative of this condition is transmitted from the first storage unit to the CPU interface unit, which, in turn, is used to generate a transmit interrupt to the host processor. This interrupt serves to notify the host processor that transmit data packets from system memory ~
,.:
,;.:~". :. c,. .. ' . ;: ;. ,.:,, i ~:..: ,;. :;,.,.
,;: > , , ..,;, WO 92/20028 ~ _~ ~ j ; j ~ ~~y ~ FCTlgJ~92/03502 can be loaded into the buffer memory, and that all previous transmits are completed.
Referring to Fig. 13A, loading of "receive data packet into buffer memory 34 will be considered. Upon indication that an incoming data packet is being received, the medium access control until issues a Request RRj to the memory management unit, for a first page of allocated memory and an assigned packet number NR~. If the allocation is unsuccessful, then the incoming packet cannot be received. If, however, memory page allocation is successful, then the assigned packet number is temporarily stored and used to write up to 252 data bytes into the memory access window W"~C, starting at the fifth byte location. If no additional data bytes are incoming, then the error checking (CRC) code is used to validate the received data, and on the basis of such validation, receive status bytes are written into first and second byte locations of memory access window W~~. Also, the byte count is written into the third and fourth byte ...~...
locations of the memory access window W",aC. Finally, the receive packet number is written into the insert location of second FIFp storage unit 33, while~a receive interrupt to host processor is generated by a ''Not Empty" signal transmitted from the second FIFO storage unit 32 to. CPU
interface unit 30, over line 46.
If additional bytes are being received, the memory access control unit will make a request for a second free page of buffer memory, using the same assigned packet number. If the second page is allocated, the additional data bytes will be written into this new page. This process of page requisition and allocation and data byte storage is repeated as many as eight times if necessary, in order to store the incoming data packet. After checking the validity of received data (i,e., through CRC) and writing receive~status and byte count data into 'the first four byte locations. of the memory access window W"~~, WO 92/2002 . P~Cf/U592103502 '~',~.~J~B~o so the packet number is written into the insert location of second FIFO storage unit 33, while a receive interrupt to host processor is generated as described above. In the event of an invalid CRC, or any storage request RR~ is denied, then all allocated pages associated with the assigned packet number will be released.
Referring to Fig. 13B, unloading of receive data packets will be considered. iJpon receiving a receive interrupt, the host processor reads the packet number from removal location of .second FIFO storage unit 33, Note that the receive packet number is also presented to multiplexer M2. The receive status data is then read from first and second byte locations in window W~~,. If this receive status data indicates that the associated packet data is worthy of unloading, then the byte count is read out :From the third and fourth byte locations in window WC~" and are then stored. Thereafter, starting from the fifth byte location through those locations indicated by the byte count, data bytes of the packet are read from buffer memory 3~. The host processor then issues release command F(NR~) to free those pages allocated to packet number 2dR~ .
In the illustrated embodiments of the present invention, the storage units of the transmit and receive packet number queues were realized using FIFO storage units 32 and 33. Notably, however, it is expected that other types of suitably modified storage devices can be used with goad results.
While the particular embodiments shown and described above will be useful in many applications in the data communication art, further modifications of the present invention herein disclosed will occur to persons skilled in the art to which the present invention pertains. All such modifications are deemed to be within the scope and spirit of the present invention defined by the appended claims.

Claims (44)

IN THE CLAIMS:

1. A method of buffering data packets using a data communication controller which is interfaced with a processor and includes a control means for accessing a communication medium, said method comprising the steps:
(a) providing a data packet storage means managed by said data communication controller independent of said processor, said data packet storage means including a plurality of data page storage locations for storage of one or more data packets;
(b) said data communication controller assigning a packet number to a data packet to be stored in one or more of said data page storage locations;
(c) said data communication controller storing said data packet in one or more of said data page storage locations, by (1) said processor generating a first set of linear addresses ranging from a first minimum address value to a first maximum address value, and (2) said data communication controller using said packet number assigned to said data packet in step (b) and said first set of linear addresses to generate a corresponding set of physical addresses which define the physical location of said one or more data page storage locations in said data packet storage means;
(d) said data communication controller maintaining a packet number queue in said data communication controller, for storing one or more of said packet numbers, each said packet number corresponding to one said stored data packet;
(e) said data communication controller storing in said packet number queue, said packet number assigned to said stored data packet in step (b);
(f) said data communication controller retrieving said stored packet number from said packet number queue; and (g) said data communication controller retrieving said data packet stored in said one or more data page storage locations during step (c), by (1) said control means generating a second set of linear addresses ranging from a second minimum address value to a second maximum address value, and (2) said data communication controller using said packet number assigned to said data packet in step (b) and said set of linear addresses to generate a corresponding set of physical addresses which define the physical location of said one or more data page storage locations in said data packet storage means.

2. The method of claim 1, where in step (d), said packet number queue has a plurality of storage locations including an insert storage location at which each packet number is inserted into said packet number queue, and a removal storage location from which each packet number is removed from said packet number queue.

3. The method of claim 2, wherein step (e) comprises said data communication controller storing said assigned packet number in said insert storage location of said packet number queue, and step (f) comprises said data communication controller removing said packet number from said removal storage location of said packet number queue.

4. The method of claim 3, wherein step (b) further comprises (1) said data communication controller determining the number of data page storage locations required to store said data packet, (2) said data communication controller allocating said required number of free data page storage locations for storing said data packet, and (3) said data communication controller assigning said packet number to each of said allocated data page storage locations.

5. The method of claim 1, which further comprises said processor maintaining independent of said data communication controller, a first data packet queue for storing one or more data packets to be transferred from said processor to said communication medium by way of said data communication controller, and wherein step (c) further comprises (3) said processor transferring said data packet from said first data packet queue to said data communication controller, and said data communication controller transferring said data packet to said one or more data page storage locations specified by said generated set of physical addresses.

6. The method of claim 5, wherein step (g) further comprises (3) said data communication controller transferring said data packet from said one or more data page storage locations specified by said generated set of physical addresses, to said control means for transfer to said communication medium.

7. The method of claim 6, which further comprises after step (g), (4) said data communication controller providing said generated set of physical addresses to said data packet storage means, and (5) said data communication controller writing transmit status data from said control means, into said data page storage locations specified by said generated set of physical addresses.

8. The method of claim 7, which further comprises after steps (4) and (5), (6) said data communication controller providing said generated set of physical addresses to said data packet storage means, and (7) said data communication controller reading said transmit status data from said data page storage locations specified by said generated set of physical addresses.

9. The method of claim 5, which further comprises said processor maintaining independent of said data communication controller, a second data packet queue for storing one or more data packets transferred to said processor from said communication medium, and wherein step (c) further comprises (3) said control means transferring said data packet to said data communication controller, and said data communication controller transferring said data packet to said one or more data page storage locations specified by said generated set of physical addresses.

10. The method of claim 9, wherein step (g) further comprises (3) said data communication controller transferring said data packet from said one or more data page storage locations specified by said generated set of physical addresses, to said processor.

11. The method of claim 10 which further comprises after step (c) , (4) said data communication controller providing said generated set of physical addresses to said data packet storage means, and (5) data communication controller writing receive status data from said control means, into one or more of said data page storage locations specified by said generated set of physical addresses.

12. The method of claim 11, which further comprises after steps (4) and (5), (6) said data communication controller providing said generated set of physical addresses to said data packet storage means, and (7) said data communication controller reading said receive status data from said one or more data page storage locations specified by said generated set of physical addresses.

13. A method of buffering data packets using a data communication controller which is interfaced with a processor and which includes a control means for accessing a communication medium, said method comprising the steps:
(a) providing a data packet storage means managed by said data communication controller independent of said processor, said data packet storage means including a plurality of data page storage locations for storing one or more transmit data packets and one or more receive data packets;
(b) said data communication controller maintaining a transmit packet number queue, for storing one or more packet numbers, each said packet number stored in said transmit packet number queue corresponding to one said transmit data packet:
(c) said data communication controller maintaining a receive packet number queue for storing one or more packet numbers, each said packet number stored in said receive packet number queue corresponding to one said receive data packet;
(d) said data communication controller assigning a first packet number to a transmit data packet to be stored in one or more of said data page storage locations:
(e) said data communication controller storing said transmit data packet in one or more of said data page storage locations by (1) said processor generating a first set of linear addresser ranging from a minimum address value to a maximum address value, and (2) said data communication controller using said first packet number assigned to said transmit data packet in step (d) and said first set of linear addresses so as to generate a first set of physical addresses which defines the physical location of said one or more data page storage locations in which said transmit data packet is stored in said data packet storage means:
(f) said data communication controller storing in said transmit packet number queue, said first packet number assigned to said stored transmit data packet during step (d):
(g) raid data communication controller assigning a second packet number to a receive data packet to be stored in one or more said data page storage locations:
(h) raid data communication controller storing said receive data packet in one or more of said data page storage locations, by (1) raid processor generating a second set of linear addresser ranging from a minimum address value to a maximum address value, and (2) raid data communication controller using said second packet number assigned to said receive data packet in step (g) and said second set of linear addresses so as to generate a second set of physical addresses which defines the physical location of said one or more data page storage locations in which said receive data packet is stored in said data packet storage means;

(i) said data communication controller storing in said receive data packet number queue, said second packet number assigned to said receive data packet during step (g) ;
(j) said data communication controller retrieving said first packet number from said transmit packet number queue;
(k) said data communication controller retrieving said transmit data packet from said data packet storage means, by (1) said control means generating said first set of linear addresses, and (2) said data communication controller using said first packet number assigned to said transmit data packet in step (d) and said first set of linear addresses so as to generate said first set of physical addresses which defines the physical location of said one or more data page storage locations in which said transmit data packet is stored in said data packet storage means, and after retrieving said transmit data packet, said data communication controller providing said retrieved transmit data packet to said control means;
(1) :said data communication controller retrieving said second packet number from said receive packet number queue; and (m) said data communication controller retrieving said receive data packet from said data packet storage means, by (1) said processor generating said second set of linear addresses, and (2) said data communication controller using said second packet number assigned to said receive transmit data packet in step (g) and said second set of linear addresses so as to generate said second set of physical addresses which defines the physical location of said one or more data page storage location in which said receive data packet is stored in said data packet storage means; and providing said retrieved receive data packet to said processor.

14. The method of claim 13, where in step (b) said transmit packet number queue has a plurality of storage locations including a first insert storage location at which said first packet number is inserted into said transmit packet number queue, and a first removal storage location from which said first packet number is removed from said transmit packet number queue, and where in step (c) said receive packet number queue has a plurality of storage locations including a second insert storage location at which said second packet number is inserted into said receive packet number queue, and a second removal storage location from which said second packet number is removed from said receive packet number queue.

15. The method of claim 14, wherein step (f) comprises said data communication controller storing said first packet number in said first insert storage location, and wherein step (j) comprises said data communication controller removing said first packet number from said first removal storage location.

16. The method of claim 15, wherein step (i) comprises said data communication controller storing said second packet number in said second insert storage location, and wherein step (1) comprises said data communication controller removing said second packet number from said second removal storage location.

17. The method of claim 16, wherein step (d) further comprises (1) said data communication controller determining the number of data page storage locations required to store said transmit data packet;
(2) said data communication controller allocating said required number of free data page storage locations for storing said transmit data packet and (3) said data communication controller assigning said first packet number to each said allocated data page storage location; and wherein step (g) further comprises:
(1) said data communication controller determining the number of data page storage locations required to stone said receive data packet, (2) said data communication controller allocating said required number of free data page storage locations for storing said receive data packet, and (3) said data communication controller assigning said second packet number to each said allocated data page storage location.

18. The method of claim 13, which further comprises said processor maintaining independent of said data communication controller, a transmit data packet queue for storing one or more transmit data packets to be transferred to ;aid communication medium, and wherein step (e) further comprises (3) said processor transferring said transmit data packet from said transmit data packet queue to said data communication controller and said data communication controller transferring said transmit data packet, to said one or more data page storage locations specified by said generated first set of physical addresses.

19. The method of claim 13, which further comprises after step (k), (3) said data communication controller providing said generated first set of physical addresses to said data packet storage means, and (4) said data communication controller writing transmit status data from said control means, into one or more of said data page storage locations specified by said generated first set of physical addresses.

20. The method of claim 19, which further comprises after steps (3) and (4), (5) said data communication controller providing said generated first set of physical addresses to said data packet storage means, and (6) said processor reading said transmit status data from said one or more data page storage locations specified by said generated first set of physical addresses.

21. The method of claim 13, which further comprises said processor maintaining independent of said data communication controller, a receive data packet queue for storing one or more receive data packets transferred from said communication medium to said processor, and wherein step (h) further comprises (3) said data communication controller transferring said receive data packet from said control means, to said one or more data page storage locations specified by said generated second set of physical addresses.

22. The method of claim 21 which further comprises after step (m), (3) said data communication controller providing said second corresponding set of physical addresses to said data packet storage means, and (4) said data communication controller writing receive status data from said control means, into one or more of said data page storage locations specified by said corresponding second set of physical addresses.

23. The method of claim 22, which further comprises after steps (3) and (4), (5) said data communication controller providing said corresponding second set of physical addresses to said data packet storage means, and (6) said control means reading said receive status data from said one or more data page storage locations specified by said generated second set of physical addresses.

24. A data communication controller for interfacing with a processor and for operably associating with a data packet storage means having a plurality of data page storage locations for storing one or more data packets, said data communication controller comprising:
a control means for accessing a communication medium:
memory management means for managing said data packet storage means independent of said processor by assigning a packet number to each data packet to be stored in said data packet storage means and allocating one or more of said data page storage locations for storing each said data packet to be stored;
linear address bit receiving means for receiving one or more sets of linear address bits from said processor or said control means, each said set of linear address bits corresponding to one said data packet to be stored and ranging from a minimum address value to a maximum address value;
physical address generating means for generating a set of physical addresses for each data packet to be stored in said data packet storage means, by using the data packet number assigned to said data packet to be stored and said set of linear address bits corresponding to said data packet to be stored, each set of physical addresses corresponding to one or more data page storage locations in said data packet storage means and providing access to said one or more data page storage locations;
data packet transfer means for transferring data packets between said processor and said data packet storage means, and for transferring data packets between said data packet storage means and said control means;
a packet number queue for storing a plurality packet numbers, each said packet number stored in said packet number queue being accessible by said processor and said control means; and packet number transfer means for transferring said packet numbers from said packet number queue and at least one of said control means and said processor, and for transferring packet numbers from said memory management means to at least one of said control unit and said processor.

25. The data communication controller of claim 24, wherein said packet number queue has a plurality of storage locations including a first insert storage location at which each said packet number is inserted into said packet number queue, and a first removal storage location from which said each packet number is removed from said packet number queue.

26. The data communication controller of claim 25, wherein said memory management means comprises data page determining means for determining the number of data page storage locations required for storing each said data packet, data page allocating means for dynamically allocating said required number of free data page storage locations to said data packet, and packet number assigning means for dynamically assigning the corresponding packet number to each said allocated free data page storage locations.

27. The data communication controller of claim 25, wherein each said set of physical addresses specifies at least one byte of memory for storage of status data regarding each said corresponding data packet, and wherein said data packet transfer means can selectively transfer said status data (i) from said control means to said at least one byte of memory storage, and (ii) from said at least one byte of memory storage, to said processor.

28. The data communication controller of claim 24, wherein there is a fixed address increment between each consecutive pair of address values.

29. The data communication controller of claim 24, wherein a first predetermined number of the most significant bits of said set of linear address bits represent a page of packet data for storage in one said data packet page location of said data packet storage means, and wherein a second predetermined number of the least significant bits of said set of linear address bits represent the range of data bytes contained in each said page of packet data for storage in each said data packet page of said date packet storage means.

30. The data communication controller of claim 26, wherein said memory management means further comprises releasing means operably associated with said data page allocating means for releasing data page storage locations allocated to corresponding packet number, in response to a release request made in connection with said corresponding packet number.

31. data communication controller of claim 26, wherein said data page determining means is responsive to an initial page request and to one or more additional page requests, as incoming data associated with a receive data packet is being received.

32. The data communication controller of claim 24, wherein said packet number queue comprises a FIFO storage device.

33. The data communication controller of claim 24, wherein said memory management means further comprises data page allocating means for dynamically allocating one or more free data page storage locations in said data packet storage means, for storage of each said data packet, and packet number assigning means for dynamically assigning said corresponding packet number to said one or more allocated free data page storage locations.

34. A data communication controller for interfacing with a processor and for operably associating with a data packet storage means having a plurality of data page storage locations for storing one or more transmit data packets and one or more receive data packets, said data communication controller comprising:
control unit for accessing a communication medium;
memory management means for managing said data packet storage means independent of said processor by assigning a packet number to each said transmit data packet and each receive data packet to be stored in said data packet storage means and allocating one or more data page storage locations for each said transmit data packet and said receive data packet to be stored linear address bit receiving means for receiving one or more sets of linear address bits from said processor or said control means, each said set of linear address bits received from said processor corresponding to one said transmit data packet and ranging from a minimum address value to a maximum address value, and each said set of linear address bits received from said control unit corresponding to one said received data packet and ranging from a minimum address value to a maximum address value;
physical address generating means for generating a set of physical addresses for each data packet to be stored in said data packet storage means, by using the data packet number assigned to said corresponding data packet to be stored and said set of linear address bits corresponding to said data packet to be stored, each said set of physical addresses corresponding to one or more data page storage locations and providing access to said one or more data page storage locations:
data packet transfer means for transferring one or more said transmit data packets between said processor and said data packet storage means and between said data packet storage means and said control means, and for transferring one or more said receive data packets between said control means and said data packet storage means and from between said data packet storage means and said processor:
transmit packet number queue for storing one or more packet numbers, each said packet number stored in said transmit packet number queue corresponding to one said transmit data packet stored in said data packet storage means;
receive packet number queue for storing one or more packet numbers, each said packet number stored in said receive packet number queue corresponding to one said receive data packet stored in said data packet storage means; and packet. number transfer means for transferring packet numbers from said memory management unit to said processor, for transferring packet numbers from said transmit packet number queue to said control means, for transferring packet numbers from said memory management to said control means, and for transferring packet numbers from said receive packet number queue to said processor.

35. The data communication controller of claim 34, wherein said transmit packet number queue has a plurality of storage locations including a first insert storage location at which each said packet number is inserted into said transmit packet number queue, and a first removal storage location from which each said packet number is removed from said transmit packet number queue, and wherein said receive packet number queue has a plurality of storage locations including a second insert storage location at which each said packet number is inserted into said receive packet number queue, and a second removal storage location from which each said packet number is removed from said receive packet number queue.

36. The data communication controller of claim 35, wherein said transmit packet number queue comprises a first FIFO storage device and said receive packet number queue comprises a second FIFO storage device.

37. The data communication controller of claim 34, wherein said memory management means comprises data page determining means for determining the number of data page storage locations required to store each said data packet, data page allocating means for dynamically allocating said required number of free data page storage locations to said data packet, and packet number assigning means for dynamically assigning the corresponding packet number to said allocated free data page storage locations.

38. The data communication controller of claim 34, wherein each said set of physical addresses specifies at least one byte of memory for storage of status data regarding each said corresponding data packet, and wherein said data packet transfer means can selectively transfer said status data (i) from said control means to said at least one byte of memory storage, and (ii) from said at least one byte of memory storage, to said processor.

39. The data communication controller of claim 34, wherein there is a fixed address increment between each consecutive pair of address values.

40. The data communication controller of claim 34, wherein a first predetermined number of the most significant bits of said set of linear address bits represent a page of packet data for storage in one said data packet page location of said data packet storage means, and wherein a second predetermined number of the least significant bits of said set of linear address bits represent the range of data bytes contained in each said page of packet data for storage in each said one data packet page of raid data packet storage means.

41. The data communication controller of claim 37, wherein said memory management means further comprises releasing means operably associated with said data page allocating means for releasing data pages allocated to the corresponding packet number, in response to a release request made in connection with said corresponding packet number.

42. The data communication controller of claim 37, wherein said data page determining means is responsive to an initial page request and to one or more additional page requests, as incoming data associated with a receive data packet is being received.

43. The data communication controller of claim 34, wherein said packet number queue comprises a FIFO storage device.

44. The data communication controller of claim 34, wherein said memory management means further comprises data page allocating means for dynamically allocating one or more free data page storage locations in said data packet storage means, for storage of each said data packet, and packet number assigning means for dynamically assigning said corresponding packet number to said one or more allocated free data page storage locations.