DNS-based Internet Client Clustering and Characterization

This paper proposes a novel protocol which uses the Internet Domain Name System (DNS) to partition Web clients into disjoint sets, each of which is associated with a single DNS server. We define an L-DNS cluster to be a grouping of Web Clients that use the same Local DNS server to resolve Internet host names. We identify such clusters in real-time using data obtained from a Web Server in conjunction with that server's Authoritative DNS―both instrumented with an implementation of our clustering algorithm. Using these clusters, we perform measurements from four distinct Internet locations. Our results show that L-DNS clustering enables a better estimation of proximity of a Web Client to a Web Server than previously proposed techniques. Thus, in a Content Distribution Network, a DNS-based scheme that redirects a request from a web client to one of many servers based on the client's name server coordinates (e.g., hops/latency/loss-rates between the client and servers) would perform better with our algorithm.

On the Origin of Power Laws in Internet Topologies

Recent empirical studies have shown that Internet topologies exhibit power laws of the form for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs y = x^α within a neighborhood versus neighborhood size (in hops); and (P4) eigenvalues of the adjacency matrix versus rank. However, causes for the appearance of such power laws have not been convincingly given. In this paper, we examine four factors in the formation of Internet topologies. These factors are (F1) preferential connectivity of a new node to existing nodes; (F2) incremental growth of the network; (F3) distribution of nodes in space; and (F4) locality of edge connections. In synthetically generated network topologies, we study the relevance of each factor in causing the aforementioned power laws as well as other properties, namely diameter, average path length and clustering coefficient. Different kinds of network topologies are generated: (T1) topologies generated using our parametrized generator, we call BRITE; (T2) random topologies generated using the well-known Waxman model; (T3) Transit-Stub topologies generated using GT-ITM tool; and (T4) regular grid topologies. We observe that some generated topologies may not obey power laws P1 and P2. Thus, the existence of these power laws can be used to validate the accuracy of a given tool in generating representative Internet topologies. Power laws P3 and P4 were observed in nearly all considered topologies, but different topologies showed different values of the power exponent α. Thus, while the presence of power laws P3 and P4 do not give strong evidence for the representativeness of a generated topology, the value of α in P3 and P4 can be used as a litmus test for the representativeness of a generated topology. We also find that factors F1 and F2 are the key contributors in our study which provide the resemblance of our generated topologies to that of the Internet.

Received signal strength in large-scale wireless relay sensor network: a stochastic ray approach

The authors consider a point percolation lattice representation of a large-scale wireless relay sensor network (WRSN) deployed in a cluttered environment. Each relay sensor corresponds to a grid point in the random lattice and the signal sent by the source is modelled as an ensemble of photons that spread in the space, which may 'hit' other sensors and are 'scattered' around. At each hit, the relay node forwards the received signal to its nearest neighbour through direction-selective relaying. The authors first derive the distribution that a relay path reaches a prescribed location after undergoing certain number of hops. Subsequently, a closed-form expression of the average received signal strength (RSS) at the destination can be computed as the summation of all signal echoes' energy. Finally, the effect of the anomalous diffusion exponent ß on the mean RSS in a WRSN is studied, for which it is found that the RSS scaling exponent e is given by (3ß-1)/ß. The results would provide useful insight into the design and deployment of large-scale WRSNs in future. © 2011 The Institution of Engineering and Technology.

Generic Ergodic Capacity Bounds for Fixed-Gain AF Dual-Hop Relaying Systems

This paper elaborates on the ergodic capacity of fixed-gain amplify-and-forward (AF) dual-hop systems, which have recently attracted considerable research and industry interest. In particular, two novel capacity bounds that allow for fast and efficient computation and apply for nonidentically distributed hops are derived. More importantly, they are generic since they apply to a wide range of popular fading channel models. Specifically, the proposed upper bound applies to Nakagami-m, Weibull, and generalized-K fading channels, whereas the proposed lower bound is more general and applies to Rician fading channels. Moreover, it is explicitly demonstrated that the proposed lower and upper bounds become asymptotically exact in the high signal-to-noise ratio (SNR) regime. Based on our analytical expressions and numerical results, we gain valuable insights into the impact of model parameters on the capacity of fixed-gain AF dual-hop relaying systems. © 2011 IEEE.

A new look at dual-hop relaying: Performance limits with hardware impairments

