Recherche Images Maps Play YouTube Actualités Gmail Drive Plus »
Connexion
Les utilisateurs de lecteurs d'écran peuvent cliquer sur ce lien pour activer le mode d'accessibilité. Celui-ci propose les mêmes fonctionnalités principales, mais il est optimisé pour votre lecteur d'écran.

Brevets

  1. Recherche avancée dans les brevets
Numéro de publicationUS20050135251 A1
Type de publicationDemande
Numéro de demandeUS 11/057,912
Date de publication23 juin 2005
Date de dépôt15 févr. 2005
Date de priorité7 oct. 2002
Autre référence de publicationUS6886141
Numéro de publication057912, 11057912, US 2005/0135251 A1, US 2005/135251 A1, US 20050135251 A1, US 20050135251A1, US 2005135251 A1, US 2005135251A1, US-A1-20050135251, US-A1-2005135251, US2005/0135251A1, US2005/135251A1, US20050135251 A1, US20050135251A1, US2005135251 A1, US2005135251A1
InventeursJames Kunz, William Gustafson, Leonard Haseman
Cessionnaire d'origineKunz James A., Gustafson William J., Haseman Leonard W.
Exporter la citationBiBTeX, EndNote, RefMan
Liens externes: USPTO, Cession USPTO, Espacenet
Method and system for reducing congestion in computer networks
US 20050135251 A1
Résumé
A system and method for discarding expired network data packets is provided. A time stamp value is assigned to data packets that are received in a data packet queue, wherein the time stamp value is based on a counter value. The time stamp value is extracted after the counter value changes or a new data packet is received at the head of the data packet queue. The extracted time stamp value is then compared with the counter value. Data packets with expired timer value are discarded.
Images(6)
Previous page
Next page
Revendications(24)
1. (canceled)
2. (canceled)
3. (canceled)
4. (canceled)
5. (canceled)
6. (canceled)
7. (canceled)
8. (canceled)
9. (canceled)
10. (canceled)
11. A system for discarding expired network data packets, comprising:
a counter for inserting a time stamp value in data packets received in a data packet queue; and
a comparator for comparing an extracted time stamp value and a counter value generated by the counter, wherein the time stamp value is extracted before a data packet is processed or while a data packet is waiting at a head of a data packet queue, and a packet is discarded if a time stamp value for the packet has expired.
12. The system of claim 11, wherein the counter value includes a base increment value.
13. The system of claim 11, wherein the counter value includes a value generated by a first programmable register.
14. The system of claim 11, further comprising:
a second register for storing the extracted time stamp value.
15. The system of claim 14, wherein the comparator checks for data packet expiration if the counter value has changed or if the second register is loaded with a new data packet at the head of the data packet queue.
16. The system of claim 11, wherein the time stamp value is inserted in a start of frame header of a data packet.
17. A method for discarding expired network data packets, comprising:
inserting a time stamp value in data packets that are received in a data packet queue, wherein the time stamp value is based on a counter value;
extracting the time stamp value before a data packet is processed or while a data packet is waiting at a head of a packet queue;
comparing the extracted time stamp value with the counter value; and
discarding a data packet if the time stamp value has expired.
18. The method of claim 17, wherein the counter value is based on a base increment value and a programmable register value.
19. The method of claim 17, wherein the time stamp value is inserted in a start of frame header of a data packet.
20. A network having a switch, comprising:
a system for discarding expired network data packets, wherein the system includes a counter for inserting a time stamp value in data packets received in a data packet queue, wherein the time stamp value is inserted in a start of frame header; and a comparator for comparing an extracted time stamp value and a counter value generated by the counter, wherein the time stamp value is extracted before a data packet is processed or while a data packet is waiting at a head of a data packet queue, and a packet is discarded if a time stamp value for the packet has expired.
21. The network of claim 19, wherein the counter value includes a base increment value.
22. The network of claim 19, wherein the counter value includes a value generated by a first programmable register.
23. The network of claim 19, further comprising:
a second register for storing the extracted time stamp value.
24. The network of claim 22, wherein the comparator checks for data packet expiration if the counter value has changed or if the second register is loaded with a new data packet at a head of the data packet queue.
Description
    BACKGROUND
  • [0001]
    1. Field of the Invention
  • [0002]
    The present invention relates to computer networks, and more particularly to reducing congestion in computer networks.
  • [0003]
    2. Background of the Invention
  • [0004]
    Computer networks are used in every facet of today's business and personal life. Whether it involves sending electronic mail or accessing remote data, a computer network is used to accomplish various tasks.
  • [0005]
    In a typical computer network, data packets enter a data path serially, one after another, and then data packets are processed individually. The number of data of data packets received in a data queue is based on the size of the queue, which can be programmed by a user. Hence, in some instances a large number of data packets may be received in a data packet queue. If in-order data packet processing is required, then the packet at the beginning (“head packet”) must be processed first and packets following the head packet must wait for processing. This results in packet congestion. If the head packet never gets processed, then the data path stalls and hence must be re-set. This results in inefficiency and can be very expensive for businesses.
  • [0006]
    Computer networks today cannot afford to have congestion and stall problems. Conventional data packet techniques do not solve the foregoing congestion and stalling problems. Conventional techniques require separate memory buffers to store data packets. This increases cost and makes the process inefficient since additional operations are needed to write/read data packets from the memory buffers.
  • [0007]
    Therefore, what is needed is a process and system in a network for discarding data packets that have been received for a certain period.
  • SUMMARY OF THE INVENTION
  • [0008]
    In one aspect of the present invention, a system for discarding expired network data packets is provided. The system includes a counter for assigning a time stamp value for data packets received in a data packet queue; and a comparator for comparing an extracted time stamp value with a counter value generated by the counter. The time stamp value may be based on the upper two bits of the counter value. The counter value may include a base increment value and a value generated by a first programmable register.
  • [0009]
    The system also includes a second register for storing the extracted time stamp value.
  • [0010]
    The comparator checks for data packet expiration if the counter value has changed or if the second register is loaded with a new data packet at the head of the data packet queue.
  • [0011]
    In another aspect of the present invention, a method for discarding expired network data packets is provided. The method includes assigning a time stamp value to data packets that are received in a data packet queue, wherein the time stamp value is based on a counter value; extracting the time stamp value after the counter value changes or a new data packet is received at the head of the data packet queue; comparing the extracted time stamp value with the counter value; and discarding a data packet if the time stamp value has expired.
  • [0012]
    In one aspect of the present invention, separate memory buffers or timestamp headers are not required to determine when a packet has expired.
  • [0013]
    In another aspect of the present invention, the time stamp and expiration value may be programmed to meet the granularity needs of different networks.
  • [0014]
    In yet another aspect of the present invention, serial data packet reception is streamlined and data packet congestion is avoided.
  • [0015]
    This brief summary has been provided so that the nature of the invention may be understood quickly. A more complete understanding of the invention can be obtained by reference to the following detailed description of the preferred embodiments thereof concerning the attached drawings.
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • [0016]
    The foregoing features and other features of the present invention will now be described with reference to the drawings of a preferred embodiment. In the drawings, the same components have the same reference numerals. The illustrated embodiment is intended to illustrate, but not to limit the invention. The drawings include the following Figures:
  • [0017]
    FIG. 1A is a block diagram showing plural computer systems operationally coupled to a network;
  • [0018]
    FIG. 1B is a block diagram of the computing systems shown in FIG. 1A
  • [0019]
    FIG. 1C is a block diagram showing a network using the INFINIBAND standard, according to one aspect of the present invention;
  • [0020]
    FIG. 1D is a block diagram of a switch using the system, according to one aspect of the present invention;
  • [0021]
    FIG. 2 is a block diagram of a system according to one aspect of the present invention; and
  • [0022]
    FIG. 3 is a flow diagram of executable process steps for reducing network data packet congestion, according to one aspect of the present invention.
  • DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
  • [0023]
    FIG. 1A is a block diagram showing plural computing systems 101-103 operationally coupled to a network 104. In one aspect of the present invention, network 104 may operate using multiple protocols, for example, TCP/IP, fiber channel or any other protocol.
  • [0024]
    FIG. 1B is a block diagram showing the internal functional architecture of a computing system (e.g. 101). As shown in FIG. 1B, computer 101 includes a central processing unit (“CPU”) 101A for executing computer-executable process steps and interfaces with a computer bus 101F. CPU 101A may be a Pentium™ class processor sold and marketed by Intel Corp.™ or any other processor.
  • [0025]
    Among other components, computing system 101 includes a network interface card (“NIC”) 101B, a rotating disk 101D, random access memory (“RAM”) 101E and read only memory (“ROM”) 101C.
  • [0026]
    NIC 101B provides system 101 with connectivity to network 104. NIC 101B may have its own processor or dedicated chip to conduct specific operations.
  • [0027]
    Disk 101D stores operating system program files, application program files, and other files. Some of these files are stored on disk 101D using an installation program. For example, CPU 101A executes computer-executable process steps of an installation program so that CPU 101A can properly execute the application program.
  • [0028]
    A random access main memory (“RAM”) 101E also interfaces to computer bus 101F to provide CPU 101A with access to memory storage. When executing stored computer-executable process steps from disk 101D (or other storage media such as a floppy disk 16 or via network connection 104), CPU 101A stores and executes the process steps out of RAM 101E.
  • [0029]
    Read only memory (“ROM”) 101C is provided to store invariant instruction sequences such as start-up instruction sequences or basic input/output operating system (BIOS) sequences for operation of keyboards etc. (not shown).
  • [0030]
    FIG. 1C shows a block diagram of plural computing devices operationally coupled using the Infiniband architecture as described in the Infiniband standard specification, published by the Infiniband Trade Association.
  • [0031]
    FIG. 1C shows system 117A with a fabric 117. Fabric 117 includes plural switches 106, 107, 111 and 112. Fabric 117 also includes a router 108 that is coupled to a wide area network 109 and local area network 110. It is noteworthy that network 104 may include both WAN 109 and LAN 110.
  • [0032]
    Switch 106 is operationally coupled to a RAID storage system 105 and system 102, while system 101 may be operationally coupled to switch 107.
  • [0033]
    Switch 112 may be coupled to a small computer system interface (“SCSI”) SCSI port 113 that is coupled to SCSI based devices. Switch 112 may also be coupled to Ethernet 114, fiber channel device (s) 115 and other device(s) 116.
  • [0034]
    FIG. 1D shows a block diagram of switch 112 that includes a processor 120 which is operationally coupled to plural ports 122, 123, 124 and 125 via a control port 121 and cross-bar 119. In one aspect of the present invention, processor 120 may be a reduced instruction set computer (RISC) type microprocessor. Ports 122-125 may be similar to ports 113-116, respectively.
  • [0035]
    Switch 112 may be coupled to a processor 129 that is coupled to Ethernet 127 and serial port 128. In one aspect of the present invention, processor 129 may be similar to CPU 101A in system 101.
  • [0036]
    FIG. 2 is a block diagram of a system 200 that reduces data packet congestion in a network data path 208. Network data path 208 shows data packets received from a device or the network into a switch (112).
  • [0037]
    Network data path 208 shows data packets 200 and 201 moving in direction 208. Data packet 200 includes a start of frame header 200A and end of frame 200C. Similarly, data packet 201 includes a start of frame header 201A and end of frame 201C.
  • [0038]
    When a data packet (e.g.) 200 is received, a counter 203 tags a time stamp 200B to the data packet. Typically, the time stamp code 200B is embedded in the first word of data packet 200. Before data packet 200 is processed or while waiting at the head of a packet queue 208, time stamp code 200B value is extracted by register 206. As discussed below, comparator 205 compares the extracted value 206A with counter 203 value (203A).
  • [0039]
    Counter 203 value 203A may be based on a base increment value and programmable variable time stamp (VTS) register 204 value 204A or any other command from RISC processor 120. This allows VTS register 204 to program the time stamp value 202 using counter 203.
  • [0040]
    Comparator 205 checks if the timer for data packets has expired whenever counter 203 value changes or register 206 is re-loaded (i.e. if new data packets arrive at the head of queue 208). Comparator 205 compares value 206A with counter value 203A to determine if the timer for a packet has expired. Based on the comparison, Comparator 205 generates a pass signal 205B if the timer has not expired, or fail signal 205A, if the timer expired.
  • [0041]
    An example of how the expiration value is determined is provided below:
    • VTS Register 204 value=VTS
    • Base Increment for VTS register 204: M milli-seconds
    • Expiration value: 2M*2{circumflex over ( )}VTS+X %−Y %
  • [0045]
    In one aspect of the present invention, the following values may be used:
    • VTS=8, M=2, X=1% and Y=51%, and expiration value is between 250 ms to 500 ms.
  • [0047]
    The foregoing illustration is an example to show how the components of FIG. 2 will determine if a packet has expired. The example is only an illustration and is not intended to limit the adaptive aspects of the present invention.
  • [0048]
    FIG. 3 shows a flow diagram of executable process steps that allows efficient processing of data packets.
  • [0049]
    Turning in detail to FIG. 3, in step S300 data packets are received from the network. Data packets flow serially in data path 208.
  • [0050]
    In step S301, a time stamp is assigned for a data packet. In one aspect of the present invention, the time stamp is embedded in the start of frame header of the data packet (e.g. 201B). Time stamp 202 is based on VTS register value 204 and may be 2 bits.
  • [0051]
    In step S302, the time stamp value is extracted. The time stamp value is extracted and sent to register 206.
  • [0052]
    In step S303, the time stamp value 206A is compared to counter value 203A. Counter value 203A may be based on VTS register 204 output 204A.
  • [0053]
    In step S304, the process determines if the timer for a data packet has expired. This is determined by the comparison in step S303.
  • [0054]
    In step S305B the packet is discarded if the timer has expired, or kept in the queue, in step S305A, if the timer has not expired.
  • [0055]
    In one aspect of the present invention, separate memory, buffers or timestamp headers are not required to determine when a packet has expired.
  • [0056]
    In another aspect of the present invention, the time stamp and expiration value may be programmed to meet the needs of different networks.
  • [0057]
    In yet another aspect of the present invention, serial data packet reception is streamlined and data packet congestion is avoided.
  • [0058]
    Although the present invention has been described with reference to specific embodiments, these embodiments are illustrative only and not limiting. Many other applications and embodiments of the present invention will be apparent in light of this disclosure and the following claims.
