Networks

"Red Estatal eJalisco: The Network is Ours" by IJALTI, gathering in its pages the rationale, origins and motivation to perform this first strategy mainly emanating from the citizens of Jalisco, to enhance the development and inclusion of society in the digital age (IJALTI, 2013).

Infrastructural practices, made by the manipulations of pumps, pipes and hydraulic expertise, play a critical role in managing urban populations. Drawing on two years of ethnographic research in Mumbai, in this article I show how Muslim settlers in a northern suburb are being rendered abject residents of the city. Abjection isn’t not a lack of social and political entitlements, but a denial of them. As Muslim settlers are being pushed down to claim less desirable water through the deliberate inaction of city engineers and technocrats, this article shows the iterative process through which abjection is made through tenuous and contentious infrastructural connections between the government and the governed.

The Internet is growing to the point of needing more serious, scalable management infrastructure. Telecommunications companies and Internet Service Providers alike face the pressures of upgrading and provisioning their networks while constraining their infrastructure costs to maintain profitability and to stay competitive in an industry that is financially stressed with tight profit margins. In order to be financially successful in this environment, service providers will have to support a variety of services and applications on a combined packet infrastructure, carrying increased varieties of traffic with different performance characteristics and predictable levels of managed Quality of Service (QoS). Multi-Protocol Label Switching (MPLS) traffic engineering enables service providers to engineer their networks to provide such QoS; however, this task brings along with it a plethora of management challenges. This paper discusses these management challenges and our experience with the design and implementation of a policy-based management system, PECAN, for managing MPLS networks. PECAN provides the ability for a network operator to define high-level policies that control the operation of the management system. These high-level policies control admission of traffic into the network based on the QoS guarantees required; placement of traffic flows on MPLS traffic engineered paths; and the feedback loop between network fault/performance monitoring and reconfiguration of the network to alleviate the effects of any observed problems.

An extensive body of evidence exists of the impact that speci c edge labelings have on the communication complexity of distributed problems. It has been long suspected that these very di erent labelings share a common property, named Sense of Direction. In spite of the large amount of investigations, and of the obvious practical importance, a formal characterization of this property did not exist.

We consider the problem of efficient information exchange in a communication network whose nodes and/or links are subject to Byzantine faults that are randomly and independently distributed through the network. The goal is almost safe communication, i.e., getting to every fault-free node information about every other fault-free node, with probability converging to one as the number of nodes grows. We present nonadaptive almost-safe communication schemes working for various networks in asymptotically optimal time and using an asymptotically optimal number of message bits.

Synthetic biology is an emerging field that strives to build increasingly complex biological networks through the integration of molecular biology and engineering. The growth of the field has been supported by progress in the design and construction of synthetic genetic and protein networks. This has led to the possibility of assembling modular components to attain novel biological functions and tools. In addition, these synthetic networks give rise to insights that facilitate the investigation of interactions and phenomena in naturally-occurring networks. Integration of well-characterized biological components into higher order networks requires computational modeling approaches to rationally construct systems that are directed towards a desired outcome. A computational approach would improve the predictability of the underlying mechanisms that would otherwise be difficult to deduce through experimentation alone. The analysis and interpretation of both qualitative and quantitative ...

Small-world networks are the focus of recent interest because they appear to circumvent many of the limitations of either random networks or regular lattices as frameworks for the study of interaction networks of complex systems. Here, we report an empirical study of the statistical properties of a variety of diverse real-world networks. We present evidence of the occurrence of three classes of small-world networks: (a) scale-free networks, characterized by a vertex connectivity distribution that decays as a power law; (b) broad-scale networks, characterized by a connectivity distribution that has a power-law regime followed by a sharp cut-off; (c) single-scale networks, characterized by a connectivity distribution with a fast decaying tail. Moreover, we note for the classes of broad-scale and single-scale networks that there are constraints limiting the addition of new links. Our results suggest that the nature of such constraints may be the controlling factor for the emergence of different classes of networks.

In this work we demonstrate the usefulness of the application of Recommender Systems in the financial domain. Specifically we investigate a dataset, made available by a major European bank, containing the purchases of a large set of investment assets by 200k investors. We also present some preliminary results of the application of network analysis via statistical validation to identify clusters of investment assets.

