Rather than using special-purpose hardware routers, software routers enable routing on commodity platforms. However, even with faster processors and multi-core platforms, the performance of software routers on commodity platforms today does not scale with high speed. We identify the limitations of commodity platforms by comparing them to high-end routers. In high end routers, each line card has...

This paper describes an implementation of the class based queueing (CBQ) mechanisms proposed by Sally Floyd and Van Jacobson 1] 2] to provide real time policies for packet forwarding. CBQ allows the traac ows sharing a data link to be guaranteed a share of the bandwidth when the link is congested, yet allows exible sharing of the unused bandwidth when the link is unloaded. In addition, CBQ prov...

This thesis addresses quality issues in Internet Protocol (IP) packet forwarding. In IP networks, queue mechanisms and scheduling can be used to construct multiple forwarding behaviors. Thereby, both relative and independent services can be offered to Internet users. Independent services offer forwarding qualities known beforehand. Users are assumed to explicitly request admission to an indepen...

We present m-limited forwarding, a technique to reduce the cost of disseminating information in a power-constrained environment by limiting the cardinality of the subset of nodes which retransmit a packet. We show how this technique can be used to improve the performance of ad hoc routing protocols. m-AODV applies m-limited forwarding to the AODV routing protocol, and is used for networks with ...

In this letter, we discuss a forwarding method for maximizing network lifetime, which combines multi-hop forwarding and direct forwarding with a direct/multi-hop forwarding ratio of each sensor node. The direct forwarding ratio refers to the forwarding amount ratio of sensor nodes’ own data directly towards a sink node in one packet/instance data generation rate. We tackle an optimization probl...

A tool built from primarily public domain software components is presented to evaluate the performance of packet forwarding devices used in modern TCP/IP based computer networks. The tool makes possible to specify complex traffic patterns based on a high level definition, then to execute the designed measurements and collect data, to process the results of measurements, and finally to generate ...

Efficient IPv6 packet forwarding still is a major bottleneck in todays networks. Especially in the internet core we face very large routing tables and a high number of high-speed links. In addition, economical restrictions exist in terms of manufacturing and operation costs of routers. Resources are limited and network providers reluctantly change their infrastructure. On the other hand the num...

In this paper, we present a link-layer packet forwarding scheme to reduce packet losses during a handoff in IEEE 802.11 WLAN. Through a novel scheme utilizing buffer and image queues in the device driver, the scheme is able to recover most packets that would otherwise be lost during the handoff, including those held in the network interface card. Our experimental results from a test-bed show th...

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. A well-known instance is with unreliable links, where the probability that at least one node out of n receives a packet increases with n. This observation was previously exploited, by modifying single-path routing to assign to each node group of candidate next-hops for a par...

Multihop ad hoc networks were designed assuming trustworthiness and cooperation between all participating nodes; nodes in an ad-hoc network rely on one another in packet forwarding, detecting routes, etc. Thus, the performance of an ad hoc network degrades considerably with the presence of misbehaving nodes. Nodes’ misbehaviour includes, but is not limited to, refusing to relay data packets, co...