to be in such the way that it'll use the remaining battery power in associate economical thanks to increase the life time of the network. In this paper we proposed Edge Node Calculations (ENC) for optimized link state routing protocol (OLSR) using Potential calculations in MANET. This concept provides better

not only on input traffic parameters but also on design parameters of the OBS network. The properties of this traffic will dictate how it is affected by transmision over the OBS core and thus the user-perceived quality of the video stream that is delivered at the edge of the network. This paper evaluates

This paper presents Tstat [1], a new tool for the collection and statistical analysis of TCP/IP traffic, able to infer TCP connection status from trace data. Discussing its use, we present some of the performance figures that can be obtained and the insight that such figures can give on TCP/IP protocols and the Internet.

In this paper, the performance model for a lossless OBS edge node is built with respect to the queueing performance of the transmission buer. In contrast to the shaping eect of the burst assembly in the buerless edge node, in a lossless edge node the \burstifying " eect of the assembly is more

quantified with the computational evidence derived from a distributional analysis of corpus data. Specifically, the proposed measure is a combined approach that inherits the edge-based approach of the edge counting scheme, which is then enhanced by the node-based approach of the information content

We consider the problem of routing traffic to optimize the performance of a congested network. We are given a network, a rate of traffic between each pair of nodes, and a latency function for each edge specifying the time needed to traverse the edge given its congestion; the objective is to route

where each node captures an abstraction such as, e.g., goal, action, agent, entity, or event, and where the edges capture semantic links between such abstractions. Well-formedness properties on nodes and links constrain their instances - that is, elements of requirements models. Requirements acquisition

edges correspond to feasible paths between these configurations. These paths are computed using a simple and fast local planner. In the query phase, any given start and goal configurations of the robot are connected to two nodes of the roadmap; the roadmap is then searched for a path joining these two

Coding strategies that exploit node cooperation are developed for relay networks. Two basic schemes are studied: the relays decode-and-forward the source message to the destination, or they compress-and-forward their channel outputs to the destination. The decode-and-forward scheme is a variant

, and we observe some surprising phenomena. First, most of these graphs densify over time, with the number of edges growing superlinearly in the number of nodes. Second, the average distance between nodes often shrinks over time, in contrast to the conventional wisdom that such distance parameters should