The rapid growth of link bandwidths on one hand, and the emergence of resource-constrained nodes (e.g. software routers) on the other hand, will cause network nodes to be the bottleneck in the future. Parallel processing using multi-core processors can increase the packet processing of resource-constrained nodes and alleviate the problem. However, intra-node resource contention can have a strong negative impact on the corresponding network node and, therefore, also on the overall performance of the network. Commonly used network simulators (e.g. ns-3) only offer a rather simplistic node model and do not take into account intra-node resource contention. We propose a unified and extensible approach to model intra-node resource management in resource-constrained nodes. Our model gives ability to identify and predict performance bottlenecks in networks. We have implemented our model as an extension to the network simulator ns-3. The simulation results using different case studies, show that our approach significantly outperforms the original ns-3 in terms of realistic modeling.

A weekday in Didier's life can seem pretty repetitive. However, each of these days see him playing with new ideas, talking with new people, reading new stuffs, connecting ideas and people (among which are the authors)... he even saves time to read, go to the movie and the theatre, and enjoy singing Renaissance songs every Tuesday night. He also finds time to enjoy his family, although probably not quite enough.

Reciprocal altruism is common in humans (Niamir-Fuller, 1998, Gurven, 2004), however, its evolution is paradoxical; theoretically the more one is trusted, the better the outcomes from oneshot prisoner's dilemmas, although for individuals the best outcomes are when trust is not reciprocated. Most real life games are not oneshot, but iterated where trust develops through past actions (Cárdenas and Ostrom, 2004). Furthermore, in social-ecological systems outcomes are driven by biophysical context. In rangelands, our focus, low levels ...

The Graph is a powerful mathematical tool applied in many fields as transportation, communication, informatics, economy, … In an ordinary graph, the weights of edges and vertexes are considered independently where the length of a path is the sum of weights of the edges and the vertexes on this path. However, in many practical problems, weights at a vertex are not the same for all paths passing this vertex but depend on coming and leaving edges. The presented paper develops a model of the extended linear multi-commodity multi-cost network that can be more exactly and effectively applied to model many practical problems. Then, maximal limit cost flow problems are modeled as implicit linear programming problems. On the base of dual theory in linear rogramming, an effective approximate algorithm is developed.

Dynamic lightpath protection in survivable WDM networks requires finding a pair of diverse routes (i.e., a primary route and a backup route that are link-disjoint) that form a cycle upon the arrival of a new connection request. In this paper, we propose a novel hybrid algorithm for this problem based on a combination of the mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the network to cooperatively explore the network states and continuously report diverse routes into the routing tables, our new hybrid algorithm can promptly determine the first population of cycles for a new request based on the routing table of its source node, without requiring the time consuming process associated with current GA-based lightpath protection schemes. We furthermore improve the performance of our algorithm by introducing a more advanced fitness function. Extensive simulation studies on the ns-2 network simulator show that our hybrid algorithm achieve a significantly lower blocking probability and a smaller execution time than the conventional survivable routing algorithms.

Abstract. Ontology at the beginning was (and it is still usually) conceived as a defini-tely philosophical discipline, far from the world of technology. Nevertheless, in the last years, the exponential growth of communication through the net has favoured a new phenomenon: the ontological ...

This article proposes two approximate methods to solve capacitated, single-commodity and fixed-charge network flow problems. First, relaxed problems obtained by the Lagrange relaxation method are shown to form a minimum spanning tree problem, yielding a lower bound to the original problem. The subgradient optimization technique can be then applied to improve this bound by updating the Lagrange multipliers. The second part of the article presents a new, simple, and efficient heuristic to find a feasible and approximate solution that is also an upper bound to the original problem.

Global Cinema Networks investigates the evolving aesthetic forms, technological and industrial conditions, and social impacts of cinema in the twenty-first century. The collection’s esteemed contributors excavate sites of global filmmaking in an era of digital reproduction and amidst new modes of circulation and aesthetic convergence, focusing primarily on recent films made across Europe, Africa, Latin America, Asia, and the Middle East. Moving beyond the digital as a harbinger of transformation, the volume offers new ways of thinking about cinema networks in a historical continuum, from “international” to “world” to “transnational” to “global” frames. 
Table of Contents