Citations de brevets
Brevet cité Date de dépôt Date de publication Déposant Titre
US729593 *16 déc. 19022 juin 1903Draper CoTake-up-arresting mechanism for looms.
US4081612 *14 juil. 197628 mars 1978Hasler AgMethod for building-up of routing addresses in a digital telecommunication network
US4200929 *23 janv. 197829 avr. 1980Davidjuk Alexandr DInput device for delivery of data from digital transmitters
US4258418 *28 déc. 197824 mars 1981International Business Machines CorporationVariable capacity data buffer system
US5090011 *21 déc. 198918 févr. 1992Hitachi, Ltd.Packet congestion control method and packet switching equipment
US5115430 *24 sept. 199019 mai 1992At&T Bell LaboratoriesFair access of multi-priority traffic to distributed-queue dual-bus networks
US5280483 *9 août 199118 janv. 1994Fujitsu LimitedTraffic control system for asynchronous transfer mode exchange
US5291481 *4 oct. 19911 mars 1994At&T Bell LaboratoriesCongestion control for high speed packet networks
US5390173 *22 oct. 199214 févr. 1995Digital Equipment CorporationPacket format in hub for packet data communications system
US5594672 *20 mai 199414 janv. 1997Micro Energetics CorporationPeripheral power saver
US5623492 *24 mars 199522 avr. 1997U S West Technologies, Inc.Methods and systems for managing bandwidth resources in a fast packet switching network
US5706279 *18 févr. 19976 janv. 1998U S West Technologies, Inc.Methods and systems for managing packet flow into a fast packet switching network
US5732206 *23 juil. 199624 mars 1998International Business Machines CorporationMethod, apparatus and program product for disruptive recovery in a data processing system
US5751710 *11 juin 199612 mai 1998Cisco Technology, Inc.Technique for connecting cards of a distributed network switch
US5757771 *14 nov. 199526 mai 1998Yurie Systems, Inc.Queue management to serve variable and constant bit rate traffic at multiple quality of service levels in a ATM switch
US5892604 *7 mai 19976 avr. 1999Nippon Telegraph And Telephone CorporationATM switch
US5894560 *26 août 199613 avr. 1999Lsi Logic CorporationMethod and apparatus for controlling I/O channels responsive to an availability of a plurality of I/O devices to transfer data
US6011779 *30 déc. 19964 janv. 2000Hyundai Electronics AmericaATM switch queuing system
US6026092 *31 déc. 199615 févr. 2000Northern Telecom LimitedHigh performance fault tolerant switching system for multimedia satellite and terrestrial communications networks
US6046979 *4 mai 19984 avr. 2000Cabletron Systems, Inc.Method and apparatus for controlling the flow of variable-length packets through a multiport switch
US6055618 *31 oct. 199525 avr. 2000Cray Research, Inc.Virtual maintenance network in multiprocessing system having a non-flow controlled virtual maintenance channel
US6185203 *18 févr. 19976 févr. 2001Vixel CorporationFibre channel switching fabric
US6209089 *12 août 199827 mars 2001Microsoft CorporationCorrecting for changed client machine hardware using a server-based operating system
US6230276 *1 févr. 19998 mai 2001Douglas T HaydenEnergy conserving measurement system under software control and method for battery powered products
US6335935 *30 juin 19991 janv. 2002Broadcom CorporationNetwork switching architecture with fast filtering processor
US6343324 *13 sept. 199929 janv. 2002International Business Machines CorporationMethod and system for controlling access share storage devices in a network environment by configuring host-to-volume mapping data structures in the controller memory for granting and denying access to the devices
US6353612 *19 juin 19985 mars 2002Brocade Communications Systems, Inc.Probing device
US6370605 *21 juil. 19999 avr. 2002Sun Microsystems, Inc.Switch based scalable performance storage architecture
US6397360 *28 juil. 199928 mai 2002Lsi Logic CorporationMethod and apparatus for generating a fibre channel compliant frame
US6509988 *16 sept. 199821 janv. 2003Nec CorporationIEEE serial bus physical layer interface having a speed setting circuit
US6522656 *29 sept. 199818 févr. 20033Com CorporationDistributed processing ethernet switch with adaptive cut-through switching
US6563796 *15 mars 199913 mai 2003Nippon Telegraph And Telephone CorporationApparatus for quality of service evaluation and traffic measurement
US6570853 *4 oct. 200027 mai 2003Lsi Logic CorporationMethod and apparatus for transmitting data to a node in a distributed data processing system
US6684209 *27 avr. 200027 janv. 2004Hitachi, Ltd.Security method and system for storage subsystem
US6697368 *15 mai 200124 févr. 2004Foundry Networks, Inc.High-performance network switch
US6697914 *11 sept. 200024 févr. 2004Western Digital Ventures, Inc.Switched node comprising a disk controller with integrated multi-port switching circuitry
US6700877 *23 juil. 19982 mars 2004Siemens AktiengesellschaftMethod and bus system for automatic address allocation
US6738381 *9 nov. 199818 mai 2004Telefonaktiebolaget Lm Ericsson (Publ)ATM time stamped queuing
US6888831 *28 sept. 20003 mai 2005Western Digital Ventures, Inc.Distributed resource reservation system for establishing a path through a multi-dimensional computer network to support isochronous data
US6901072 *15 mai 200331 mai 2005Foundry Networks, Inc.System and method for high speed packet transmission implementing dual transmit and receive pipelines
US6983342 *8 oct. 20023 janv. 2006Lsi Logic CorporationHigh speed OC-768 configurable link layer chip
US6987768 *19 avr. 200017 janv. 2006Fujitsu LimitedPacket transferring apparatus
US6988130 *6 mai 200217 janv. 2006Emc CorporationVirtual ports for partitioning of data storage
US6988149 *26 févr. 200217 janv. 2006Lsi Logic CorporationIntegrated target masking
US7010607 *14 sept. 20007 mars 2006Hewlett-Packard Development Company, L.P.Method for training a communication link between ports to correct for errors
US7024410 *15 déc. 20034 avr. 2006Hitachi, Ltd.Security method and system for storage subsystem
US7031615 *4 oct. 200118 avr. 2006Finisar CorporationOptical channel selection and evaluation system
US7039070 *25 oct. 20012 mai 2006Kabushiki Kaisha ToshibaMoving image packet decoding and reproducing apparatus, reproduction time control method thereof, computer program product for controlling reproduction time and multimedia information receiving apparatus
US7051182 *5 sept. 200323 mai 2006Emc CorporationMapping of hosts to logical storage units and data storage ports in a data processing system
US7187688 *28 juin 20026 mars 2007International Business Machines CorporationPriority arbitration mechanism
US7188364 *25 janv. 20026 mars 2007Cranite Systems, Inc.Personal virtual bridged local area networks
US7190667 *26 avr. 200113 mars 2007Intel CorporationLink level packet flow control mechanism
US7209478 *31 mai 200224 avr. 2007Palau Acquisition Corporation (Delaware)Apparatus and methods for dynamic reallocation of virtual lane buffer space in an infiniband switch
US7215680 *13 mai 20028 mai 2007Nishan Systems, Inc.Method and apparatus for scheduling packet flow on a fibre channel arbitrated loop
US7315511 *26 mars 20021 janv. 2008Fujitsu LimitedTransmitter, SONET/SDH transmitter, and transmission system
US7327680 *5 nov. 20025 févr. 2008Cisco Technology, Inc.Methods and apparatus for network congestion control
US7346707 *16 janv. 200218 mars 2008Advanced Micro Devices, Inc.Arrangement in an infiniband channel adapter for sharing memory space for work queue entries using multiply-linked lists
US7352740 *29 avr. 20031 avr. 2008Brocade Communciations Systems, Inc.Extent-based fibre channel zoning in hardware
US20020016838 *15 déc. 20007 févr. 2002Ceki GelucScheme for blocking the use of lost or stolen network-connectable computer systems
US20020034178 *1 juin 200121 mars 2002Inrange Technologies CorporationFibre channel address adaptor having data buffer extension and address mapping in a fibre channel switch
US20030002516 *29 juin 20012 janv. 2003Michael BoockMethod and apparatus for adapting to a clock rate transition in a communications network using idles
US20030026267 *5 juin 20026 févr. 2003Oberman Stuart F.Virtual channels in a network switch
US20030026287 *31 juil. 20026 févr. 2003Mullendore Rodney N.Method and system for managing time division multiplexing (TDM) timeslots in a network switch
US20030033487 *9 août 200113 févr. 2003International Business Machines CorporationMethod and apparatus for managing data in a distributed buffer system
US20030035433 *16 août 200120 févr. 2003International Business Machines CorporationApparatus and method for virtualizing a queue pair space to minimize time-wait impacts
US20030056000 *24 juil. 200220 mars 2003Nishan Systems, Inc.Transfer ready frame reordering
US20030063567 *2 oct. 20013 avr. 2003Stmicroelectronics, Inc.Ethernet device and method for extending ethernet FIFO buffer
US20030076788 *19 oct. 200124 avr. 2003Sun Microsystems, Inc.Method, system, and program for discovering devices communicating through a switch
US20030079019 *18 janv. 200224 avr. 2003Lolayekar Santosh C.Enforcing quality of service in a storage network
US20030091062 *13 nov. 200115 mai 2003Lay Samuel C.Method and apparatus for providing optimized high speed link utilization
US20030093607 *9 nov. 200115 mai 2003Main Kevin K.Low pin count (LPC) I/O bridge
US20040013088 *19 juil. 200222 janv. 2004International Business Machines CorporationLong distance repeater for digital information
US20040013113 *17 juil. 200222 janv. 2004Ranjeeta SinghTechnique to improve network routing using best-match and exact-match techniques
US20040024831 *25 oct. 20025 févr. 2004Shih-Yun YangBlade server management system
US20040027989 *21 janv. 200312 févr. 2004Brocade Communications Systems, Inc.Cascade credit sharing for fibre channel links
US20040054776 *12 sept. 200318 mars 2004Finisar CorporationNetwork expert analysis process
US20040054866 *5 sept. 200318 mars 2004Blumenau Steven M.Mapping of hosts to logical storage units and data storage ports in a data processing system
US20040064664 *30 sept. 20021 avr. 2004Gil Mercedes E.Buffer management architecture and method for an infiniband subnetwork
US20040081196 *29 oct. 200229 avr. 2004Elliott Stephen J.Protocol independent hub
US20040085974 *10 juil. 20036 mai 2004Vixel CorporationMethods and apparatus for device zoning in fibre channel arbitrated loop systems
US20040085994 *10 juil. 20036 mai 2004Vixel CorporationMethods and apparatus for device access fairness in fibre channel arbitrated loop systems
US20040092278 *22 mai 200313 mai 2004Wilhelmus DiepstratenManaging priority queues and escalation in wireless communication systems
US20050018673 *20 juil. 200427 janv. 2005Dropps Frank R.Method and system for using extended fabric features with fibre channel switch elements
US20050036485 *11 août 200317 févr. 2005Eilers Fritz R.Network having switchover with no data loss
US20050036499 *26 juin 200317 févr. 2005Andiamo Systems, Inc., A Delaware CorporationFibre Channel Switch that enables end devices in different fabrics to communicate with one another while retaining their unique Fibre Channel Domain_IDs
US20050036763 *13 sept. 200417 févr. 2005Motoki KatoMethod of processing multiplexed program data using entry points and time units
US20050047334 *21 juin 20043 mars 2005Paul Harry V.Fibre channel switch
US20050073956 *10 août 20047 avr. 2005Moores John D.Network switching device ingress memory system
US20050076113 *12 sept. 20037 avr. 2005Finisar CorporationNetwork analysis sample management process
US20050088969 *21 juin 200428 avr. 2005Scott CarlsenPort congestion notification in a switch
US20050099970 *6 nov. 200312 mai 2005Halliday David J.Method and apparatus for mapping TDM payload data
US20050108444 *19 nov. 200319 mai 2005Flauaus Gary R.Method of detecting and monitoring fabric congestion
US20050111845 *3 juil. 200426 mai 2005Stephen NelsonApparatus, system and methods for modifying operating characteristics of optoelectronic devices
US20060013248 *18 mars 200519 janv. 2006Hamayun MujeebSwitching device interfaces
US20060034192 *13 juil. 200516 févr. 2006Broadcom CorporationApparatus and system for coupling and decoupling initiator devices to a network using an arbitrated loop without disrupting the network
US20060034302 *26 mai 200516 févr. 2006David PetersonInter-fabric routing
US20060047852 *1 oct. 20042 mars 2006Shishir ShahMethod and system for using boot servers in networks
US20060074927 *24 sept. 20046 avr. 2006Emc CorporationEnclosure configurable to perform in-band or out-of-band enclosure management
US20060107260 *21 déc. 200518 mai 2006Giovanni MottaEfficient generator of update packages for mobile devices
Référencé par
Brevet citant Date de dépôt Date de publication Déposant Titre
US20060286993 *14 juin 200621 déc. 2006Motorola, Inc.Throttling server communications in a communication network
US20080235370 *26 nov. 200725 sept. 2008Somansa Co., Ltd.Method and System for Controlling Network Traffic of P2P and Instant Messenger Softwares
CN102170663A *23 mai 201131 août 2011迈普通信技术股份有限公司3G (The Third Generation Telecommunication)-based method and equipment for guaranteeing service quality in real-time transmission service
Classifications
Classification aux États-Unis370/235
Classification internationaleG06F17/50, H04L12/56, H04L1/00
Classification coopérativeH04L47/32, H04L47/28, H04L47/12, H04L47/564, H04L47/50
Classification européenneH04L12/56K, H04L47/28, H04L47/12, H04L47/56B, H04L47/32