Abstract: A security method in a network environment comprising a corporate network populated with one or more devices connectable to the corporate network over a first communication interface and connectable to other devices over a device-to-device communication interface distinct from the first communication interface, each device comprising a node in the network, one or more of the devices comprising a mobile device and one or more of the devices comprising an intentionally vulnerable node in the network, the method comprising: logging exchanged messages across the interfaces at the intentionally vulnerable node; monitoring the interfaces; identifying a candidate malicious message; tracking back from messages, including from a candidate malicious message; determining the paths used by the messages; determining the source and/or destination of a path to localise the candidate malicious message source.

Abstract: A scheduler which uses a GPS simulation to determine an order in which to service entities uses a novel dynamic data structure with a sophisticated, but simple, pointer update mechanism. Preferred embodiments of the scheduler perform a fixed amount of work per scheduling event. A scheduling event can be either computing a new virtual finish timestamp upon a new arrival to the scheduler, or determining which entities are to leave the GPS system because their finish timestamp has expired. The scheduler may be used in packet scheduling in a packet handling device, such as a router, scheduling access of software processes to a computer processor or the like. The scheduler may implement weighted fair queuing (WFQ).

Abstract: A method for scheduling transmission of remote and local data packets over a shared medium comprises providing a scheduler and generating virtual packets corresponding to the remote data packets. The virtual data packets are scheduled in the scheduler together with local data packets. When the scheduler indicates that a remote packet should be transmitted over the shared medium the method assigns a transmission opportunity to the remote station. The scheduler may comprise a general processor sharing (GPS)-based scheduler.

Abstract: A scheduler which uses a GPS simulation to determine an order in which to service entities uses a novel dynamic data structure with a sophisticated, but simple, pointer update mechanism. Preferred embodiments of the scheduler perform a fixed amount of work per scheduling event. A scheduling event can be either computing a new virtual finish timestamp upon a new arrival to the scheduler, or determining which entities are to leave the GPS system because their finish timestamp has expired. The scheduler may be used in packet scheduling in a packet handling device, such as a router, scheduling access of software processes to a computer processor or the like.

Abstract: A scheduler which uses a GPS simulation to determine an order in which to service entities uses a novel dynamic data structure with a sophisticated, but simple, pointer update mechanism. Preferred embodiments of the scheduler perform a fixed amount of work per scheduling event. A scheduling event can be either computing a new virtual finish timestamp upon a new arrival to the scheduler, or determining which entities are to leave the GPS system because their finish timestamp has expired. The scheduler may be used in packet scheduling in a packet handling device, such as a router, scheduling access of software processes to a computer processor or the like.

Abstract: A scheduler which uses a GPS simulation to determine an order in which to service entities uses a novel dynamic data structure with a sophisticated, but simple, pointer update mechanism. Preferred embodiments of the scheduler perform a fixed amount of work per scheduling event. A scheduling event can be either computing a new virtual finish timestamp upon a new arrival to the scheduler, or determining which entities are to leave the GPS system because their finish timestamp has expired. The scheduler may be used in packet scheduling in a packet handling device, such as a router, scheduling access of software processes to a computer processor or the like.

Abstract: A bus-based apparatus and method for synchronous priority arbitration between modules in a computer system. The modules in the system have priority codes selected from the set D(r,K+1) of r-digit radix K+1 numbers. Each stage in the arbitration method includes the steps of writing to a bus, performing a prefix-OR operation on the bus, and reading from the bus. Arbitration is completed in, at most, r units of time. The design of the system can be optimized for speed, logic per module, and/or the number of modules connected to any bus line. Both arbitration time and arbitration logic may be decreased by increasing the bus width. The number of modules can be increased indefinitely by increasing only bus-width, while keeping arbitration time and arbitration logic fixed. The arbitration bus is a wired-OR bus.