Chapter 1: Introduction: Global Cinemas in a Time of Networks
Elena Gorfinkel, King’s College London (U.K.)

Part 1: Cartographies, Geopolitics, Aesthetics

Chapter 2: Beyond and Beneath the Map of World Cinema
Dudley Andrew, Yale University

Chapter 3: Frame
Adrian Martin, Monash University (Australia)

Chapter 4: Abstraction and the Geopolitical: Lessons from Antonioni’s Trip to China
John David Rhodes, University of Cambridge

Chapter 5: The City of Bits and Urban Rule: Media Archaeology, Urban Space, and Contemporary Chinese Documentary
James Tweedie, University of Washington

Part 2: Global Ideality, History, Representation

Chapter 6: Toward an Archeology of Global Rhythms: Melodie der Welt (Melody of the World, 1929) and its Reception in France
Laurent Guido, University of Lille (France)

Chapter 7: When Cinema was Humanism
Karl Schoonover, University of Warwick

Chapter 8: African Cinema: Digital Media and Expanding Frames of Representation
N. Frank Ukadike, Tulane University, New Orleans

Chapter 9: Changing Circumstances: Global Flows of Lesbian Cinema
Patricia White, Swarthmore College

Part 3: Kinships, Identifications, Genres

Chapter 10: Hermano and La hora cero: Violence and Transgressive Subjectivities in Venezuelan Youth Cinema
Luisela Alvaray, DePaul University

Chapter 11: Between Love and the Moral Law: The Fatal Mother in Park Chan-wook’s Sympathy for Lady Vengeance
Peter Y. Paik, Yonsei University (Korea)

Chapter 12: The Queer Mexican Cinema of Julián Hernández
Gilberto M. Blasini, University of Wisconsin–Milwaukee

Chapter 13: The Gangster Film as World Cinema
Jian Xu, University of Wisconsin–Milwaukee

Chapter 14: Epilogue: 24 Frames: Regarding the Past and Future of Global Cinema
Tami Williams, University of Wisconsin–Milwaukee

https://www.rutgersuniversitypress.org/global-cinema-networks/9780813592725

The last two decades have seen a shift in public services organizations from hierarchies to networks. Network forms are seen as particularly suited to handling 'wicked problems'. We make an assessment of the nature and impact of this shift. Using recent evidence from the United Kingdom (UK) National Health Service (NHS), we explore the nature and functioning of eight different public policy networks. We are also interested in whether there has been a radical transition-or notfrom hierarchical to network forms. Most networks were found to relate to 'wicked problems'. We identify from the literature three key domains needed to support a full transition: (1) cross-organizational Information and Communication Technologies (ICTs)/databases (where we found little change); (2) strong Inter Organizational Learning (IOL) (where we also found little change); and (3) a shift from vertical management to lateral leadership (where we found more change). So, hybrid forms, which mix hierarchy and network, endure. We discuss academic and public policy implications. Despite this mixed pattern, public policy networks should be given time to develop, given the many 'wicked problems' faced. 'wicked problems'. But have network forms consolidated themselves in practice? Has the turn to network forms been fruitful or disappointing? We start by reviewing the academic literature and outlining three domains necessary to support a full transition to network forms: cross-organizational ICTs and databases; high inter-organizational learning; and a shift from vertical line management to broader, lateral, leadership. We use this framework to assess the organizational transition from hierarchical to network forms in a set of UK case studies, concluding the transition is only partial. Yet the 'wicked problems problem' remains pervasive within our cases. We defend networks as the best way of handling these 'wicked problems', calling for more time for them to develop. Network governance and the turn to public policy networks Various authors detect a move away from traditional vertically integrated large organizations in the public sector. Jessop (1994) argues the large bureaucracies of the public Ewan Ferlie and Gerry McGivern are in the Department of Management, and Chris Bennett in the Department of Geography, King's College

The focus of this exploratory research is how cultural networks are managed, what characterizes their management style - assumingly less hierarchical and more participatory, what values this style promotes and what is the motivation of managers to take part in it. As a case study, Cultural Innovators Network (CIN) is addressed, as an independent network existing since 2012 and operating in the Mediterranean region.

