Class / Patent application number | Description | Number of patent applications / Date published |
370395400 | Assigning period of time for information to be transmitted (e.g., scheduling) | 44 |
20080219269 | METHOD AND DEVICE FOR SCHEDULING UNICAST AND MULTICAST TRAFFIC IN AN INTERCONNECTING FABRIC - A method for scheduling unicast and multicast traffic in an interconnecting fabric performs within each time slot the following steps. First a multicast cell scheduling ( | 09-11-2008 |
20080253378 | Delivery of Peak Performance Services - Systems for providing peak performance services include a peak performance service provider that provides peak performance services to enhance individuals' performances in sports, and at least one institution that purchases peak performance services from the peak performance service provider for individuals associated with the institution. The peak performance provider makes the peak performance services available to the individuals associated with the institution for a reduced fee or for free, and the peak performance provider provides peak performance services to individuals not associated with the institution for regular fees. Methods for providing peak performance services to enhance individuals' performances in sports include marketing the peak performance services to institutions, allowing an institution to purchase the peak performance services, and providing the peak performance services to an individual associated with the institution. | 10-16-2008 |
20080317037 | Method of Doing Business Over a Network By Transmission and Retransmission of Digital Information on a Network During Time Slots - The present invention is a method of doing business over a network that: receives a request for transmitting digital information after a start time and before an end time, determines the time required to transmit the digital information based on the number of packets in the information and the network speed, schedules a transmit time for the digital information, and accepts the digital information for transmission only if the time required to transmit is less than or equal to the difference between the transmit time and the end time. Pricing of the transmission can be determined by the priority of transmission, whether the information is transmitted the first time or rescheduled, and whether the user receives an acknowledgment. | 12-25-2008 |
20090010263 | MoCA frame bundling and frame bursting - A system and method are provided for aggregating Multimedia over Coax Alliance (MoCA) Medium Access Control (MAC) frames. The method sends a Multiframe Reservation Request (MRR) requesting a transmission time slot, and receives a grant in response to the MRR. Subsequent to sending the MRR, a plurality of MoCA MAC frames are accepted and assembled into a physical layer (PHY) burst packet that is transmitted in the granted time slot. A method is also provided for bundling client data packets into a MoCA MAC frame. The method sends a Bundledpacket Reservation Request (BRR) requesting a transmission time slot, and receives a grant in response to the BRR. Subsequent to sending the BRR, a plurality of client data packets are accepted and concatenated into a bundled MoCA MAC frame. The bundled MoCA MAC frame is transmitted in a PHY packet in the granted time slot. | 01-08-2009 |
20090016354 | INFORMATION PROCESSING APPARATUS AND INFORMATION PROCESSING SYSTEM - A compact, energy-saving and dynamic reconfigurable information processing apparatus achieving high-performance server services for application layers such as databases. Multiple PE matrices are formed in the dynamic reconfigurable processor of an apparatus containing that DRP. A scheduling unit is mounted in the packet I/O for deciding which PE matrix will process subsequent packets while one PE matrix is processing the first packet. When the second packet must be processed based on the same configuration information as the first packet, and the third packet must be processed based on configuration information different from the first packet, the scheduling unit makes the second packet wait until processing of the first packet is complete, and then gives priority to the third packet for processing in the second PE matrix. | 01-15-2009 |
20090022159 | Interactive Streaming Media Production Tool Using Communication Optimization - The invention provides interactive streaming mixed media production. A mixed media content creation tool includes a resource-computation element that computes the likely resource load to be imposed on a server, communication link, and client device, when sent by the server to the client and presented to a user at the client. The resource-computation element is responsive to amounts of communication bandwidth available using the communication link, presentation buffer space and computing resources available at the client, and other measures of resource load. The resource-computation element attempts to optimize resource usage by the mixed media content. The system also includes a presentation element that responds to the resource-computation element, and to user requests, and interactively presents measures of projected resource usage by the mixed media content, comparisons of that projected resource usage with available resources, and comparisons of that projected resource usage before and after optimization. | 01-22-2009 |
20090022160 | LOW-LATENCY SCHEDULING IN LARGE SWITCHES - Embodiments of a scheduler for a switch, where the switch is configured to couple input ports to output ports are described. During operation, the scheduler may determine a schedule based on a group of requests, associated with multiple data streams, that are received for the output ports of the switch, where the schedule matches input ports to output ports of the switch for a given data cell time. Note that the schedule may be determined using an arbitration technique during a time interval. Moreover, the scheduler may assign an additional request, which was received at a time that precedes a current time by less than the time interval, to a portion of the switch which is available in the schedule, thereby reducing a latency of the scheduler. | 01-22-2009 |
20090041025 | Router and Method for Refreshing Quality of Service Reservation - A method and an associated router in first administrative domain of a telecommunications network wherein the first administrative domain comprises a first end point associated to a reservation for a session transiting through the router between the first end point and a second end point in a second administrative domain. The router comprises a quality of service (QoS) reservation module maintaining a refresh timer associated with the reservation. The QoS reservation module is capable of, upon expiration of the refresh timer, sending a refresh reservation message toward the second end point on behalf of the first end point and, upon reception of a refresh confirmation message to the refresh reservation message, resetting the refresh timer without forwarding the refresh confirmation message toward the first end point. | 02-12-2009 |
20090059929 | SCHEDULING METHOD AND APPARATUS FOR HIGH SPEED VIDEO STREAM SERVICE IN COMMUNICATION SYSTEM - A scheduling method and apparatus for providing a high speed video stream service in a communication system are provided. The method includes receiving power information for ensuring a minimum data rate from a Radio Network Controller (RNC) through Radio Resource Control (RRC) signaling, receiving power information for a variable data rate from a Node B through scheduling, and performing a high speed video stream service on the basis of the power information received from the RNC and the Node B. | 03-05-2009 |
20090073985 | NETWORK CONNECTION DEVICE - A network connection device bridges a first network that uses a first packet delivery scheduling scheme and a second network that uses a different packet delivery scheduling scheme. The network connection device translates a request to communicate over the first network into a request to communicate over the second network, thus bridging the two networks. A negotiated packet delivery scheduling scheme permits endpoints to negotiate scheduled delivery times for packets, while an empirically determined packet delivery scheme tests various time interval locations in a network to determine favorable time locations for transmission. The two protocols are bridged by finding compatible overlaps between time interval locations in the two networks. This can provide error-free delivery with low jitter among packets. | 03-19-2009 |
20090073986 | Method, Apparatus and System for Guaranteed Packet Delivery Times in Asynchronous Networks - A method and apparatus for guaranteeing packet delivery times in an asynchronous network includes generating a global timing schedule to synchronize the communication between the terminals of a network and, in response to at least one trigger, transmitting and receiving data according to the generated global timing schedule. To optimize bandwidth utilization, more than one terminal may transmit data during a specific time slot of each time frame of the global timing schedule as long as no more than one terminal attempts to transmit data to a common other terminal. | 03-19-2009 |
20090092139 | Time sensitive scheduling data delivery network - Communications network based passive delivery of time sensitive scheduling data to an entity is described. Specific time sensitive scheduling data streams are created from aggregating time sensitive scheduling data from multiple originating organizations, affiliated groups of individuals, and individuals. Specific time sensitive scheduling data from originating organizations, affiliated groups of individuals, and individuals are sent via the passive delivery communications network. Specific time sensitive scheduling data streams aggregated from the multiple originating organizations, affiliated groups of individuals, and individuals are transmitted via the passive delivery communications network to the entity based on desirability and relevancy of time sensitive scheduling data. Specific time sensitive scheduling data from originating organizations, affiliated groups of individuals, and individuals are received via the passive delivery communications network. The passive delivery of time sensitive scheduling data to the entity is accommodated based upon derived interests of the entity via a time sensitive scheduling data receiving device. | 04-09-2009 |
20090103545 | METHODS, SYSTEMS, AND COMPUTER PROGRAM PRODUCTS FOR MANAGING QUALITY OF SERVICE IN A PASSIVE OPTICAL NETWORK - Quality of Service (QoS) can be managed in a network that uses time division access, such as a Passive Optical Network (PON), by supporting provisioning of at least two scheduling precedence levels in the PON, none of the at least two precedence levels being associated with a fixed or assured bandwidth traffic type in the PON, but having a bandwidth precedence and/or proportion relationship to each other. | 04-23-2009 |
20090135832 | PIPELINE SCHEDULER WITH FAIRNESS AND MINIMUM BANDWIDTH GUARANTEE - A pipeline scheduler provides a minimum bandwidth guarantee by transporting cells from an input port to an output port in a two-phased approach. Cells that conform to a minimum cell rate (MCR) are selected from queues at the input port and arranged into supercells for transport to the output port, followed by nonconforming cells, to guarantee fairness by using scheduling modules to build the supercells first for conforming cells, and then for nonconforming cells. Reservation vectors are used to permit the same time slot of the next frame to be reserved by a first queue, and the same time slot of the following time frame to be held for reservation by a second queue, to ensure equal time slot access by the first and second queues over successive time frames. | 05-28-2009 |
20090147790 | PACKET TRANSMISSION SCHEDULING METHOD IN WIRELESS NETWORK AND PACKET TRANSMISSION METHOD USING THE SAME - Provided are a packet transmission scheduling method in a wireless network and a packet transmission method using the same. The packet transmission scheduling method, includes storing location information and a path loss exponent of each node on a multiplexing path; calculating a Signal-to-Interference and Noise Ratio (SINR) between nodes on a predetermined path based on the stored location information; when the calculated SINR exceeds a threshold, forming the paths as a path table; and scheduling packet transmission based on the formed path table. | 06-11-2009 |
20090154467 | Method And System For Asymmetric Transition Handshake In An Energy Efficient Ethernet Network - Multi-rate link partners coupled via an Ethernet link may be configured to implement an asymmetric handshake wherein a change of rate in a first direction may be independent of delay that may occur when implementing a change of rate in a second direction. A rate change may be delayed based on a known time delay for configuring a link partner. A change in rate in the first direction may not be delayed by data transmissions in the second direction. Rate changes may be managed via physical layer control characters, physical layer out of band channel and/or packets generated from a layer above the physical layer. Control characters may be transmitted during inter-packet gaps and/or within a packet stream. Data rates may be transitioned from a full rate, intermediate rate or a rate of zero to a full data rate, intermediate rate or a rate of zero. | 06-18-2009 |
20090168782 | High-Speed Scheduling Apparatus for a Switching Node - A scheduling apparatus for a switch includes multiple schedulers which are assigned in a variety of ways to non-intersecting control domains for establishing connections through the switch. The control domains are defined by spatial and temporal aspects. The control domains may be dynamically selected and assigned to schedulers in a manner that achieves a high throughput gain. Control domains may be considered in a cyclic and/or a pipeline discipline for accommodating connection requests. The invention enables the realization of a highly scalable controller of a switching node of fine granularity that scales to capacities of the order of hundreds of terabits per second. | 07-02-2009 |
20090207846 | PROPAGATION OF MINIMUM GUARANTEED SCHEDULING RATES AMONG SCHEDULING LAYERS IN A HIERARCHICAL SCHEDULE - A hierarchy of schedules propagate minimum guaranteed scheduling rates among scheduling layers in a hierarchical schedule. The minimum guaranteed scheduling rate for a parent schedule entry is typically based on the summation of the minimum guaranteed scheduling rates of its immediate child schedule entries. This propagation of minimum rate scheduling guarantees for a class of traffic can be dynamic (e.g., based on the active traffic for this class of traffic, active services for this class of traffic), or statically configured. One embodiment also includes multiple scheduling lanes for scheduling items, such as, but not limited to packets or indications thereof, such that different categories of traffic (e.g., propagated minimum guaranteed scheduling rate, non-propagated minimum guaranteed scheduling rate, high priority, excess rate, etc.) of scheduled items can be propagated through the hierarchy of schedules accordingly without being blocked behind a lower priority or different type of traffic. | 08-20-2009 |
20090279549 | Hitless software upgrades - Disclosed is a technique for facilitating software upgrade for a switching system comprising a first management processor and a second management processor and a set of one or more line processors, the techniques comprising receiving a signal to perform a software upgrade for a line processor from the set of line processors, and performing a software upgrade for the line processor without substantially affecting packet switching performed by the switching system. | 11-12-2009 |
20090279550 | TUNNELING FOR EFFICIENT NETWORK TRAFFIC MANAGEMENT - Data traffic is scheduled by, in a first scheduler, selecting a source of traffic from a plurality of sources of traffic, each source being associated with a second scheduler, in a second scheduler associated with the selected source of traffic, selecting a type of traffic from a plurality of types of traffic within the source selected by the first scheduler, and transmitting data of the selected type and source. Identifying and creating tunnels between endpoints in a network for optimum data traffic method and apparatus. | 11-12-2009 |
20090323695 | TWO-DIMENSIONAL PIPELINED SCHEDULING TECHNIQUE - A scheduler allowing high-speed scheduling scalable with the number of input and output ports of a crosspoint switch and suppressed unfairness among inputs is disclosed. The scheduler includes an M×M matrix of scheduling modules, each of which schedules packet forwarding connections from a corresponding input group of input ports to selected ones of a corresponding output group of output ports based on reservation information. A diagonal modulo pattern is used to determine a set of M scheduling modules to avoid coming into collision with each other. Each determined scheduling module performs reservation of packet forwarding connections based on current reservation information and transfers updated reservation information in row and column directions of the M×M matrix. | 12-31-2009 |
20100172357 | MINIMIZING EFFECTS OF PACKET DELAY VARIATION IN TIME-DIVISION MULTIPLEXING PSEUDOWIRE SERVICES - Various exemplary embodiments relate to a method and related node for outputting packets from a playout buffer in a node in a packet-switched network including one or more of the following: configuring a Time-Division Multiplexing (TDM) pseudowire terminating at the node; receiving a plurality of fixed-length packets transmitted over the TDM pseudowire; adding the plurality of fixed-length packets to the playout buffer such that the playout buffer reaches a current fill level; inserting at least one dummy packet into the playout buffer, wherein a total length of the at least one dummy packet is equal to a target fill level of the playout buffer minus the current fill level and the target fill level represents a minimum fill level required before output of packets from the playout buffer; and outputting the plurality of fixed-length packets and the at least one dummy packet from the playout buffer. | 07-08-2010 |
20110096783 | FLEXIBLE OFDM/OFDMA FRAME STRUCTURE FOR COMMUNICATION SYSTEMS - A flexible OFDM/OFDMA frame structure technology for communication systems is disclosed. The OFDM frame structure technology comprises a configurable-length frame which contains a variable length subframe structure to effectively utilize OFDM bandwidth. Furthermore, the frame structure facilitates spectrum sharing between multiple communication systems. | 04-28-2011 |
20110216773 | WORK-CONSERVING PACKET SCHEDULING IN NETWORK DEVICES - In general, techniques are described for performing work conserving packet scheduling in network devices. For example, a network device comprising queues that store packets and a control unit may implement these techniques. The control unit stores data defining hierarchically-ordered nodes, which include leaf nodes from which one or more of the queues depend. The control unit executes first and second dequeue operations concurrently to traverse the hierarchically-ordered nodes and schedule processing of packets stored to the queues. During execution, the first dequeue operation masks at least one of the selected ones of the leaf nodes from which one of the queues depends based on scheduling data stored by the control unit. The scheduling data indicates valid child node counts in some instances. The masking occurs to exclude the node from consideration by the second dequeue operation concurrently executing with the first dequeue operation, which may preserve work in certain instances. | 09-08-2011 |
20120281704 | METHODS AND APPARATUS FOR ISOCHRONOUS DATA DELIVERY WITHIN A NETWORK - Methods and apparatus for efficiently servicing isochronous streams (such as media data streams) associated with a network. In one embodiment, an Isochronous Cycle Manager (ICM), receives multiple independent streams of packets that include isochronous packets arriving according to different time bases (e.g., where each stream has a different time base). The packets are sorted by the ICM into a buffering mechanism according to their required presentation time. Additionally the ICM calculates a launch time for each packet. The NIC transmits the packets from the queue according to an access scheme, such as a time division multiplexed (TDM) scheme where each of a plurality of cycles is subdivided into time slots. During appropriate time slots, the NIC transmits the packets in chronological order, as read out of the buffering mechanism. | 11-08-2012 |
20130136137 | APPARATUS AND METHOD FOR DATA TRANSMISSION - Local concentration of accessing loads on a data buffer during data cell reading is reduced. Also, by providing sufficient time for a data cell reading operation with respect to data cell transmission timing, transmission rate fluctuation of CBR data cells in a transmitting side is reduced. When transmission of a new data stream is added, controller in a cell control unit refers to a transmitted data cell count of VC information processed through a slot immediately before. The controller determines whether a data cell transmitted through the slot immediately before is a head portion of a packet or not. If the data cell transmitted through the slot immediately before is the head portion of the packet, the controller only adds the VC information of the data stream to a shaper link list, and withholds transmission of the data cell. On the other hand, if the data cell transmitted through the slot immediately before is not the head portion of the packet, then the controller adds the VC information of the data stream, and transmits the data cell. | 05-30-2013 |
20130322452 | METHODS AND SYSTEMS FOR PROVISIONING LOGICAL CIRCUITS FOR INTERMITTENT USE IN A DATA NETWORK - A customer order is received for routing data for a time period. A logical circuit is provisioned for routing the data during the time period. The logical circuit is provisioned through a first LATA, an IEC, and a second LATA. The logical circuit includes first variable communication paths that automatically reroute from a first set of switches to a second set of switches of the first LATA while maintaining the logical circuit, second variable communication paths to route the data through the second LATA, and fixed communication paths to route the data between the first LATA, the second LATA, and the IEC. The second set of switches forms a route associated with the first variable communication paths that is not predefined and that is dynamically defined at a time of automatic rerouting. The logical circuit is added to a deletion batch for deletion after the time period. | 12-05-2013 |
20140192816 | METHODS AND SYSTEMS FOR PROVISIONING LOGICAL CIRCUITS FOR INTERMITTENT USE IN A DATA NETWORK - A customer order is received for routing data for a time period. A logical circuit is provisioned through a first LATA, an IEC, and a second LATA. The logical circuit includes first variable communication paths that automatically reroute from a first set of switches to a second set of switches of the first LATA while maintaining the logical circuit, second variable communication paths to route the data through the second LATA, and fixed communication paths to route the data between the first LATA, the second LATA, and the IEC. The second set of switches forms a route associated with the first variable communication paths that is not predefined and that is dynamically defined at a time of automatic rerouting. The logical circuit is disconnected following the end of the time period. | 07-10-2014 |
370395410 | Based on bandwidth allocation (e.g., Weighted Round Robin) | 7 |
20080232377 | COMMUNICATION DEVICE AND METHOD FOR CONTROLLING THE OUTPUT OF PACKETS - An apparatus including a holding portion temporarily holding packets for each individual quality class; a counter counting the amount of data of packets output from the holding portion for each individual quality class; a comparison portion comparing count values of the counter for individual quality classes with threshold values which are threshold values for the quality classes, respectively, the ratio of the threshold values for the quality classes being coincident with the weighting ratio between the quality classes; an output portion outputting packets held in the holding portion based on results of comparisons made by the comparison portion; and a control portion which, according to the results of the comparisons, subtracts values corresponding to the threshold values for the quality classes from the count values of the counter for the individual quality classes. | 09-25-2008 |
20080298372 | STRUCTURE AND METHOD FOR SCHEDULER PIPELINE DESIGN FOR HIERARCHICAL LINK SHARING - A pipeline configuration is described for use in network traffic management for the hardware scheduling of events arranged in a hierarchical linkage. The configuration reduces costs by minimizing the use of external SRAM memory devices. This results in some external memory devices being shared by different types of control blocks, such as flow queue control blocks, frame control blocks and hierarchy control blocks. Both SRAM and DRAM memory devices are used, depending on the content of the control block (Read-Modify-Write or ‘read’ only) at enqueue and dequeue, or Read-Modify-Write solely at dequeue. The scheduler utilizes time-based calendars and weighted fair queueing calendars in the egress calendar design. Control blocks that are accessed infrequently are stored in DRAM memory while those accessed frequently are stored in SRAM. | 12-04-2008 |
20090028161 | NETWORK TRAFFIC MANAGEMENT - One aspect of the specification is the use of a virtual entity to represent the bandwidth bottleneck point in a network. Areas of the network where bandwidth does not need to be managed can be modeled as zones. This model enables more flexibility as the virtual bottleneck point can represent a collection of components (e.g. routers), or a portion of a real component (e.g. a router could be represented by multiple virtual bottleneck points with different purposes.) This model can also allow a user to decide which points in their network should be managed, independent of the underlying data network infrastructure. These virtual entities can be placed between areas of the network, and configured with specific policies. Bandwidth usage across these virtual entities can be tracked and compared to the configured bandwidth limit available to the application at each bottleneck point. When the bandwidth available at the bottleneck point is fully utilized, additional calls can be blocked or rerouted. Policies can be applied to permit certain calls to proceed despite the fact that bandwidth is fully utilized, or to block certain calls when bandwidth usage is approaching the maximum level. Bandwidth management can be distributed or centralized with information shared throughout a distributed network. | 01-29-2009 |
20090285219 | DEFICIT AND GROUP ROUND ROBIN SCHEDULING FOR EFFICIENT NETWORK TRAFFIC MANAGEMENT - Data traffic is scheduled by, in a first scheduler, selecting a source of traffic from a plurality of sources of traffic, each source being associated with a second scheduler, in a second scheduler associated with the selected source of traffic, selecting a type of traffic from a plurality of types of traffic within the source selected by the first scheduler, and transmitting data of the selected type and source. Scheduling data traffic apparatus and method using deficit and group ratio round robin budgeting. | 11-19-2009 |
20100172358 | Quality of Service Support for A/V Streams - An access control mechanism in a network connecting one or more sink devices to a server providing audio/visual data (A/V) in streams. As a sink device requests access, the server measures available bandwidth to the sink device. If the measurement of available bandwidth is completed before the sink device requests a stream of audio/visual data, the measured available bandwidth is used to set transmission parameters of the data stream in accordance with a Quality of Service (QoS) policy. If the measurement is not completed when the data stream is requested, the data stream is nonetheless transmitted. In this scenario, the data stream may be transmitted using parameters computed using a cached measurement of the available bandwidth to the sink device. If no cached measurement is available, the data stream is transmitted with a low priority until a measurement can be made. Once the measurement is available, the transmission parameters of the data stream are re-set. With this access control mechanism, A/V streams may be provided with low latency but with transmission parameters accurately set in accordance with the QoS policy. | 07-08-2010 |
20110149977 | AVOIDING UNFAIR ADVANTAGE IN WEIGHTED ROUND ROBIN (WRR) SCHEDULING - A network device includes multiple queues to store packets to be scheduled, and a weighted round-robin (WRR) scheduler. The WRR scheduler performs a first WRR scheduling iteration including processing of at least one packet from a particular queue of the multiple queues, identifies the particular queue as an empty queue during the performing of the first WRR scheduling iteration, identifies the particular queue as a non-empty queue after the identifying the particular queue as the empty queue, and performs a second WRR scheduling iteration including processing of only one packet of a group of packets from the particular queue of the multiple queues. | 06-23-2011 |
20120140773 | WRR SCHEDULER CONFIGURATION FOR OPTIMIZED LATENCY, BUFFER UTILIZATION - A method includes receiving network information for calculating weighted round-robin (WRR) weights, calculating WRR weights associated with queues based on the network information, and determining whether a highest common factor (HCF) exists in relation to the calculated WRR weights. The method further includes reducing the calculated WRR weights in accordance with the HCF, when it is determined that the HCF exists, and performing a WRR scheduling of packets, stored in the queues, based on the reduced WRR weights. | 06-07-2012 |
370395420 | Based on priority | 9 |
20080317041 | Method for Scheduling Atm Cells and a Device Having Atm Cell Scheduling Capabilities - A method for scheduling a transmission of ATM cells, the method includes: receiving an indication that a scheduling session should starts; and repeating the stages of: selecting a channel representative queue out of multiple queues that are associated with different quality of service traffic threads that belong to that channel; scheduling a transmission of frames from channel representative queues and from single queue channels; wherein the scheduling comprises processing a scheduling table that comprises multiple sets of entries, wherein each set of entries is associated with a different transmission priority level, and wherein at least one set of entries comprises a link to a transmission parameter table that is associated with a channel representative queue. | 12-25-2008 |
20090168785 | MODELING NON-DETERMINISTIC PRIORITY QUEUES FOR EFFICIENT MODEL CHECKING - A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues. | 07-02-2009 |
20090285220 | STREAM REGULATION IN A PEER TO PEER NETWORK - Techniques for regulating streams in a Peer-to-Peer (P2P) network are provided. By establishing a priority of a stream, certain users may have some level of assurance that their stream will be received by other peers. The priority may be established based on a variety of parameters including, for example, an identification of the user, a communications channel used for a multicast session, and/or a role of the user. | 11-19-2009 |
20090323697 | DATA PAYLOAD TRANSMISSION VIA CONTROL PLANE SIGNALING - A system for implementing a communication transports in a configuration that may utilize control plane resources for the conveyance of data. A communication protocol may be originally designed to support planned data conveyance at a data plane. This strategy may improve quality of service for the transport, but may impact the execution speed of communication due to the required overhead involved in scheduling. In view of this limitation, messages that are sensitive to delay may be negatively impacted by scheduling steps occurring in mediums such as described above. Execution speed may be increased by routing certain payloads to the control plane for transmission in a beacon signal, which avoids the overhead inherent in the data plane. | 12-31-2009 |
20100183015 | SEMICONDUCTOR INTEGRATED CIRCUIT AND FILTER CONTROL METHOD - A semiconductor integrated circuit of the invention comprises a plurality of cores, and an interconnecting network including adaptors connected to each of the cores and a plurality of routers connecting the adaptors to communicate therebetween. Transmission side adaptors store first delivery information, and control delivery of the request signal to be received from the first core in accordance with the first delivery information. Reception side adaptors store second delivery information, and control delivery of the request signal to be received through the interconnecting network to the second core in accordance with the second delivery information. The first delivery information and the second delivery information are hierarchically set. | 07-22-2010 |
20130010798 | TRANSMISSION PRIORITY PATHS IN MESH NETWORKS - In one embodiment, a node may determine a trigger for establishing transmission priority on a path through a shared-media communication network for priority traffic to a particular node. As such, the node may generate a path clear message (PCM) that would instruct one or more receiving nodes along the path to suspend transmission for traffic other than the priority traffic for a specified duration, and also to transmit a local non-repeated distributed message to one or more neighbor nodes of each respective receiving node, the local non-repeated distributed message to instruct the neighbor nodes to suspend transmission for the specified duration. After transmitting the PCM along the path to the particular node to establish the transmission priority for the priority traffic along the path through the shared-media network, the priority traffic may be transmitted to the particular node along the path during the transmission priority. | 01-10-2013 |
20130044756 | System for TDM Data Transport Over Ethernet Interfaces - A network component comprising a processor configured to implement a method comprising promoting the communication of a frame of octet-sized timeslots, wherein the timeslots are configured to carry a plurality of data types. Also disclosed is a method comprising communicating a high priority data and a low priority data in a frame comprising a plurality of octet-sized timeslots, wherein each timeslot is assigned to the high priority data or the low priority data, wherein the high priority data is provided in the timeslots assigned to the high priority data, and wherein the low priority data is provided in the timeslots assigned to the low priority data. Also disclosed is a network component comprising a processor configured to implement a method comprising recognizing the reception of a plurality of data streams each having a priority, and promoting the multiplexing of the data streams based on the priority of each data stream. | 02-21-2013 |
20150304228 | METHOD AND SYSTEM FOR PRIORITISING TRAFFIC FLOWS - A method for prioritising traffic within the IP protocol of a data communications network, the method comprising detecting an activity belonging to a pre-defined group of high priority activities; identifying network elements associated with the high priority activity; and prioritising traffic from the network elements associated with the high priority activity. Also disclosed is a management system arranged to implement the above-described method, and a data communications network comprising said management system. | 10-22-2015 |
20150365340 | PACKET TRANSMISSION APPARATUS AND PACKET RECEPTION APPARATUS - A packet transmission apparatus includes: while data included in a preceding packet having a low priority is being transmitted without fragmentation, when time has come to transmit a succeeding packet having a priority higher than that of the preceding packet, one or more processors configured to perform conversion processing for dividing the preceding packet into a plurality of fragment packets while the data is being transmitted; and a transmission unit configured to transmit the succeeding packet between a first fragment packet, and a second fragment packet among the plurality of fragment packets. | 12-17-2015 |