Physical transceivers have hardware impairments that create distortions which degrade the performance of communication systems. The vast majority of technical contributions in the area of relaying neglect hardware impairments and, thus, assume ideal hardware. Such approximations make sense in low-rate systems, but can lead to very misleading results when analyzing future high-rate systems. This paper quantifies the impact of hardware impairments on dual-hop relaying, for both amplify-and-forward and decode-and-forward protocols. The outage probability (OP) in these practical scenarios is a function of the effective end-to-end signal-to-noise-and-distortion ratio (SNDR). This paper derives new closed-form expressions for the exact and asymptotic OPs, accounting for hardware impairments at the source, relay, and destination. A similar analysis for the ergodic capacity is also pursued, resulting in new upper bounds. We assume that both hops are subject to independent but non-identically distributed Nakagami-m fading. This paper validates that the performance loss is small at low rates, but otherwise can be very substantial. In particular, it is proved that for high signal-to-noise ratio (SNR), the end-to-end SNDR converges to a deterministic constant, coined the SNDR ceiling, which is inversely proportional to the level of impairments. This stands in contrast to the ideal hardware case in which the end-to-end SNDR grows without bound in the high-SNR regime. Finally, we provide fundamental design guidelines for selecting hardware that satisfies the requirements of a practical relaying system.

Dimensioning of multilayer optical networks

Este trabalho apresenta um estudo sobre o dimensionamento de redes ópticas, com vistas a obter um modelo de dimensionamento para redes de transporte sobreviventes. No estudo utilizou-se uma abordagem estatística em detrimento à determinística. Inicialmente, apresentam-se as principais tecnologias e diferentes arquitecturas utilizadas nas redes ópticas de transporte. Bem como os principais esquemas de sobrevivência e modos de transporte. São identificadas variáveis necessárias e apresenta-se um modelo dimensionamento para redes de transporte, tendo-se dado ênfase às redes com topologia em malha e considerando os modos de transporte opaco, transparente e translúcido. É feita uma análise rigorosa das características das topologias de redes de transporte reais, e desenvolve-se um gerador de topologias de redes de transporte, para testar a validade dos modelos desenvolvidos. Também é implementado um algoritmo genético para a obtenção de uma topologia optimizada para um dado tráfego. São propostas expressões para o cálculo de variáveis não determinísticas, nomeadamente, para o número médio de saltos de um pedido, coeficiente de protecção e coeficiente de restauro. Para as duas últimas, também é analisado o impacto do modelo de tráfego. Verifica-se que os resultados obtidos pelas expressões propostas são similares às obtidas por cálculo numérico, e que o modelo de tráfego não influencia significativamente os valores obtidos para os coeficientes. Finalmente, é demonstrado que o modelo proposto é útil para o dimensionamento e cálculo dos custos de capital de redes com informação incompleta.

Taylor & Bates Brewery & Vinegar Manufactory - Vignette

A vignette of Taylor and Bate's Brewery and Manufactory, St. Catharines.. "Manufacturers of Taylor's Celebrated Amber Ale, Porter, also, White Wine Vinegar, Dealers in Malt, Hops, Barley, &c. &c." The names listed are James Taylor and Thomas B. Bate.

La monnaie en droit : nature d'une abstraction outre fondée : essai dialectique et logique sur la dualité dans la catégoricité juridique et sur l'abstraction d'hérédité monétaire

"Thèse présentée à la Faculté des études supérieures en vue de l'obtention du grade de Docteur en droit (LL.D.)"

Methodology To model the energy and greenhouse gas emissions of electronic software distributions

A new electronic software distribution (ESD) life cycle analysis (LCA)methodology and model structure were constructed to calculate energy consumption and greenhouse gas (GHG) emissions. In order to counteract the use of high level, top-down modeling efforts, and to increase result accuracy, a focus upon device details and data routes was taken. In order to compare ESD to a relevant physical distribution alternative,physical model boundaries and variables were described. The methodology was compiled from the analysis and operational data of a major online store which provides ESD and physical distribution options. The ESD method included the calculation of power consumption of data center server and networking devices. An in-depth method to calculate server efficiency and utilization was also included to account for virtualization and server efficiency features. Internet transfer power consumption was analyzed taking into account the number of data hops and networking devices used. The power consumed by online browsing and downloading was also factored into the model. The embedded CO2e of server and networking devices was proportioned to each ESD process. Three U.K.-based ESD scenarios were analyzed using the model which revealed potential CO2e savings of 83% when ESD was used over physical distribution. Results also highlighted the importance of server efficiency and utilization methods.

A comparison of the anticancer properties of isoxanthohumol and 8-prenylnaringenin using in vitro models of colon cancer

The hops plant (Humulus lupulus L.) is an essential ingredient in beer and contains a number of potentially bioactive prenylflavonoids, the predominant being the weakly estrogenic isoxanthohumol (Ix), which can be converted to the more strongly estrogenic 8-PN by the colonic microbiota. The aim of this study was to investigate the biological activity of 8-PN and Ix using in vitro models representing key stages of colorectal carcinogenesis, namely cell growth and viability (MTT assay), cell-cycle progression (DNA content assay), DNA damage (Comet assay), and invasion (Matrigel assay). A significant decrease in Caco-2 cell viability was noted after both 8-PN and Ix treatments at the higher doses (40 and 50 μM, respectively) although the impact on cell cycle differed between the two compounds. The decreased cell viability observed after Ix treatment was associated with a concentration-dependent increase in G2/M and an increased sub-G1 cell-cycle fraction, whereas treatment with 8-PN was associated with an elevated G0/G1 and an increased sub-G1 cell-cycle fraction. Significant antigenotoxic activity was noted at all 8-PN concentrations tested (5-40 μM). Although significant antigenotoxic activity was also noted with Ix treatment at ≤25 μM, at a higher dose, Ix itself exerted genotoxic activity. In a dose-dependent manner, both compounds inhibited HT115 cell invasion with reductions up to 52 and 46% for Ix and 8-PN, respectively, in comparison to untreated cells. This study demonstrated that both Ix and its gut microbial metabolite 8-PN exert anticancer effects on models of key stages of colon tumourigenesis.