While researchers have noted that networks have become increasingly present in our societies thanks to process of globalization and technological developments, this work is focusing less on networks as social systems, rather as an organizational model. Furthermore, in literature concerning cultural networks, little has been said about why cultural managers decide to implement non-hierarchical types of management and foster various participatory approaches and values. Therefore, this research takes into account internal group dynamics - among the managers of CIN and between them and the network’s members, in understanding the underlying values, motivations, procedures, interactions, as well as mapping key challenges of running such a network. The idea is to ground management and participatory
ideals into a given context and understand better their implementation. In the case of CIN, it was also important to relate its foundation to a specific geopolitical context - the Arab Spring and cultural diplomacy activities of the Goethe-Institut in the Mediterranean region.

Among the main motivations for cultural managers to take part in the network’s operations were noted constructive and proactive approaches, professional growth, networking, and belief in a similar set of values such as cultural diversity, democracy, experiment and innovation. The use of non-hierarchical management and participatory approaches are seen as ways how to achieve these values and ideals. While the management in this setting becomes more decentralized and shared, focusing on tasks rather than hierarchies, wider participation of network members requires clear ground rules, self-motivation, and often more time for decision-making. Lastly, key challenges and observations are provided in order to offer a constructive feedback and discuss more efficient way of managing a cultural network in a more participatory manner.

This short collective biography of the Founders of the National Trust outlines what personal and professional ties united the Trust's epistemic community in the 1890s and shows how the founders integrated the Trust into wider world of Victorian philanthropy and international preservation.

This is an earlier and substantially lengthier version of the European Commission’s Green Paper on Ports and Maritime Infrastructure, which I had prepared as a member of Commissioner Neil Kinnock’s wise men group.

The Green Paper has often been described as the most influential port policy document ever produced by the EC. The current version does not in any way commit the European Commission and interested readers are advised to refer to the final version of the Green Paper as published by the EC.

The present work requires careful and persistent reading so that the reader bypasses the necessary bureaucratic 'superficiality' and identifies my core arguments which, I am happy to say, have not changed to the slightest in the 15 years since its publication. Many of these arguments had been described as ‘politically dangerous’ and, consequently, did not find their way into the Green Paper. I quote one of them in p.7 (emphasis added):

…The Commission’s White Paper on the future development of the common transport policy  laid down a new vision for transport policy, following the principle of sustainable mobility; i.e. a strategy that acknowledges the need for a more balanced transport system that would fulfil its economic and social role while, at the same time, containing its effects on the environment. The overall objective of such an approach, as clearly described by the European Parliament , is to …promote sustainable, efficient transport systems which meet the economic, social, environmental and safety needs of European citizens; help reduce regional disparities; and enable European business to compete effectively in world markets… Again, the ‘challenge’ is apparent: a more balanced  pan-European transport system with the above objectives is in stark contrast with hub-porting; concentration of traffic to selected ports; longer distances; and consequent transport externalities. It is thus increasingly felt that the European Commission needs to depart from its all-pleasing ‘statements’ and make hard-nosed decisions in order to effectuate its cohesion and regional development objectives which are the overarching ones…(unquote).

A closing note of caution on my use of the word 'superficiality': With remarkable consistency, European institutions involved in the maritime sector have been focusing all along on issues such as safety and environmental protection; issues which, among others, have allowed the proliferation of various monopolies in the port sector. I believe this has not happened accidentally. I believe instead that the focus on the ‘secondary’ has obscured and diverted attention from the ‘primary’, which comprises the ‘politically sensitive’ issues of port pricing; infrastructure financing; state aids; transparency of port accounts; and, finally, a European ‘port governance’ model.

This paper develops and simulates a model of emergence of networks in an interbank, RTGS payment system. A number of banks, faced with random streams of payment orders, choose whether to link directly to the payment system, or to use a correspondent bank. Settling payments directly via the system imposes liquidity costs, which depend on the maximum liquidity overdraft incurred during the day. On the other hand, using a correspondent entails paying a flat fee, charged by the correspondent to recoup liquidity costs and to extract a profit. We specify a protocol whereby banks sequentially choose whether to link directly to the system or to become clients of other banks, thus generating a client-correspondent network. We calibrate our model on real data on the UK payment system, and we compare the networks it produces with i) the true client-correspondent network, ii) the outcomes of two ‘dummy' benchmark models. The model is found to outperform the benchmarks. Its predicted network...

