Search results

This paper aims to discuss problems, requirements and current trends for deploying group communication in real‐world scenarios from an integrated perspective.

The Hybrid Shared Tree is introduced – a new architecture and routing approach to combine network – and subnetwork‐layer multicast services in end‐system domains with transparent, structured overlays on the inter‐domain level.

The paper finds that The Hybrid Shared Tree solution is highly scalable and robust and offers provider‐oriented features to stimulate deployment.

A straightforward perspective is indicated in the paper for a mobility‐agnostic routing layer for future use.

In a mobile ad hoc network (MANET), design of energy‐efficient routing schemes is essential for prolonging the network lifetime. The purpose of this paper is to show that one way to achieve energy efficiency in routing is to utilize location information, which becomes practical due to the recent increasing availability of low‐cost and reliable positioning devices.

This paper proposes an eight‐direction forwarding virtual grid aided (VGA) routing scheme that uses location information to save energy. As a grid‐based scheme, VGA divides the whole network area into virtual grids.

By using eight‐direction forwarding, the proposed VGA scheme outperforms the previous four‐direction forwarding geographical adaptive fidelity (GAF) protocol. The proposed VGA scheme is motivated by the fact that, in the GAF protocol, forwarding to the four diagonal neighboring grids cannot be done in one single hop, although most nodes in these grids can hear the signal.

Theoretical analysis shows the eight‐direction forwarding protocol performs better than the four‐direction one unless the forwarding direction has an angle of less than 15^○ with the horizontal or vertical grid axis. Simulation supports the fact that the eight‐direction forwarding VGA scheme has better energy performance than the four‐direction forwarding GAF scheme without sacrificing any routing performance.

The purpose of this paper is to propose a novel resource management strategy, which needs no special frameworks and directory servers.

The key idea is to piggyback a little extra packet header on the normal routing message by resource providers randomly. The clients can obtain the resource information gradually and need no dedicated resource queries.

The results of simulation confirm the good performance of our algorithms in different situations in terms of query latency and power consumption.

A novel resource management strategy, which needs no special frameworks and directory servers. The approach can be used in many current routing protocols. The quality of service issue is also considered for resource discovery algorithm and broadcasting method.

Recent wireless communication and electronics technology has enabled the development of low‐cost, low‐power, and multi‐functional sensor nodes. However, the fact that sensor nodes are severely energy‐constrained has been an issue and many energy‐efficient routing protocols have been proposed to resolve it. Cluster‐based routing protocol is one of them. To achieve longer lifetime, some cluster‐based routing protocols use information on GPS‐based location of each sensor node. However, because of high cost, not all sensor nodes can be GPS‐enabled. The purpose of this paper is to propose a simple dynamic clustering approach to achieve energy efficiency for wireless sensor networks (WSN).

Instead of using location information of each sensor node, this approach utilizes information of remaining energy of each sensor node and changes in the number of cluster head nodes dependent on the number of sensor nodes alive. Performance results are presented and compared with some related protocols.

The simulations described in the paper show that both residual energy of each sensor node and changing cluster head nodes depending on the number of sensor nodes alive are very critical factors to obtain performance enhancement in terms of lifetime and data transmission. Especially, in some special environment, the proposal has better performance than GPS‐enabled protocol.

The paper is of value in proposing a simple dynamic clustering approach to achieve energy efficiency for WSN.

Wireless mesh networks (WMNs) have evolved quickly during the last several years. They are widely used in a lot of fields. Channel allocation provides basic means to guarantee mesh networks’ good performance such as efficient routing. The purpose of this paper is to study channel allocation in mesh networks.

First, the papers in channel allocation fields are surveyed, and then the limitations in existing methods noted. Graph theory is used to find a better model to represent the problem and algorithms are proposed based on this model. Simulation proved that algorithms are better than the previous conflict graph‐based approaches.

The paper analyzes the conflict graph‐based model and finds its limitations, then proposes a bipartite graph‐based model. Algorithms were devised based on this model. Simulation results illustrate that the algorithms can reduce the starvation ratio and improve the bandwidth utilization, compared with previous conflict graph‐based algorithms.

