Broadcasting in cycles with chords

Broadcasting is the process of information dissemination in which one node, the originator, knows a single piece of information and using a series of calls must inform every other node in the network of this information. We assume that at any given time, a node can communicate the message to another node, with which it shares an edge, by acting as either a sender or receiver, but not both. Multiple message broadcasting considers the case when the originator has m messages, where m \u3e 1, to disseminate. Whereas broadcasting limits the communication of a message from one node to another node via a single edge, line broadcasting allows one node to send a message to any other node in the network as long as a simple path exists between the sending node and the receiving node and every edge along the path is not in use.;In this dissertation, we consider the problem of broadcasting in a cycle with chords and we develop broadcast schemes for this type of network.;We begin by investigating the problem of broadcasting in a cycle with one and two chords, respectively. Then, we consider the problem of multiple message broadcasting in cycles with one and two chords. Finally, we consider the problem of line broadcasting in cycles with chords.;Through our investigations, we develop two algorithms for the problem of broadcasting in a cycle with one and two chords, respectively and we analyze the correctness and complexity of these algorithms. Then, we discuss problems associated with multiple message broadcasting in cycles with one and two chords. Finally, we use techniques developed for line broadcasting in cycles to create minimum time broadcast schemes for cycles through the addition of chords.;Using techniques developed in this dissertation, we are able to broadcast in minimum time in cycles with chords. In cycles whose size is a power of 2, we have proved that the number of chords that we add to the cycle is the minimum number of chords required to broadcast in minimum time in such a cycle

A Survey of Green Networking Research

Reduction of unnecessary energy consumption is becoming a major concern in wired networking, because of the potential economical benefits and of its expected environmental impact. These issues, usually referred to as "green networking", relate to embedding energy-awareness in the design, in the devices and in the protocols of networks. In this work, we first formulate a more precise definition of the "green" attribute. We furthermore identify a few paradigms that are the key enablers of energy-aware networking research. We then overview the current state of the art and provide a taxonomy of the relevant work, with a special focus on wired networking. At a high level, we identify four branches of green networking research that stem from different observations on the root causes of energy waste, namely (i) Adaptive Link Rate, (ii) Interface proxying, (iii) Energy-aware infrastructures and (iv) Energy-aware applications. In this work, we do not only explore specific proposals pertaining to each of the above branches, but also offer a perspective for research.Comment: Index Terms: Green Networking; Wired Networks; Adaptive Link Rate; Interface Proxying; Energy-aware Infrastructures; Energy-aware Applications. 18 pages, 6 figures, 2 table

Who Owns the \u27First Rough Draft of History\u27? Reconsidering Copyright in News

Who Owns the ‘First Rough Draft of History’? suggests the withdrawal of copyright protection from hard-news journalism as a mechanism for “rescuing” the news from the inexorable downward spiral in quality and diversity caused by excessive media concentration. Although copyright represents just one of the factors contributing to the “commodification” of news today, it is a significant factor, and one with a long, unsavory relationship with censorship and monopoly. The article asserts that newspapers’ quest for copyright protection was an early step onto a slippery slope toward a property-based, rather than service-based ethos, and that removing protection may mark a first and at least symbolic step back from the abyss. It argues that copyright protection should be replaced by a highly circumscribed variant of the misappropriation tort, coupled with authorial rights of attribution and integrity. It is doubtful that any of these proposed changes would prompt the media conglomerates to jettison otherwise profitable news operations, but, where they do, the resultant spin-offs may be more strongly committed to quality journalism. Fine-tuning the copyright law with respect to news might also restore among executives and working journalists alike some sense of public service obligation. And diluting the industry’s news-as-property attitude might even make a favorable impression on the increasingly disillusioned audience. Perhaps, someday, the public will come to own what former Washington Post publisher Philip Graham called the “first rough draft of history.

Application-layer multicast algorithms for bounded delay transmissions