This paper develops and simulates a model of emergence of networks in an interbank, RTGS payment system. A number of banks, faced with random streams of payment orders, choose whether to link directly to the payment system, or to use a correspondent bank. Settling payments directly via the system imposes liquidity costs, which depend on the maximum liquidity overdraft incurred during the day. On the other hand, using a correspondent entails paying a flat fee, charged by the correspondent to recoup liquidity costs and to extract a profit. We specify a protocol whereby banks sequentially choose whether to link directly to the system or to become clients of other banks, thus generating a client-correspondent network. We calibrate our model on real data on the UK payment system, and we compare the networks it produces with i) the true client-correspondent network, ii) the outcomes of two 'dummy' benchmark models. The model is found to outperform the benchmarks. Its predicted networks reproduce some key features of the real UK network.

Given an undirected graph G = (N, E ) with a cost associated with each edge C: E R , and a demand associated with each node A: N + R,. A special node is designated as the center. The capacitated minimum spanning tree (CMST) problem is to find a minimum spanning tree for graph G such that the sum of demands on each branch stem from the center does not exceed a given capacity. The CMST problem has many applications in network design, centralized telecommunications, and vehicle routing. In this paper, we present a new formulation and a full optimization algorithm by branch and bound. The lower bounds are generated by Lagrangean relaxation with tightening constraints. Computational results based upon the methodology presented are shown. 0 7993 by John Wiley & Sons, Inc.

Several algorithms have been developed to solve the reliability problem for nonseries-parallel networks using the sum of disjoint products (SDP) approach. This paper provides a general framework for most of these techniques. It reviews methods that help improve computer time and memory requirements in reliability computation. These parameters are generally used to compare SDP algorithms. We also overview three multiple variable inversion algorithms that result in sum of disjoint products expressions with fewer terms than that of algorithms that use only a single-variable inversion. One common network is solved for twoterminal network reliability using each of these algorithms. Finally, we have provided a comparison among these techniques. 0

Both research and practice have shown that preexistence of long-term associations/clusters of active and competitive organizations, the so-called virtual organizations breeding environments (VBEs), can greatly enhance dynamic creation of virtual organizations (VOs). During the past decade, a number of VBEs are formed worldwide, mostly among organizations located in a common region that, in principle, have common business culture and other similarities, and primarily focus on static lines of activities. The second-generation VBEs addressed in this paper; however, aim to focus on associations/clusters that are not bound to geographical regions or static lines of activities, and wish to act as well recognized and competitive entities in the society/market, facilitating time/cost effective and fluid configuration, and establishment of dynamic VOs. The proposed VBEs apply supporting information and communication technology infrastructures, tools, and services that provide common grounds for the interaction and cooperation among their member organizations. Furthermore, these multiregional VBEs assist with the needed evolution of VOs, introducing new approaches and mechanisms to build trust, define the needed collaboration business culture, and establish the common value systems and working/sharing principles among their independent organizations, among others. The paper introduces a number of models, methodologies, and tools that are designed and developed supporting both the management as well as successful operation of the second-generation VBEs.

Wireless sensor networks (WSN) can increase the efficiency of many real-life applications through the collaboration of thousands of miniaturized sensors which can be deployed unattended in inhospitable environments. Due to the harsh surroundings and violent nature of the applications, the network sometimes suffers a large scale damage that involves many nodes and would thus create multiple disjoint partitions. This paper investigates a strategy for recovering from such damage through the placement of relay nodes and promotes a novel approach. The proposed approach opts to re-establish connectivity using the least number of relays while ensuring certain quality in the formed topology. Unlike contemporary schemes that form a minimum spanning tree among the isolated segments, the proposed approach establishes a topology that resembles a spider web, for which the segments are situated at the perimeter. Such a topology not only exhibits stronger connectivity than a minimum spanning tree but also achieves better sensor coverage and enables balanced distribution of traffic load among the employed relays. The simulation results demonstrate the effectiveness of the proposed recovery algorithm.

