133
edits
Changes
Jump to navigation
Jump to search
==startup clustering==
Super-peer-based Routing and Clustering Strategies for RDF-based Peer-to-peer Networks by Wolfgang Nejdi
@inproceedings{nejdl_super-peer-based_2003,
address = {New York, NY, USA},
series = {{WWW} '03},
title = {Super-peer-based {Routing} and {Clustering} {Strategies} for {RDF}-based {Peer}-to-peer {Networks}},
isbn = {9781581136807},
url = {http://doi.acm.org/10.1145/775152.775229},
doi = {10.1145/775152.775229},
abstract = {RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHORD. RDF-based P2P networks allow complex and extendable descriptions of resources instead of fixed and limited ones, and they provide complex query facilities against these metadata instead of simple keyword-based searches.In previous papers, we have described the Edutella infrastructure and different kinds of Edutella peers implementing such an RDF-based P2P network. In this paper we will discuss these RDF-based P2P networks as a specific example of a new type of P2P networks, schema-based P2P networks and describe the use of super-peer based topologies for these networks. Super-peer based networks can provide better scalability than broadcast based networks, and do provide perfect support for inhomogeneous schema-based networks, which support different metadata schemas and ontologies (crucial for the Semantic Web). Furthermore, as we will show in this paper, they are able to support sophisticated routing and clustering strategies based on the metadata schemas, attributes and ontologies used. Especially helpful in this context is the RDF functionality to uniquely identify schemas, attributes and ontologies. The resulting routing indices can be built using dynamic frequency counting algorithms and support local mediation and transformation rules, and we will sketch some first ideas for implementing these advanced functionalities as well.},
urldate = {2017-10-27},
publisher = {ACM},
author = {Nejdl, Wolfgang and Wolpers, Martin and Siberski, Wolf and Schmitz, Christoph and Schlosser, Mario and Brunkhorst, Ingo and Löser, Alexander},
year = {2003},
keywords = {distributed RDF repositories, peer-to-peer, schema-based routing, semantic web},
pages = {536--543}
Lowest-ID with adaptive ID reassignment by D. Gavalas
@inproceedings{gavalas_lowest-id_2006,
title = {Lowest-{ID} with adaptive {ID} reassignment: a novel mobile ad-hoc networks clustering algorithm},
shorttitle = {Lowest-{ID} with adaptive {ID} reassignment},
doi = {10.1109/ISWPC.2006.1613559},
abstract = {Clustering is a promising approach for building hierarchies and simplifying the routing process in mobile ad-hoc network environments. The main objective of clustering is to identify suitable node representatives, i.e. cluster heads (CHs), to store routing and topology information and maximize clusters stability. Traditional clustering algorithms suggest CH election exclusively based on node IDs or location information and involve frequent broadcasting of control packets, even when network topology remains unchanged. More recent works take into account additional metrics (such as energy and mobility) and optimize initial clustering. However, in many situations (e.g. in relatively static topologies) re-clustering procedure is hardly ever invoked; hence initially elected CHs soon reach battery exhaustion. Herein, we introduce an efficient distributed clustering algorithm that uses both mobility and energy metrics to provide stable cluster formations. CHs are initially elected based on the time and cost-efficient lowest-ID method. During clustering maintenance phase though, node IDs are re-assigned according to nodes mobility and energy status, ensuring that nodes with low-mobility and sufficient energy supply are assigned low IDs and, hence, are elected as CHs. Our algorithm also reduces control traffic volume since broadcast period is adjusted according to the nodes mobility pattern: we employ infrequent broadcasting for relative static network topologies, and increase broadcast frequency for highly mobile network configurations. Simulation results verify that energy consumption is uniformly distributed among network nodes and that signaling overhead is significantly decreased.},
booktitle = {2006 1st {International} {Symposium} on {Wireless} {Pervasive} {Computing}},
author = {Gavalas, D. and Pantziou, G. and Konstantopoulos, C. and Mamalis, B.},
month = jan,
year = {2006},
keywords = {Ad hoc networks, Batteries, Broadcasting, Clustering algorithms, Communication system traffic control, Intrusion detection, Network topology, Nominations and elections, Routing, Stability, ad hoc networks, adaptive ID reassignment, battery exhaustion, broadcast period, broadcasting, cluster heads, clustering maintenance, control packets, control traffic volume, cost-efficient lowest-ID method, distributed clustering algorithm, energy metrics, highly mobile network configurations, infrequent broadcasting, mobile ad-hoc networks clustering algorithm, mobile radio, nodes mobility, nodes mobility pattern, relative static network topologies, routing process, stable cluster formations, telecommunication network routing, telecommunication network topology, topology information},
pages = {5 pp.--}
A P2P hierarchical clustering live video streaming system by De-Kai Liu and Ren-Hung Hwang
@inproceedings{liu_p2p_2003,
title = {A {P}2P hierarchical clustering live video streaming system},
doi = {10.1109/ICCCN.2003.1284158},
abstract = {This paper describes P2broadcast, a novel live video streaming system for P2P networks which organizes peers into hierarchical clusters to reduce startup latency and the service interruption probability. P2broadcast has two key features: highly available and efficient join, and low service interruption probability. The highly available and efficient join algorithm uses RTT of two peers as a hint of available bandwidth between them. As a consequence, the startup latency can be shortened and overhead can be reduced. In addition, P2broadcast constructs a "short and wide" overlay tree which reduces the probability of service interruption due to the leave or failure of a peer. Our simulation results show that P2broadcast outperforms in startup latency and service interrupt probability over existing approaches in the literature.},
booktitle = {Proceedings. 12th {International} {Conference} on {Computer} {Communications} and {Networks} ({IEEE} {Cat}. {No}.03EX712)},
author = {Liu, De-Kai and Hwang, Ren-Hung},
month = oct,
year = {2003},
keywords = {Availability, Bandwidth, Clustering algorithms, Computer science, Delay estimation, IP networks, Information retrieval, Internet, Network servers, Scalability, Streaming media, application level multicasting, hierarchical clustering, live video streaming system, multicast communication, overlay tree network, peer broadcast, peer-to-peer network, round trip time, service interruption probability, startup latency},
pages = {115--120}
@article{peer_are_2013,
title = {Are all startups affected similarly by clusters? {Agglomeration}, competition, firm heterogeneity, and survival},
volume = {28},
issn = {0883-9026},
shorttitle = {Are all startups affected similarly by clusters?},
url = {http://www.sciencedirect.com/science/article/pii/S0883902612000626},
doi = {10.1016/j.jbusvent.2012.03.004},
abstract = {Are all startups similarly affected by the survival benefits and drawbacks of locating in geographic clusters? In this paper, we argue that prior theorizing may have missed important contingencies that affect whether a startup experiences the benefits and costs of locating in a cluster. In particular, while the local levels of skilled labor, suppliers, and purchasers have a beneficial influence and local competition has a detrimental influence on startup survival, these relationships are moderated by heterogeneity in firms' resources and capabilities. We find support for these arguments using a dataset covering the early life of all independent startups in the Canadian manufacturing sector from 1984 to 1998.},
number = {3},
urldate = {2017-10-31},
journal = {Journal of Business Venturing},
author = {Pe'er, Aviad and Keil, Thomas},
month = may,
year = {2013},
keywords = {Agglomeration, Capability, Cluster, Resource, Survival},
pages = {354--372}
Startup Density Literature Review (view source)
Revision as of 13:31, 31 October 2017
, 13:31, 31 October 2017no edit summary
year = {2006},
pages = {204--219}
University start-up formation and technology licensing with firms that go public by Joshua Powers
pages = {109--127}
Who enters, where and why? by Aviad Pe'er @article{peer_who_2008, title = {Who enters, where and why? {The} influence of capabilities and initial resource endowments on the location choices of de novo enterprises}, volume = {6}, issn = {1476-1270}, shorttitle = {Who enters, where and why?}, url = {https://doi.org/10.1177/1476127008090007}, doi = {10.1177/1476127008090007}, abstract = {Some geographical locations have characteristics that create opportunities for de novo enterprises, but not all new firms can access the benefits presented by a potential location. The ability of new firms to appropriate benefit and avoid risk depends on the resources that entrepreneurs can marshal for their enterprise. This article develops a model of the interplay between the attributes of de novo entrants and their founding locations. The model assumes that de novo entrants tend to appear in the region where their founders live, but that founders choose among locations within their regions.The test of the model, using data on all de novo entrants in the Canadian manufacturing sector during 1984—98, reveals that entrants with greater resource and capability endowments are more likely to locate in areas with an agglomeration of similar firms, but this effect reverses at high endowment levels. Additionally, larger entrants are less likely to locate in areas characterized by intense local competition and potential entry deterrence, while smaller and well-endowed entrants tend to locate in areas where entry barriers are lower and asset turnover higher. These findings suggest that entrants choose locations strategically within their founding regions.They also indicate that the strategic imperatives of de novo entrants differ significantly from those of geographically diversifying firms, and thus suggest amendments to theories of location choice when modeling the decisions of new ventures.}, language = {en}, number = {2}, urldate = {2017-10-31}, journal = {Strategic Organization}, author = {Pe'er, Aviad and Vertinsky, Ilan and King, Andrew}, month = may, year = {2008}, pages = {119--149}
Are all startups affected similarly by clusters by Aviad Pe'er and Thomas Keil
@article{peer_are_2013,
title = {Are all startups affected similarly by clusters? {Agglomeration}, competition, firm heterogeneity, and survival},
volume = {28},
issn = {0883-9026},
shorttitle = {Are all startups affected similarly by clusters?},
url = {http://www.sciencedirect.com/science/article/pii/S0883902612000626},
doi = {10.1016/j.jbusvent.2012.03.004},
abstract = {Are all startups similarly affected by the survival benefits and drawbacks of locating in geographic clusters? In this paper, we argue that prior theorizing may have missed important contingencies that affect whether a startup experiences the benefits and costs of locating in a cluster. In particular, while the local levels of skilled labor, suppliers, and purchasers have a beneficial influence and local competition has a detrimental influence on startup survival, these relationships are moderated by heterogeneity in firms' resources and capabilities. We find support for these arguments using a dataset covering the early life of all independent startups in the Canadian manufacturing sector from 1984 to 1998.},
number = {3},
urldate = {2017-10-31},
journal = {Journal of Business Venturing},
author = {Pe'er, Aviad and Keil, Thomas},
month = may,
year = {2013},
keywords = {Agglomeration, Capability, Cluster, Resource, Survival},
pages = {354--372}
Firm Births, Access to Transit, and Agglomeration in Portland, Oregon, and Dallas by Daniel G. Chatman @article{chatman_firm_2016, title = {Firm {Births}, {Access} to {Transit}, and {Agglomeration} in {Portland}, {Oregon}, and {Dallas}, {Texas}}, volume = {2598}, issn = {0361-1981}, url = {http://trrjournalonline.trb.org/doi/abs/10.3141/2598-01}, doi = {10.3141/2598-01}, abstract = {The formation of new firms is one process by which economies grow and innovate. Public transportation services may facilitate the birth of new firms by both providing better access and causing local densification that leads to agglomeration economies. In this study firm births are investigated to determine how they are related to newly provided light rail transit service in two metropolitan areas in the United States. A geocoded time-series database of firm establishments in Dallas, Texas, and Portland, Oregon, from 1991 through 2008 is used. The data set allows the study of spatial patterns by industry and the analysis of the relationship of firm births to rail station proximity, accessibility, and local agglomeration while controlling for a number of potentially confounding factors. Positive, large, and statistically significant relationships are found in Portland between rail station proximity and firm births. The rail proximity results in Dallas are also generally positive, though not as large; this finding is consistent with the smaller accessibility value of rail in Dallas, as well as policies encouraging commercial development near rail in Portland. Rail proximity increases firm births across almost all industrial sectors in both of these metropolitan areas when controlling for the negative effects on firm births of local own-industry employment. Local block-level agglomeration and generalized accessibility are also highly significant but appear to work independently of rail access. These results imply that passenger rail service increases firm births near rail stations by expanding access to the labor market but not by increasing information spillovers or increasing face-to-face interactions.}, urldate = {2017-10-31}, journal = {Transportation Research Record: Journal of the Transportation Research Board}, author = {Chatman, Daniel G. and Noland, Robert B. and Klein, Nicholas J.}, month = jan, year = {2016}, pages = {1--10}
