Abstract: A network status measuring system comprising a processor; a display circuitry configured to display a schematic overview of the network; a data traffic measuring circuitry configured to measure bit rate and latency on links of the network; and a graphic generating circuitry configured to generate a graphical representation of a bit rate and a latency measured on a particular link of the network by generating objects to be displayed at the particular link of the network in connection with the schematic overview of the network. The processor is further configured to calculate a number of the objects to be displayed at the particular link of the schematic overview of the network based on the bit rate measured on the particular link of the network. The display circuitry is further configured to display the generated objects at the particular link of the schematic overview of the network.

Abstract: A network status measuring system comprising a processor; a display circuitry configured to display a schematic overview of the network; a data traffic measuring circuitry configured to measure bit rate and latency on links of the network; and a graphic generating circuitry configured to generate a graphical representation of a bit rate and a latency measured on a particular link of the network by generating objects to be displayed at the particular link of the network in connection with the schematic overview of the network. The processor is further configured to calculate a number of the objects to be displayed at the particular link of the schematic overview of the network based on the bit rate measured on the particular link of the network. The display circuitry is further configured to display the generated objects at the particular link of the schematic overview of the network.

Abstract: A method for requesting and receiving a media stream within a networked system is provided. The networked system includes a client, a media service register (MSR) and a media service manager (MSM), arranged to communicate within a data network including networked computing devices. The method includes: the client sending to the MSR a media request for the media stream, the MSR including a register of identifiers and an address for accessing each active media stream generating services (MSGS); the MSR checking if the media request matches an active MSGS generating the requested media stream; when the media request does not match an active MSGS, sending an activation request to the MSR for a MSGS generating the requested media stream; the MSM sending an instruction to install the requested MSGS at at least one of the networked computing devices; and the client receiving the media stream generated by the installed MSGS.

Abstract: A method and apparatus of forming a generic overlay network for efficient information retrieval in a communications network, comprising receiving in a domain router a register request from a mobile communications apparatus, the register request including an identification of said mobile communications apparatus; looking-up an address to a next-hop router associated with the identification; sending the register request to the next-hop router; receiving a reply from the next-hop router; and if the reply includes an address to a home router, sending a reply to the mobile communications apparatus including the address of the home router, said reply initiating the establishment of a connection between the mobile communications apparatus and the home router.

Abstract: A method and apparatus of forming a generic overlay network for efficient information retrieval in a communications network, comprising receiving in a domain router a register request from a mobile communications apparatus, the register request including an identification of said mobile communications apparatus; looking-up an address to a next-hop router associated with the identification; sending the register request to the next-hop router; receiving a reply from the next-hop router; and if the reply includes an address to a home router, sending a reply to the mobile communications apparatus including the address of the home router, said reply initiating the establishment of a connection between the mobile communications apparatus and the home router.

Abstract: The invention relates to a method and an apparatus for distribution of bandwidth in a switch or router. More particularly, the invention relates to a scheduler and an associated algorithm for distributing bandwidth over data traffic directed to output ports and received in various traffic classes and flows. The switch has a switching fabric. Preferably, the bandwidth scheduler is located before output queues, and the method includes: receiving a stream of data from the switching fabric; subjecting the stream to a decision making algorithm in the bandwidth scheduler resulting in that the stream is forwarded or interrupted (accepted or rejected). Preferably, the stream of data includes identifiable data packets and the decision making algorithm in the bandwidth scheduler results in the data packet being accepted or rejected. The bandwidth scheduler may be located before the output queues leading to early discarding of packets and efficient use of output buffer memory.

Abstract: The invention relates to a method for flow control in a switch and a switch controlled thereby. In order to ensure that no or few packets are dropped in a switch because of a congested internal memory, pause frames or stop command messages are sent to upstream senders. When to send pause frames are determined by monitoring the buffer contents of the switch and estimating the total expected contents of the links between the senders and the switch. The pause frames are sent to the most offending senders, i.e. the senders causing the largest queues in the switch.

Abstract: The invention relates to a method and means for managing packet queues in switches. The switch has a shared memory split in a small internal memory and a large external memory. There is limited bandwidth to the external memory. The method comprises the steps of dividing a data stream incoming on the input ports intended for respective output ports into two parts, of which the first part is to be sent to an internal queue belonging to at least one output port and the second part is to be sent to the external memory. The incoming data stream may be identified as belonging to flow groups and the division of the data stream is then performed e.g. such that flow groups with a higher priority than a division threshold are sent to said internal queues in the first part, while flow groups with priority lower than said threshold are sent to the external memory in the second part.

Abstract: The invention relates to a scheduler method and device for handling output queues in a switch. The invention incorporates a number of co-operating techniques such as weighted and deficit driven round-robin and interleaving. The invention provides a scheduling method in a switch in which an input data stream is received and stored in a number of output queues, the method comprising the steps of: polling all queues in order; if the polled queue contains data, refilling a deficit value indicating a maximum amount of data that may be sent from this queue; if the deficit value permits, sending data, and decreasing the deficit value a corresponding amount for the polled queue, else disabling the queue; if any queue is permitted to send after all the queues have been polled, going to a local round, else start polling the first queue of the order again. The invention enables e.g. priority treatment of queues, fairness with regard to varying packet lengths and avoids burstiness.

Abstract: The invention relates to a scheduler method and device for handling output queues in a switch. The invention incorporates a number of co-operating techniques such as weighted and deficit driven round-robin and interleaving. The invention provides a scheduling method in a switch in which an input data stream is received and stored in a number of output queues, the method comprising the steps of: polling all queues in order; if the polled queue contains data, refilling a deficit value indicating a maximum amount of data that may be sent from this queue; if the deficit value permits, sending data, and decreasing the deficit value a corresponding amount for the polled queue, else disabling the queue; if any queue is permitted to send after all the queues have been polled, going to a local round, else start polling the first queue of the order again. The invention enables e.g. priority treatment of queues, fairness with regard to varying packet lengths and avoids burstiness.