The increasing demand of wireless applications has put a lot of limitations on the use of available radio spectrum is limited and precious resource. Many survey of spectrum utilization shows that entire spectrum is not used at all the times, so many of the radio spectrum is underutilized. Some of the frequency bands in the spectrum are unoccupied, some of the frequency bands less occupied and few bands are over utilized. Cognitive radio system is a technique which overcomes that spectrum underutilization. Cognitive radio is a technique where secondary user looks for a free band to use when primary user is not in use of its licensed band. A function of cognitive radio is called Spectrum sensing which enables to search for the free bands and it helps to detect the spectrum hole (frequency band which is free enough to be used) which can be utilized by secondary user with high spectral resolution capability. The idea of simulation and analysis of Cognitive Radio System to reuse unused spectrum to increase the total system capacity was brought in this paper and this work digs into the practical implementation of a Cognitive radio system. MATLAB R2007b (version7.5) has been used to test the performance of Cognitive radio dynamically

We integrate theories from international business, entrepreneurship, innovation, marketing and
network economics to develop a four-part typology of ‘consumers as international entrepreneurs’. This
broadens the concept of international entrepreneurship and complements the firm-level focus
customary in research on international new ventures and entrepreneurs within those ventures. We
develop our arguments in the context of the new economy and discuss areas for investigation in this
emerging area of inquiry.

With the advent of the World Wide Web and the emergence of e-commerce applications and social networks, organizations across the world generate a large amount of data daily. Data security is the utmost critical issue in ensuring safe transmission of information through the internet. Also network security issues are now becoming important as society is moving towards digital information age. As more and more users connect to the internet it attracts a lot of cyber-criminals. It comprises authorization of access to information in a network, controlled by the network administrator. The task of network security not only requires ensuring the security of end systems but of the entire network. In this paper, an attempt has been made to review the various Network Security and Cryptographic concepts. This paper discusses the state of the art for a broad range of cryptographic algorithms that are used in networking applications.

This paper describes a tabu search heuristic for the vehicle routing problem with soft time windows. This problem allows lateness at customer locations although a penalty is then incurred and added to the objective value. By adding large penalty values, the vehicle routing problem with hard time windows can be addressed as well. In the tabu search, a neighborhood of the current solution is created through an exchange procedure that swaps sequences of consecutive customers (or segments) between two routes. The tabu search also exploits an adaptive memory that contains the routes of the best previously visited solutions. New starting points for the tabu search are produced through a combination of routes taken from different solutions found in this memory. Many best know solutions are reported on classical test problems.

Mobile phone can serve as powerful tool for world-wide communication. A system is developed to remotely monitor process through spoken commands using mobile. Mel cepstrum features are extracted from spoken words. Learning Vector Quantization Neural Network is used for recognition of various words used in the command. The accuracy of spoken commands is about 98%. A text message is generated and sent to control system mobile in form of SMS. On receipt of SMS, control system mobile informs AVR micro-controller based card, which performs specified task. The system alerts user in case of occurrence of any abnormal conditions like power failure, loss of control, etc. Other applications where this approach can be extended are also discussed.

the main focus of the work presented in this paper is to analyze the effect of the Transport Network Layer (TNL) congestion control on the High Speed Packet Access (HSPA) performance. The TNL and in particular the Iub link needs to be carefully dimensioned. Firstly because it has significant impact on the end-to-end and network performance and secondly due to the high number of required links in the network, the Iub is a major cost factor for the network operators. The congestion control function works together with the air interface scheduler and Hybrid Automatic Repeat Request (HARQ) in order to control the offered load to the TNL network. In this manner, the data flow over the TNL is adequately adapted to the user's air interface data rate and to the available TNL capacity avoiding congestion in the transport network. In addition, the paper focuses as well on the effects of the simultaneous deployment of both High Speed Downlink and Uplink Packet Access (HSDPA & HSUPA). This is done by comparing the results from deploying HSDPA or HSUPA separately in the system against the simultaneous deployment of both (To the best of our knowledge, there are only few publications in which this has been investigated, especially in combination with the Congestion Control). The reason for such a comparison is to highlight the effects that appear when both are deployed together, since most of the previous studies were focusing only on either HSDPA or HSUPA, whereas the final goal is to use both together in one system. The simulation results presented in this paper confirm that the congestion in the transport network can be controlled in such a way that the available TNL capacity can be effectively utilized and hence the performance of HSPA network can be significantly improved in all aspects. In the ComNets TZI working group at the university of Bremen, a number of projects focusing on the TNL dimensioning and TNL features development for the HSPA network are being worked on and 20].

