Introduction. A major recent development in computer networking is the notion of Software-Defined Networking (SDN), which allows a network to customize its behaviors through centralized policies at a conceptually centralized network controller. In particular, Openflow [4] has made significant progress by establishing (1) flow tables as a standard data-plane abstraction for distributed switches,...

Advances in wireless sensor network (WSN) technology has provided the availability of small and low-cost sensor nodes with capability of sensing various types of physical and environmental conditions, data processing, and wireless communication. Variety of sensing capabilities results in profusion of application areas. However, the characteristics of wireless sensor networks require more effect...

This paper introduces a performance metric for use in characterizing message forwarding schemes of Massively Multiplayer Peer-to-Peer (P2P) based Networked Virtual Environments (NVE). Message forwarding, or routing, is the process by which peers send messages throughout an overlay. Different P2P NVE designs result in different message forwarding schemes; therefore, a metric is needed to evaluat...

Wireless sensor networks (WSNs) consist of sensor nodes that onward the sensed data in form of packets within the deployed network. Efficient packet forwarding is a key constraint in sensor networks and many demanding tasks in the network, together with redundancy estimation and sensor node localization depend principally on packet forwarding. Location based forwarding schemes have recently evo...

Expanding and forwarding are two graphic parameters related to the connectivity and the capacity of the network—the undirected graph with a given routing. Many large networks are composed from some existing smaller networks by using, in terms of graph theory, Cartesian product. The expanding and forwarding parameters of such large networks are associated strongly with that of the corresponding ...

Greedy Perimeter Stateless Routing (GPSR) is a Position-Based Routing Protocol for Wireless Networks that uses the Position of routers. GPSR makes greedy forwarding decision by using closest neighbor’s information of destination. In GPSR each node has the knowledge of its current physical position and also the neighbor node, this knowledge about node provides better routing. When a packet reach...

In MANETs, most network functions count on node cooperation. Forwarding packets of other nodes is a basic example of such cooperation. However, nodes may not be interested in forwarding the requested packets because of being selfishness or malice, which significantly degrades network performance. Therefore, in respect of node forwarding process, we propose a global punishment-based repeated-gam...

This paper proposes an isolation layer – a shim – between inter-domain routing and packet forwarding. The job of this layer is to coordinate between Autonomous Systems (AS’s) on when and how to modify the forwarding state to ensure interdomain routing loops do not cause forwarding loops. The benefits of a consistency layer are twofold. First, it prevents the creation of transient inter-domain f...

Popular ad hoc routing protocols such as DSDV and AODV use “predecessor” based forwarding, namely, the packet is forwarded to the predecessor that advertised the shortest path to destination during the last update. However, if the predecessor moves, the routing table entry becomes invalid and predecessor based forwarding fails! To overcome the stale forward table problem, in this paper we propo...

There are considerable reasons to wish to understand the relationship between the Internet’s control and data planes in times for stress. For example, the much publicized Internet worms—Code Red, Nimda and SQL Slammer—caused BGP storms, but there has been comparatively little study of whether the storms impacted network performance. In this paper, we study these worm events and see whether the ...