Showing papers on "Weighted network published in 2001"

Network planning algorithms for the optical Internet based on the generalized MPLS architecture

Abstract: GMPLS is one of the most promising frameworks proposed for the next generation optical Internet, which supports multi-granularity of switching types including fiber-, waveband- and lambda-switching in the optical domain. We present some algorithms for solving the routing and wavelength/tunnel assignment (RWTA) problem based on the multi-granularity 4-tier switching architecture. We also propose novel network planning algorithms, the weighted network link state, and an enhancement to the fixed-alternative routing scheme, the heavy fixed alternative routing (H-FAR), to facilitate RWTA. We show that with the weighted network link state and H-FAR, the RWTA problem in the optical Internet with multi-granularity OXCs (MG-OXCs) can be solved efficiently, and the performance in terms of call blocking rate in a network with MG-OXCs is comparable with that in a lambda-switched network, which means the link utilization of tunnels is close to that of wavelength-switched channels.

Random identity management in scatternets

Abstract: In an ad-hoc network, network identities are assigned to each network. Using the network identities, a node can determine whether a neighbor node (not connected to the node) is a member of the same network as the node or whether a neighbor node (not connected to the node) is a member of the same network as another neighbor node (not connected to the node). When two networks merge the network identity of one of them is selected and broadcast throughout the part of the merged network that has to change its network identity. To avoid multiple networks which were once members of the same network, from having the same network identity, network identities are periodically reassigned and broadcast throughout each network. Further, when a connection between two nodes is broken the nodes can determine whether they are still members of the same network before initiating a change of network identity procedure.

Locating Information with Uncertainty in Fully Interconnected Networks with Applications to World Wide Web Information Retrieval

Abstract: In this paper we examine the problem of searching for some information item in the nodes of a fully interconnected computer network, where each node contains information relevant to some topic as well as links to other network nodes that also contain information, not necessarily related to locally kept information. These links are used to facilitate the Internet users and mobile software agents that try to locate specific pieces of information. However, the links do not necessarily point to nodes containing information of interest to the user or relevant to the aims of the mobile agent. Thus an element of uncertainty is introduced. For example, when an Internet user or some search agent lands on a particular network node, they see a set of links that point to information that is, supposedly, relevant to the current search. Therefore, we can assume that a link points to relevant information with some unknown probability p that, in general, is related to the number of nodes in the network (intuitively, as the network grows, this probability tends to zero since adding more nodes to the network renders some extant links less accurate or obsolete). Consequently, since there is uncertainty as to whether the links contained in a node’s Web page are correct or not, a search algorithm cannot rely on following the links systematically since it may end up spending too much time visiting nodes that contain irrelevant information. In this work, we will describe and analyze a search algorithm that is only allowed to transfer a fixed amount of memory along communication links as it visits the network nodes. The algorithm is, however, allowed to use one bit of memory at each node as an ‘already visited’ flag. In this way the algorithm has its memory distributed to the network nodes, avoiding overloading the network links as it moves from node to node searching for the information. We work on fully interconnected networks for simplicity reasons and, moreover, because according to some recent experimental evidence, such networks can be considered to be a good approximation of the current structure of the World Wide Web.

Method of visualizing state of network such as computer network, by displaying nodes and connections three-dimensionally

Abstract: The network comprises several nodes, with connections between them. At least part of the nodes (K) and connections (V) are displayed three-dimensionally. The nodes may be computers and the connections data transmission devices of a computer network. The nodes and/or connections can be allocated to picture elements indicating operating parameters of the respective nodes or connection. The user may use 3D glasses. An Independent claim is included for an apparatus for visualizing the state of a network.