The analytical hierarchy process applied for design analysis

Being an intelligent activity, design is a complex process to accomplish. The complexity stems from the elusive character of this activity, which cannot be explained in precise terms, in general. In a design process, the determined relationships among the design elements provide important information to understand the role of each element with...

QoS routing: Average complexity and hopcount in m dimensions

QoS routing is expected to be an essential building block of a future, efficient and scalable QoS-aware network architecture. We present SAMCRA, an exact QoS routing algorithm that guarantees to find a feasible path if such a path exists. The complexity of SAMCRA is analyzed. Because SAMCRA is an exact algorithm, most findings can be applied to...

Measurements of the hopcount in internet

End-to-end quality of service is very likely to depend on the hopcount, the number of traversed routers. The hopcount also enhances our understanding of properties of the Internet topology. In this paper we present the results of the measurements of the hopcount from a source at Delft towards several destinations spread over three continents....

RBF networks with mixed radial basis functions

After the introduction to neural network technology as multivariable function approximation, radial basis function (RBF) networks have been studied in many different aspects in recent years. From the theoretical viewpoint, approximation and uniqueness of the interpolation is studied and it has been established that RBF network can approximate...

ON THE RELEVANCE OF ON-LINE TRAFFIC ENGINEERING

The evaluation of dynamic Traffic Engineering (TE) algorithms is usually carried out using some specific network(s), traffic pattern(s) and traffic engineering objective(s). As the behavior of a TE algorithm is a consequence of the interactions between the network, the traffic demand and the algorithm itself, the relevance of TE may depend on...

Degree and Principal Eigenvectors in Complex Networks

The largest eigenvalue ? 1 of the adjacency matrix powerfully characterizes dynamic processes on networks, such as virus spread and synchronization. The minimization of the spectral radius by removing a set of links (or nodes) has been shown to be an NP-complete problem. So far, the best heuristic strategy is to remove links/nodes based on the...

Crawling and Detecting Community Structure in Online Social Networks using Local Information

As Online Social Networks (OSNs) become an intensive sub- ject of research for example in computer science, networking, social sci- ences etc., a growing need for valid and useful datasets is present. The time taken to crawl the network is however introducing a bias which should be minimized. Usual ways of addressing this problem are sampling...

On-line Survivable Routing in WDM Networks

In WDM networks, survivable routing and wavelength assignment (SRWA) involves assigning link-disjoint primary and backup lightpaths. In the on-line SRWA problem, a sequence of requests arrive and each request is either accepted or rejected based only on the input sequence seen so far. For special networks, we establish on-line algorithms with...

Context-Sensitive Sentiment Classification of Short Colloquial Text

The wide-spread popularity of online social networks and the resulting availability of data to researchers has enabled the investigation of new research questions, such as the analysis of information diffusion and how individuals are influencing opinion formation in groups. Many of these new questions however require an automatic assessment of...

Conception de réseau iBGP

BGP is used today by all Autonomous Systems (AS) in the Internet. Inside each AS, iBGP sessions distribute the external routes among the routers. In large ASs, relying on a fullmesh of iBGP sessions between routers is not scalable, so route-reflection is commonly used. The scalability of route-reflection compared to an iBGP full-mesh comes at...

Survivable Impairment-aware Traffic Grooming in WDM Rings

Wavelength Division Multiplexing (WDM) optical networks offer a large amount of bandwidth using multiple, but independent wavelength channels (or lightpaths), each operating at several Gb/s. Since the traffic between users is usually only a fraction of the capacity offered by a wavelength, several independent traffic streams can be groomed...

Analytical Model for Mesh-based P2PVoD

Recently, there has been a growing interest in academic and commercial environments for Video-on-Demand (VoD) using Peer-to-Peer (P2P) technology. Unlike centralized solutions for VoD services, P2P technology lets the clients distribute video content among themselves. In this paper, we propose an analytical model for P2PVoD and we compare that...

On the Quality of Experience of SopCast

Peer-to-Peer (P2P) file sharing has become immensely popular in the Internet. Recently, there has been a growing interest in academic and commercial enviornments for live streaming using P2P technology. A number of new P2P digital television (P2PTV) applications have emerged. Such P2PTV applications are developed with proprietary technologies...