Simplified estimation of ray-path mirroring height for HF radiowaves reflected from the ionospheric F-region

From Milsom's equations, which describe the geometry of ray-path hops reflected from the ionospheric F-layer, algorithms for the simplified estimation of mirror-reflection height are developed. These allow for hop length and the effects of variations in underlying ionisation (via the ratio of the F2- and E-layer critical frequencies) and F2-layer peak height (via the M(3000)F2-factor). Separate algorithms are presented which are applicable to a range of signal frequencies about the FOT and to propagation at the MUF. The accuracies and complexities of the algorithms are compared with those inherent in the use of a procedure based on an equation developed by Shimazaki.

Simple M-factor algorithm for improved estimation of the basic maximum usable frequency of radio waves reflected from the ionospheric F-region

The equations of Milsom are evaluated, giving the ground range and group delay of radio waves propagated via the horizontally stratified model ionosphere proposed by Bradley and Dudeney. Expressions for the ground range which allow for the effects of the underlying E- and F1-regions are used to evaluate the basic maximum usable frequency or M-factors for single F-layer hops. An algorithm for the rapid calculation of the M-factor at a given range is developed, and shown to be accurate to within 5%. The results reveal that the M(3000)F2-factor scaled from vertical-incidence ionograms using the standard URSI procedure can be up to 7.5% in error. A simple addition to the algorithm effects a correction to ionogram values to make these accurate to 0.5%.

Space, authenticity and utopia in the hip-hop teen dance film

The dance film flourished in the 2000s in the form of the hip-hop teen dance film. Such films as Save the Last Dance (Thomas Carter, 2001), Honey (Billy Woodruff, 2002) and Step Up (Anne Fletcher, 2006) drew on hip-hop’s dominance of the mainstream music industry and combined the teen film’s pre-existing social problem and musical narratives. Yet various tension were created by their interweaving of representations of post-industrial city youth with the utopian sensibilities of the classical Hollywood musical. Their narratives celebrated hip-hop performance, and depicted dance’s ability to bridge cultural boundaries and bring together couples and communities. These films used hip-hop to define space and identity yet often constructed divisions within their soundscapes, limiting hip-hop’s expressive potential. This article explores the cycle’s celebration of, yet struggle with, hip-hop through examining select films’ interactions between soundscape, narrative and form. It will engage with these films’ attempts to marry the representational, narrative and aesthetic meanings of hip-hop culture with the form and ideologies of the musical genre, particularly the tensions and continuities that arise from their engagement with the genre’s utopian qualities identified by Richard Dyer (1985). Yet whilst these films illustrate the tensions and challenges of combining hip-hop culture and the musical genre, they also demonstrate an effective integration of hip-hop soundscape and the dancing body in their depiction of dance, highlighting both form’s aesthetics of layering, rupture and flow (Rose, 1994: 22).

Source-based filtering scheme against DDOS attacks

IP address spoofing is employed by a lot of DDoS attack tools. Most of the current research on DDoS attack packet filtering depends on cooperation among routers, which is hard to achieve in real campaigns. Therefore, in the paper, we propose a novel filtering scheme based on source information in this paper to defend against various source IP address spoofing. The proposed method works independently at the potential victim side, and accumulates the source information of its clients, for instance, source IP addresses, hops from the server during attacks free period. When a DDoS attack alarm is raised, we can filter out the attack packets based on the accumulated knowledge of the legitimate clients. We divide the source IP addresses into n(1 ≤ n ≤ 32) segments in our proposed algorithm; as a result, we can therefore release the challenge storage and speed up the procedure of information retrieval. The system which is proposed by us and the experiments indicated that the proposed method works effectively and efficiently.

Distributed protocol for communications among underwater vehicles

Underwater surveying by swarms of autonomous underwater vehicles presents problems in communication among the robots. These problems involve the bandwidth, power consumption, timing, processing power, and other issues. This paper presents a novel approach to communicate and coordinate effectively among underwater vehicles to accomplish this task successfully. The proposed approach solves issues by reducing the number of hops to conserve power, while reducing computation time and bandwidth, effectively utilizing resources to reduce the load on each node. Finally, the simulation results are presented, in order to prove that the proposed approach improves efficiency and effectiveness in communicating among underwater vehicles.