Various network monitoring and performance evaluation schemes generate considerable amount of traffic, which affects network performance. In this paper we describe a method for minimizing network monitoring overhead based on Shortest Path Tree (SPT) protocol. We describe two different variations of the problem: the A-Problem and the E-Problem, and show that there is a significant difference between them. We prove that finding optimal solutions is N P -hard for both variations, and propose a theoretically best possible heuristic for the A-Problem and three different heuristics for the E-Problem, one of them being also theoretically best possible. We show that one can compute in polynomial time an O(ln|V |)-approximate solution for each of these problems. Then, we analyze the performance of our heuristics on large graphs generated using Waxman and Power-Law models as well as on real ISP topology maps. Experiment results show more than 80% improvement when using our heuristics on real topologies over the naive approaches.

Over the past century, metropolitan regions have become the dominant economic units in global society. The multiple networks of organizations that govern growth in metropolises extend far beyond the geographic bounds of any particular region, and involve multiple levels of government. Large institutional networks are the emerging form of these multi-scalar interactions.
That metropolitan region planning institutions are comprised of this new composite, termed multiscalar
large institutional networks (MSLIN), has implications for theory, practice, and research,
because they evolve, learn, and act on emergent phenomena and via emergent processes in
extraordinarily complex and dynamic settings in ways radically distinct from individual
organizations and institutions. This article assesses institutional theory in this framework by
examining metropolitan infrastructure planning in Madrid, Barcelona, and San Diego.

In 2006, a headline from USA Today read: “Study: 25% of Americans Have No One to Confide In.”  The related story described that between 1985 and 2004, the number of people the average American felt they could discuss important matters with (known as a “close-tie”) had shrunk from three to two people.  The study referenced in the article had been published by the American Sociological Review, and was based on information generated through the General Social Survey (GSS) - a sociological survey used to collect data on demographic characteristics and attitudes of residents of the United States.  It was further outlined that one in four Americans had no close confidants at all, thus inferring that social isolation was on the rise.
The study has been retested several times, by scholars such as Mathew Brashears, to find out if the initial findings on the dwindling number of close ties were simply an anomaly, however each retest resulted in the same “shrinking network” conclusion.  It was not until a study was conducted that focused on the users of online Social Networking Sites (SNS) was conducted by the PEW Research Center, that an increase in close relationships of a new breed was observed.  Consequently, one must wonder if and how there may exist a connection between use of online SNS and offline relationships.  Specifically, does the use of online SNS act as a substitute or as a companion to offline social networks?  Furthermore, does the use of online SNS demonstrate a move against this finding and toward a growing core network?

mo problems reZevant t o the design of a store-and-forward communication network ( t h e message routing problem and the chan-neZ capacity assignment problem) are formulated and are recognized t o be essentiaZ Zy non-Zinear, uncoMnA;tcained muZticomodity (m. c. 1 fZm problems. A " F Z m Deviation" ( F D ) method f o r the soZution o f these non-linear, unconstrained m.c. fZm probZems i s described which i s q u i t e simiZar t o the gradient method f o r functions o f continuous variables; here the concept of gradient i s repZaced by the concept of "shortest route" flow. A s i n the gradient method, the application of successive flow deviations leads t o ZocaZ minima. of the FD method t o the design of the ARPA Computer Network are discussed. FinaZ l y , two i n t e r e s t i n g applications 100 FRATTA, GERLA AND KLEINROCK I t i s easy t o see from Equation ( 2 . 4 ) t h a t ( i v ) implies a l s o (ii) and (iii) ; hence both (ii) and (iii) can be replaced by

In enterprise networks, the concept of bringing your own devices (BYOD) to work and also allowing guest nodes to connect to the network is encouraged. As a factor the need to control access to the network is critical as visibility of nodes attached to the network is paramount in determining potential threats. The use of opensource technology is not mostly patronized by the corporate world because of the steep learning curve and the assumed complexities involved in the use of these software. This paper throws more light on the need for the use of opensource for enterprise networks especially for such networks for developing economies. Three major open source tools (OpenNAC, PacketFence and FreeNAC) are reviewed to provide a mechanism for assessing and selecting an opensource option for your educational network.