This work shows the design and study of a family of algorithms that solves the multicast routing problem. In this problem, a given node called root has to send information to a certain group of receiving nodes. Although the algorithm can be applied at any level of the protocol stack, this paper studies its performance in the application level. This family of algorithms provides optimal routing tables between nodes belonging to the same multicast group, in such a way that the total transmission time is minimum. The algorithms take benefit from the delay time in the transmission of a message between one peer and another to forward the data to a third peer. Beginnig with a first algorithm, defined to send only one packet, some other algorithms has been described under certain conditions to send more than a packet with the maximum possible cadence and without congestion problems. With this purpose, we have restricted the number of times that the root may send a packet and also the maximum cadence time for the rest of the nodes. Moreover, we have applied mechanisms to guarantee full connectivity. With the aim of evaluating the performance of the different algorithms, we have calculated theoretically a set of bounds for transmission delays. Moreover, we present a serie of simulations over a virtual network that models an IP network. Over that first network, we have defined a second network of user nodes, which has been created at application level (so we can call it overlay network). We have applied the algorithms over the overlay networks, obtaining delay times, cadence times, number of nodes with congestion problems, and routing trees. Finally, we compare the results to check the best algorithm in any case. As expected, the fastest algorithms can usually have important congestion issues (more than a 50% of affected nodes). Moreover, the algorithm defined to avoid congestion has at most 50% bigger delay than the fastest algorithms, and hence we finally advice its application in multicast transmissions

Sleep and Stress Management in Enlightenment Literature and Poetry

‘Sleep and Stress Management in Enlightenment Literature and Poetry’ argues that the stresses known to disrupt sleep were often associated with unhealthy lifestyles and pressures of fashionable people of the upper classes, with the lower orders thought to be less susceptible to broken sleep because of their healthier modes of living. Highly popular poems such as Dr Edward Baynard’s comical Health, A Poem (1719), and Dr John Armstrong’s The Art of Preserving Health: A Poem (1744) gave medical lifestyle advice in an entertaining literary form that sugared the pill of dull lifestyle recommendations and treatments

Separating Fact From Fiction: The First Amendment Case for Addressing “Fake News” on Social Media

“Fake news” or disinformation that appropriates the look and feel of real news stories continues to spread across social networks, suppressing informed dialogue and sowing civil discord. After revelations that influential media websites like Facebook and Twitter were used to spread fake news during the 2016 presidential election, these companies vowed to take remedial action, but have failed to contain the spread of fake news. This essay makes the case that First Amendment principles mandate that the government has a duty to preserve democratic deliberation and democratic decision-making institutions, even if that means overriding private interests. It explores some prospective measures to address fake news, including a judicial reexamination of §230 of the Communications Decency Act, and a statutory remedy for corrective action. This essay argues that such prospective measures are much needed to help preserve informed discussion on public affairs, which the First Amendment seeks to sustain, both as an end and as a means to achieve a self-governing republic

Network Neutrality: A Research Guide

The conclusion in a research handbook should emphasise the complexity of the problem than trying to claim a one-size-fits-all solution. I have categorised net neutrality into positive and negative (content discrimination) net neutrality indicating the latter as potentially harmful. Blocking content without informing customers appropriately is wrong: if it says ‘Internet service’, it should offer an open Internet (alongside walled gardens if that is expressly advertised as such). The issue of uncontrolled Internet flows versus engineered solutions is central to the question of a ‘free’ versus regulated Internet. A consumer- and citizen-orientated intervention depends on passing regulations to prevent unregulated nontransparent controls exerted over traffic via DPI equipment, whether imposed by ISPs for financial advantage or by governments eager to use this new technology to filter, censor and enforce copyright against their citizens. Unraveling the previous ISP limited liability regime risks removing the efficiency of that approach in permitting the free flow of information for economic and social advantage. These conclusions support a light-touch regulatory regime involving reporting requirements and co-regulation with, as far as is possible, market-based solutions. Solutions may be international as well as local, and international coordination of best practice and knowledge will enable national regulators to keep up with the technology ‘arms race’