The paper describes new method for routing classification of the packets in the networks with static routing. Static
routing is mostly used in the stable and well-controlled networks, which are sensitive to the additional complexity
introduced by the dynamic routing schemes. For example, it is a straightforward choice for the embedded networks on
terminal. The available solutions for the static routing require full-size or longest prefix-based aggregated routing table,
which is inefficient taking into account static nature of the performed routing decisions. The standard approach is based
on the full implementation of the route lookup procedure, which for every packet performs search for the longest prefix
match in the routing table. As a result, it increases implementation complexity of the network end points and switches,
requires high speed memory for storing routing tables, and leads to an additional processing delay and energy
consumption for each transmitted packet.
This work is based on the observation that clever planning of the networks with static routing allows applying new
principles of route lookup. As a consequence it allows significantly reduce complexity of the packet classification and
forwarding procedures and minimize amount of consumed resources. Complexity reduction of the packets classification
and forwarding procedures allows simplifying implementation of the networking part of the protocol stack, which results
in reduction of the device components cost, decrease of the power and memory consumption, as well as the packet
The paper contains a description of the proposed route classification method and discusses its applicability for
broad range of networks with static routing.
Delivering proper management into the flat structured mobile communities is crucial for improving users experience and increase applications diversity in mobile networks. The available P2P applications do application-centric management, but it cannot replace network-wide management, especially when a number of different applications are used simultaneously in the network. The network-wide management is the key element required for a smooth transition from standalone P2P applications to the self-organizing mobile communities that maintain various services with quality and security guaranties. The classical centralized network management solutions are not applicable in the flat structured mobile communities due to the decentralized nature and high mobility of the underlying networks. Also the basic network management tasks have to be revised taking into account specialties of the flat structured mobile communities. The network performance management becomes more dependent on the current nodes' context, which also requires extension of the configuration management functionality. The fault management has to take into account high mobility of the network nodes. The performance and accounting managements are mainly targeted in maintain an efficient and fair access to the resources within the community, however they also allow unbalanced resource use of the nodes that explicitly permit it, e.g. as a voluntary donation to the community or due to the profession (commercial) reasons. The security management must implement the new trust models, which are based on the community feedback, professional authorization, and a mix of both. For fulfilling these and another specialties of the flat structured mobile communities, a new network management solution is demanded. The paper presents a distributed network management solution for flat structured mobile communities. Also the paper points out possible network management roles for the different parties (e.g. operators, service providing hubs/super nodes, etc.) involved in a service providing chain.