The research of this paper is based on an ideal network environment without interference or noises. It will be better if the noises are considered in future work.

To study the routing strategies of WMNs, it is not sufficient to only consider path length as routing metric since the nodes are heterogeneous. The routing metrics should include the channel bandwidths which are the results of channel allocation.

This paper presents a new bipartite graph‐based model to represent the channel allocation problem in mesh networks. This model is more efficient and includes more information compared with conflict graph model, and it also proposes channel allocation algorithms based on bipartite graph‐based model. The algorithms can reduce starvation ratio and improve the bandwidth utilization.

The purpose of this paper is to present the benefits of using the Lagrangian relaxation (LR) and subgradient methods in scenario studies for wavelength division multiplexing (WDM) network planning. The problem of WDM network planning for a given set of lightpath demands in a mesh topology network is to select lightpath routes and then allocate wavelength channels to the lightpaths. In WDM network planning, a scenario study is to find out the network performance under different lightpath demands and/or different network resource configurations.

A scenario study must solve a series of related static WDM network planning problems. Each static WDM network planning problem is an optimization problem, and may be formulated as an integer linear programming problem, which can be solved by the proposed Lagrangian relaxation and subgradient methods. This paper uses the Lagrange multipliers that are obtained from previous scenarios as initial Lagrange multiplier values for other related scenarios.

This approach dramatically reduces the computation time for related scenarios. For small to medium variations of scenarios, the method reduces the computation time by several folds. The proposed method is the first method that effectively considers the relations between related scenarios, and uses such relations to improve the computation efficiency of scenario studies in WDM network planning.

The method improves the efficiency of a scenario study in WDM network planning. By using it, many “what‐if” type of scenario study questions can be answered quickly.

Unlike other existing methods that treat each scenario individually, this method effectively uses the information of the relation between different scenarios to improve the overall computation efficiency.

The publish/subscribe paradigm is useful for content diffusion in the internet. The purpose of this paper is to propose subscription covering to reduce the size of routeing table and notification matching time.

The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm.

Experiments show that both SSCBR and RSCBR can reduce the size of routeing table, network traffic and time.

All these experiments are based on high speed wireline network. For wireless network, the results may be different.

The paper proposes a necessary and sufficient condition of correct routeing table configuration when using SSCBR algorithm and can easily validate the correctness of brokers' routeing table through it. Because RSCBR calculates less subscription covering relation, its performance in network traffic and average notification processing time may be better than SSCBR in certain scenarios.

The main aim of this paper is to focus on a big step for IPv6: deployment. At the same time, it aims to issue a warning about something that should be in a more evolved stage.

A multiple‐angle analysis about IPv6 deployment was used: breaking some myths, looking at deployment data and trying to relate to IPv4's deployment.

The paper finds that IPv6 deployment is not yet on track. Comparison between IPv6 and IPv4 network performance is negative.

Numbers and policy analysis described in this paper will naturally evolve and thus will need to be revisited in future work. This theme will be progressively more important as IPv4 address space becomes exhausted.

More IPv6 deployment is needed, in order to ensure Internet's continued growth. In order to become a viable solution for the global Internet, IPv6 deployment must be seen as a priority for network administrators today.

This paper's content may alert some players to the needed effort associated with the Internet's evolution. Other audiences will benefit from the data and details discussed, in order to gain confidence about deploying IPv6.

Attempts to characterise some aspects of the new wave of reaction‐diffusion and ant based computation, and to discuss their place in the class of fully distributed load‐balancing algorithms that solve the dynamic load‐balancing problem of communication networks. The main question of the paper states: what are the advantages of the intellectualisation of the control agents and what are the costs of smartness? We start our investigation with random walk techniques and the electricity paradigm, carry on with the reaction‐diffusion approach, and finish the construction of the computational hierarchy with the ant paradigm and smart agents.

Tracks the evolution of Internet interconnection and charging arrangements, drawing comparisons with telecommunication carriers’ arrangements. Focuses on how pricing arrangements could change ISP relationship’s nature from peer‐ to hierarchy‐based systems. Spotlights Internet basics and differences between telecoms and Internet pricing systems. Concludes that because of ISP, free riders and non‐explicit service subsidies, days are numbered.