text:
Collaborative Forwarding and Caching in Content Centric Networks Shuo Guo1 , Haiyong Xie2,3, , and Guangyu Shi3 1
University of Minnesota, Minneapolis, Minnesota 55455 [email protected] 2 University of Science and Technology of China, Hefei, China [email protected] Central Research Institute, Huawei Technologies, Shenzhen, China [email protected]
Abstract. Content caching plays an important role in content-centric networks. The current design of content-centric networks adopts a limited, en-route hierarchical caching mechanism, and caching and forwarding are largely uncoordinated. In this paper, we propose a novel collaborative caching and forwarding design. In this design, collaboration is guided by content popularity ranking, based on which we introduce a collaborative forwarding table to allow coordination between caching and forwarding. We also propose a self-adaptive dual-segment cache division algorithm to deal with dynamic inconsistent content popularity. We evaluate our design via extensive simulations and demonstrate that our design improves content access cost and cache miss rate by at least 30% in a diverse network settings. Keywords: content-centric network, name-based routing, collaborative forwarding and caching.
Content caching plays an important role in content-centric networks (CCN) [25] or named-data networks (NDN) [38]. With routers being able to cache contents in such networks, it is likely that not only the content distribution costs incurred to the network but also the quality of service experienced by end users are significantly improved. Internet content caching, especially collaborative caching, has drawn much attention (e.g., [8,14,16,20,21,23,26,29,32,35,37]) and some have become commercially successful since more than a decade ago. This leads us to believe that collaborative caching in CCN is a key to success in that the network performance could be significantly improved by letting routers collaborate with each other to optimize overall caching performance. Furthermore, forwarding, if coordinated with caching, is likely to further optimize the network performance. The current design of CCN adopts a hierarchical caching mechanism allowing only limited collaboration in content caching. More specifically, for a given
R. Bestak et al. (Eds.): NETWORKING 2012, Part I, LNCS 7289, pp. 41–55, 2012. c IFIP International Federation for Information Processing 2012
S. Guo, H. Xie, and G. Shi
content, caching in CCN takes place only at en-route routers (i.e., routers on the paths between a requesting host and one or multiple content origins), and thus forms a hierarchical caching mechanism. An en-route router that has the requested content will directly respond with the content from its local content store and then suppress further forwarding the request (i.e., Interest) to the next router in the routing hierarchy. With its unique name-based routing architecture and Interest forwarding, CCN advocates a "host-to-content" communication model differing from the "host-to-host" model in Internet. In CCN, where content comes from is no longer important to the requesting host1 . Additionally, not only en-route routers but also routers in the same administrative domain (particularly those nearby en-route routers) could have possibly cached a requested content. These observations suggest that collaborative caching beyond the current limited hierarchical mechanism is feasible and could be beneficial. However, collaborative caching in CCN, if not well designed, could significantly increase the communication overhead. For instance, control messages exchanged among routers, as an example of such overhead, are necessary to enable collaborations. Such messages normally contain information about what contents are stored in a particular router; due to the enormously large number of distinct contents, such messages could consume a significant portion of the network bandwidth. Additionally, the extra latency of exchanging such messages may further slow down the collaborative decision making process and thus reduce the effectiveness. A naive approach to collaborative caching is to adopt a broadcast mechanism, i.e., each request is forwarded to all routers and only those with the requested content respond with the data. However, such an approach is too costly and inefficient. A key challenge to collaborative caching in CCN is how to make routers know what contents are available from other collaborative routers in an economic and efficient manner. Furthermore, since routers have knowledge about such availability information, routers should leverage it when making forwarding decisions; namely, forwarding and caching should be coordinated and collaborative. In this paper, we go beyond the en-route caching mechanism and propose a novel name-based distributed collaborative forwarding and caching design (referred to as CFC for short) for content-centric networks. More specifically, collaboration is guided by content popularity, and content popularity is measured distributively by content routers. Each router maintains an Availability Information Base (AIB for short), estimating which content could be available from which router. Each router also generates a popularity ranking sequence periodically through local measurements and propagated such sequences; after aggregating sequences announced by other routers, each router is able to update its AIB and leverage it to optimize forwarding decisions. However, in practice content popularity is likely different when measured from different routers. In order to deal with such inconsistency seen by different routers, we are inspired by the PodNet Project [24] and propose a self-adaptive dual-segment cache division design, using an additional cache space 1
CCN architecture has measures to ensure content security, which is beyond the scope of this paper.
Collaborative Forwarding and Caching in Content Centric Networks
to handle inconsistent content requests and dynamically adjusting cache division based on different levels of inconsistency. We summarize our contributions as follows. Firstly, to the best of our knowledge, our popularity-ranking based collaborative forwarding and caching scheme for content-centric networks is the first to coordinate forwarding and caching decisions through the availability information base, allowing us to utilize the information of content popularity ranking to reduce the network cost for cache collaboration. When assuming consistent popularity, we theoretically prove the optimality of our design. Secondly, We propose a novel self-adaptive dual-segment cache design to deal with popularity inconsistency. Thirdly, we evaluate the performance of our design via extensive simulations and demonstrate that our design outperforms the hierarchical caching design significantly. The rest of the paper is organized as follows: Section 2 summarizes the related work. Section 3 introduces the network model. Sections 4 and 5 present our collaborative caching design, followed by the evaluations in Section 6. Section 7 concludes the paper with future work.
In recent years there has been a line of work on emerging future Internet architectures (see, e.g., [5,6,15,25,38]). In such architectures, content caching becomes an inherent capability of network elements such as routers. Without specifying the details of content caching, these architectures are designed to allow flexible design and implementation of new caching schemes. However, they also pose new challenges to caching schemes; in particular, it remains unclear how content caching should be provisioned (independently or collaboratively), and how it should be implemented efficiently. To the best of our knowledge, our work is among the first attempts to investigate these issues and provide new insights through comparative evaluations. There is also a large body of literature on content caching in traditional network architectures (see, e.g., [8,14,16,17,20,21,23,26,29,32,33,35,37]). Content caching has been an integral component of Internet-based services for many years, and this has been reflected by the proliferation of content delivery networks (e.g., [3, 4, 11, 27, 28, 30]). Collaborative caching (or cooperative caching) has been a long-lasting research topic. Researchers have not only investigated the effectiveness of collaborative caching (see, e.g., [21, 35]), but also proposed numerous collaborative caching schemes for both general networks and networks with specific structures (see, e.g., [8, 14, 19, 20, 23, 26, 29, 32, 33, 37]); for instance, general Internet-based content distribution (see, e.g., [20, 26, 34]), delivering content of special types (e.g., [29]), content caching in networks with special topological structures (e.g., [8]), and content caching in special networks such as ad hoc networks (e.g., [24]), content-centric networks (e.g., [10, 31, 36], and peer-to-peer networks (e.g., [23]). Our work clearly differs from the above work in that we take advantage of the unique properties of content-centric networks, propose the Availability Information Base guided by the popularity ranking sequence to achieve coordinated
forwarding and caching for content routers, and propose the self-adaptive dualsegment division algorithm to deal with inconsistent popularity.
Network Model
We consider an autonomous system managed by an administrative domain. The network consists of N content routers. Each router i has a local Content Store (CS) that can cache up to Ci content objects ("contents" for short). The size of each content is u at the largest. We assume that content can be chunked into pieces2 , and each piece fits one cache unit (i.e., the size of each piece is no greater than u). Then, the entire network can cache at most Cu of data, N where C = i=1 Ci . Users send requesting packets of "Interest" to their nearest routers (see, e.g., [25]). We use a ranking sequence {r1 , r2 , ..., rC } to denote the most popular C contents, sorted in descending order of popularity. This ranking sequence can be measured in real time as routers receive Interests. All routers may not see the same distribution of content popularity; however, we assume that the ranking sequence {r1 , r2 , ..., rC } measured by different routers have a certain percentage of mismatches or shifts, refer to as the popularity inconsistency. In intradomain, topological information, e.g., link status information and link costs between any pair of adjacent routers i and j (denoted by dij ), is typically distributed by intradomain routing protocols such as OSPF and ISIS. Link costs can correspond to IGP link weights, or other metrics that the content-oriented network cares (e.g., distance, latency). When other metrics are used, they can be distributed across the whole domain via OSPF TLV messages. Other topological information including sizes of Content Stores (Ci 's) and the average rate of arriving Interests (Received Interest Rate for short), denoted by Ii for router i, can also be distributed in the same way as link costs. Note that an Interest contributes to a router's Received Interest Rate only if it is sent to this router by a client, rather than another router. We assume that a router can easily distinguish (by, e.g., adding an additional flag bit in the Interest packets) if an Interest comes from a user, or instead from a collaborative router.
Ranking-Based Collaborative Forwarding and Caching
In this section we present our design for the collaborative forwarding and caching scheme. 4.1
We introduce a new component, the Availability Info Base (AIB for short), to allow us coordinate forwarding and caching in content routers, as shown in 2
Content objects are segmented into pieces in many content-centric networks (e.g., [25, 38]) as well as in many content-oriented overlay networks (e.g., [7, 18]).
Collaborative Forwarding and Caching in Content Centric Networks Forwarding Info Base
Content Store Name
/a/b
... Index Ptr Type CS PIT AIB FIB
Pending Interest Table Name
/e/f
Requesting Faces
Face 0
Name Destination List
... Face 2
Availability Info Base Name
/c/d
Router ID
Fig. 1. Content router with collaborative forwarding and caching
Fig. 1. AIB keeps track of content availability information. More specifically, AIB can be thought of as a table, where each entry has two columns, Name and RouterID, suggesting that a given named content is available from a router. Note that we assume that each router in the network has a name and routers' names are propagated through the network via intradomain routing protocol such as OSPF. As a result, routers' names are treated in the same way as content names and put in FIB. For instance, the outbound face to reach Router R3 is face 3, and content /c/d is available from R3, as shown in Fig. 1. Each content router periodically announces the pairwise link cost and collaborative forwarding/caching related metrics via OSPF or ISIS intradomain routing protocols. Each router also measures the ranking of incoming Interests, namely, examine the received Interests from the users, and generates its local ranking sequence of the most popular C contents. Each router implements the collaborative forwarding and caching mechanism, namely, a distributed mechanism to make joint decisions for forwarding and caching. Additionally, each router measures the miss rate of the interests in order to further improve the caching/forwarding efficiency. Upon receiving an Interest, a router first checks whether the content is available and fresh in its local CS. If yes, the router responds with the locally cached content. Otherwise, it looks up the Pending Interest Table (PIT), and either this Interest should not be forwarded if it is already pending in PIT, or it should be forwarded and PIT be updated accordingly. In the latter case, the router looks up AIB to check whether the content is available from other collaborative routers. If not, the Interest should be forwarded using the default policy in content-centric networks (e.g., look up the outbound face in FIB and forward to the designated face; if FIB lookup fails, use a broadcast-like approach to forward the Interest). Otherwise, the Interest should be forwarded to the designated collaborative router. In order to do so, the router needs to look up FIB to determine the outbound face to reach the designated router. Note that most likely retrieving contents from collaborative routers within an autonomous system saves a noticeable time than getting it from the origin, as the latter typically requires traversing multiple autonomous systems and multiple interdomain links.
Collaborative Forwarding and Caching Mechanism
We next describe the collaborative forwarding and caching mechanism. In our design, each content router keeps track of the most popular C contents. We now assume a consistent popularity model where the most popular C contents at each router results in the same ranking sequence {r1 , r2 , ..., rC }; under this assumption, we need to understand how to optimally distribute these C contents in the N caches in the corresponding N routers, whose sizes are C1 , C2 , ..., CN , so that the average content access cost can be minimized in the network. Recall that Ii denotes the average number of interests received by router i and dij denotes the link cost of nodes i and j (dij becomes the cost of accessing content from the local Content Store when i = j). Such costs can correspond to either intradomain routing weights or other performance-related metrics such as distance and latency. Then, for any cache unit in router i, the average cost of accessing this content requested by users is N I d k=1 k ki costi = , (1) N k=1
where costi is the weighted sum of pair-wise access costs from all N routers. The following theorem states how contents should be optimally distributed to minimize the average content access cost: Theorem 1. Suppose the average cost for accessing the content in a cache unit of router i is costi . Without loss of generality, assume that after sorting, cost1 ≤ cost2 ≤ ... ≤ costN . Also, suppose the ranking sequence is r1 , r2 , ...rC in descending order of popularity. Then, the solution that minimizes the average cost of accessing the most popular C contents in the network is to let the more popular content be cached at a place that has a lower cost, i.e., router 1 caches r1 , ..., rC1 , router 2 caches rC1 +1 , ..., rC1 +C2 , and so on. Proof. The proof is straightforward using contradiction. Suppose in the optimal solution that minimizes the average cost of accessing the C most popular contents, there exists two contents ri < rj (ri is more popular than rj ) stored at routers p and q, respectively. Routers p and q follows costp > costq . Then, by swapping content ri and rj , we get a smaller average content access cost because the frequency of accessing ri is higher than rj . Theorem 1 sheds light on how we should design the distributed collaborative mechanism. More specifically, with the help of intradomain routing protocol, topological information is generally available to each router; as a result, each router can calculate {costi |i ∈ [1, N ]} for all collaborative routers in the network and sort all routers using these values. Following Theorem 1, the most popular contents should be stored by the router with the least cost, and the less popular contents by the router with a larger cost. Therefore, for any top-C popular content, each router knows not only which contents it should keep in its local Content Store, but also which collaborative router it can request this content from, if not locally available. Such availability information for the top-C contents is stored in AIB.
Collaborative Forwarding and Caching in Content Centric Networks Availability Info Base Name a b c d e h g f i k RouterID 3 3 3 2 2 2 2 1 1 1
Availability Info Base Name a b c d e f g h i j RouterID 3 3 3 2 2 2 2 1 1 1
CS g f e d
CS g h e d
Miss on requesting for f
Miss on requesting for f and k Availability Info Base Name a b c d e f g h i j RouterID 3 3 3 2 2 2 2 1 1 1
CS h i j
CS c b a
Fig. 2. A design for collaborative forwarding and caching
Fig. 3. An example of inconsistent ranking sequences
Example 1. We illustrate our design using a simple example shown in Fig. 2. In the example, there are three collaborative routers R1, R2 and R3. These routers can cache 10 contents in total (the size of these three caches are 3, 4, and 3, respectively). The most popular 10 contents measured by these routers are consistent. Suppose cost1 ≥ cost2 ≥ cost3 . Based on Theorem 1, the most popular 3 contents should be cached in router R3, the next 4 contents should be cached in R2, and the next 3 contents should be cached in R1. As shown in the figure, for any incoming Interest requesting for the most popular C contents, AIB tells where it should be forwarded to (the content is either available from the router's local CS or other collaborative routers). 4.3
Dealing with Inconsistent Popularity Ranking
In practice, popularity rankings seen by different routers are more likely inconsistent. In such cases, the efficiency of our CFC scheme will be degraded. Example 2. We illustrate inconsistency in popularity ranking through an example shown in Fig. 3. In this example, router R2's ranking sequence is slightly different from R1's and R3's. In R2's ranking sequence, the positions of content h and f are swapped and content k replaces j. As a result, router R2 caches contents {d, e, h, g}; however, routers R1 and R3 expect that R2 caches {d, e, f, g} instead. Whenever R1 and R3 forward Interests for content f to R2, such Interests have to be further forwarded towards the origin by R2 (not shown in the figure). Similarly, R2 always forwards Interests for content f and k to R1, resulting in cache misses and further forwarding. To address the above problem resulted by inconsistent popularity, we adopt a dual-segment cache design, namely, divide a router's Content Store into two segments: (1) the Advertised Content Store (ACS for short), denoted by Ci , is the regular collaborative cache that is operated the same way as described in the preceding subsection assuming consistent popularity; and (2) the Complementary Content Store (CCS for short), denoted by Ci , is the cache space used for adapting to the inconsistency of popularity distribution. The rationale behind this dual-segment design is to leverage CCS to absorb contents that are
Availability Info Base Name a b c d e h g f i k RouterID 3 3 3 2 2 2 2 1 1 1
Availability Info Base Name a b c d e h g f i k RouterID 3 3 3 2 2 2 2 1 1 1 CS
(a) Single segment
ACS h e d
CCS f
(b) Dual segment
Fig. 4. An example of cache space division
supposed to be store at a router but are missing in its ACS due to inconsistent popularity. Upon receiving an Interest, if the requested content is available locally, the router directly responds with the data. Otherwise, if the Interest comes from another collaborative router, the router forwards the Interest towards the content origin and stores the returned data into its Complementary Content Store when the data comes back; if the Interest comes from a requesting host directly, the router applies its knowledge of popularity-ranking sequence and checks whether the ranking of the requesting content is less than C; If yes, it forwards the Interest to the collaborative router designated by the sequence; otherwise, it forwards the Interest towards the origin. Example 3. Fig. 4 shows an example of this design for router R2 in the previous example. With the single-segment design shown in Fig. 4(a), content f , which is supposed to be cached in R2, is always missing due to the inconsistency of R2's ranking statistics. However, with the dual-segment design shown in Fig. 4(b), R2 only advertise 3 as its cache size. As a result, an extra cache unit can be used to store the missing content f . Therefore, future Interests requesting for f forwarded from routers R1 and R3 can be fulfilled by R2.
Adaptive Content Store Division
The impact of the preceding dual-segment design on the performance of collaborative forwarding and caching in content-centric networks could be subtle. On the one hand, a sufficiently large CCS is more favorable to adapt to the popularity inconsistency; and on the other hand, when the total size of the Content Store is fixed, a smaller CCS is more favorable, as the ACS could be larger to store more frequently requested contents in the network. Clearly there exist trade-offs when determining their sizes. A straightforward solution is fixed division of ACS and CCS, e.g., 90% dedicated to ACS and the remaining to CCS. However, the problem of fixed division is one size does not fit all, namely, routers may experience different levels of popularity inconsistency, and a fixed size may either over-estimate or underestimate the inconsistency level, thus resulting an inefficient use of the cache space. This can be observed in the examples in Fig. 3 and Fig. 4. Router R1 and
R3 experience less popularity inconsistency than R2 does. In fact, they have no cache misses after R2 switches to the dual-segment cache as shown in Fig. 4. As a result, there is no need to allocate any space for CCS in router R1 and R3. We note that the cache miss rate plays an important role in the efficiency of dual-segment collaborative caching. On the one hand, when the miss rate is low, it implies a potentially oversized CCS and thus a waste of cache space. On the other hand, when the miss rate is high, then contents supposed to be stored in a designated collaborative router are actually not stored in it, resulting in additional costs to forward Interests to the designated router and then towards the origin. We design a distributed, self-adaptive algorithm to address the above division problem; specifically, we adjust the division of ACS and CCS based on the dynamics experienced by the content routers. We define the Locking Miss Rate (LMR for short) to characterize the maximum miss rate (corresponding to a maximum level of popularity inconsistency) that a router would like to tolerate. Every router distributively adjusts its size of CCS to make its miss rate closely approach to LMR. More specifically, a router starts with a pre-configured initial cache division, e.g., 90% for the Advertised and 10% for CCS. It then begins measuring the cache miss rate for all Interests received from other collaborative routers. Recall that the size of ACS and CCS are denoted by Ci and Ci respectively. We denote the measured cache miss rate by MR. If MR ≤ LMR, it is likely that the router experiences less popularity inconsistency than expected, we may have an oversized CCS, so the size of CCS Ci is halved so that we increase the size of ACS Ci to cache more contents in the network. If MR > LMR, the popularity inconsistency is likely under-estimated; therefore we should reduce the size of ACS to have a larger CCS in order for accommodating the inconsistency. However, instead of reducing the size of ACS Ci aggressively, we linearly reduce it and allocate more space to CCS Ci based on the following equation: Ci ← (Ci − ΔCi ),
where ΔCi is the size reduced by ACS Ci and increased by CCS Ci . In this equation, the right hand side is a rough estimation of the number of contents expected to be missed (with the current size of CCS Ci unchanged) after the size of ACS Ci is reduced to (Ci − ΔCi ). Ideally, these missed contents are expected to store at the extra space allocated to CCS Ci . With this equation, the percentage the size of ACS Ci is reduced can be calculated by ΔCi MR , = Ci 1 + MR And as a result, the new ACS size should be Algorithm 1.
Ci 1+MR .
(3) This algorithm is shown in
Algorithm 1. Self-Adaptive Division Algorithm 1: 2: 3: 4: 5: 6: 7: 8: 9: 10: 11: 12:
Initialize Ci and Ci such that Ci + Ci = Ci . τ is a pre-determined threshold, e.g., τ ∈ [0, 0.5]. while TRUE do Measure MR for interests from other collaborative routers if (MR < (1 − τ ) · LMR ) then Ci ← 0.5Ci . Ci ← Ci − Ci . else if (MR > (1 + τ ) · LMR) then Ci ← Ci /(1 + M R). Ci = Ci − Ci . end if end while
In this section we systematically evaluate the collaborative forwarding and caching design via simulations. 6.1
Network Topologies. We use the pop-level network topology of Abilene [2] in simulations. Link costs are approximated by the measured end-to-end average latencies using PlanetLab and are in the range of [10, 40]. Note that we also run simulations on other network topologies (e.g., CERNET [12]); however, the results are consistent and thus we omit them here due to space limit. We include two additional nodes to represent content origins in Europe and Asia. For each of these additional nodes, we choose the geographically closest node in each network and connect them. Thus we have a trans-Atlantic link and a Trans-Pacific link. We refer to the topology with these additional nodes and links as the extended topology. In this extended topology, the Trans-Atlantic link cost is 120 and the Trans-Pacific link cost is set to 200. Unless otherwise specified, the cache size of each node is 100 units; we assume contents are chunked into unit-sized pieces, and the total number of content pieces varies from 2000 to 20,000. We assume a 5% LM R by default, and the initial splitting ratio is 90%-10%, i.e., 10% of the cache space is used as the Complementary Cache in the beginning. Content Popularity and Requests. To generate inconsistent content popularity distribution, we use a single ranking sequence following the Zipf distribution [9, 13, 22] and randomly inject noises to 10% of the contents by shifting them to new positions up to a distance of 100 from their original positions in the sequence. We also evaluate different levels of inconsistency by shifting a different percentage of contents in the original sequence in Section 6.4. Interests are generated following the Zipf distribution. The number of interests each router receives directly from users per unit time is randomly chosen from 100 to 500. The adaptive cache division algorithm is run every 50 unit time. The simulation duration in total is 1000 unit time.
Algorithms. We evaluate three schemes using simulations. The first is our collaborative forwarding and caching scheme, referred to as the global collaborative forwarding and caching (GCC). The second is a hierarchical caching approach [8], denoted as HIE, where nodes are divided into two clusters based on their locations and there are two additional nodes serving as the upper-level caches whose size is three times of the size of lower-level caches. The third is a locally clustered variant of GCC, referred to as the local collaborative forwarding and caching (LCC), where nodes are divided into two clusters (in the same way as HIE) and each cluster run its own GCC independently. Note that when evaluating these algorithms, all nodes have an identical caching size in order to make the comparison fair. However, due to the extra two upperlevel caching nodes, the total cache size of HIE is larger than that of GCC and LCC. Performance Metrics. We quantify the performance using two metrics. The first metric is the average cumulative link costs of accessing content by a user, referred to as the Average Access Cost. The second metric is the percentage of interests received by each cache that are not fulfilled locally, referred to as the Cache Miss Ratio. 6.2
Impacts of Number of Contents
We first quantify the performance by varying the number of delivered contents. Fig. 5 summarizes the results of average content access cost in the Abilene networks. We make the following observations. Firstly, as the number of delivered contents increases, the average access cost increases monotonically. This is because with more contents, the percentage of the contents that can be accessed from caches decreases and more contents have to been accessed directly from content sources, leading to higher costs. Secondly, our design, GCC, outperforms HIE and cuts the cost by more than 30%. The reason is that GCC can take full advantage of peer caches, while HIE allows only very limited collaboration between the low-tier and high-tier nodes. Thirdly, the localized collaborative scheme, LCC, enforces a clustered structure, therefore fewer nodes are collaborating with each other, resulting approximately 10% higher cost on average than the global collaborative scheme. Fig. 6 summarizes the results of average cache miss rate. We observe that with HIE, the cache miss rate increases as the total number of contents increases, and that the miss rates are almost an order of magnitude higher than GCC and LCC. HIE does not use popularity information to guide forwarding and caching; instead, it searches local cache and upper-level cache only. As the number of contents increases, the miss rate increases since the percentage of contents can be stored in cache is limited by the size of cache storage. This explains why we see an increasing curve for HIE. For GCC and LCC, we observe that the miss rates largely remain the same, due to LM R being fixed to 5%.
220 200 180 160 140 120 100 80
HIE LCC GCC 2 4 6 8 10 12 14 16 18 20 3
Number of Contents (x10 )
1 0.8 0.6 0.4
HIE LCC GCC
0.2 0 2 4 6 8 10 12 14 16 18 20 3
Normalized Avg. Cost
Avg. Cache Miss Rate
Avg. Access Cost
1.03 1.025 1.02 1.015 1.01 1.005 1
LCC GCC 0 2 4 6 8 10 12 14 16 18 20 LMR (%)
Fig. 5. Average content ac- Fig. 6. Average cache miss Fig. 7. Normalized average cess cost rate access cost vs. LMR
Impact of Adaptive Cache Division
We next evaluate the impact of the adaptive cache division algorithm. More specifically, we quantify the performance of global and local collaborative caching by varying LMR. Fig. 7 plots the impact of cache adaptation on average access cost. Note that the cost is normalized and the total number of contents is 10000 in this figure. We observe that the best performance can be achieved when LM R is approximately 5%. Note that when LM R is in the range of [0.025, 0.1], the average access cost is within 4% of the best performance, suggesting that the performance of GCC and LCC are not sensitive to LM R. Fig. 8 plots the results of cache miss rate. We observe an increasing miss rate as LM R increases, however, it increases slower when LM R is larger than approximately 10%. With a larger LM R, the cache division algorithm tries to keep the cache miss rate around LM R, in order to make the most efficient use of the cache space. When LM R increases from 10% to 20%, the cache miss rate only slightly increases because the miss rate is mainly contributed by the inconsistency of content popularity, which is generated by shifting 10% of contents from a given ranking sequence. 6.4
Impact of Popularity Inconsistency
We next evaluate the impact on the average access cost when the inconsistency in popularity changes. More specifically, we change the percentage of popularity inconsistency from 1% to 30%, while setting the total number of contents to 10000 and keeping all the other network settings the same as in Fig. 5. We summarize the results in Fig.9. We make the following observations. Firstly, the higher the percentage of inconsistency, the higher the average access cost for GCC and LCC. We note that when the percentage of inconsistency is higher, each node allocates larger space to the Complementary Content Store in order to handle requests for contents that are not stored in its Advertised Content Store. The reason these contents are not stored in the Advertised Content Store is that different routers see different sets of contents for a given ranking range. With an increasing percentage of contents shifting from their original positions in the ranking sequence, the union
Fig. 8. Average cache miss rate vs. LM R
HIE LCC GCC 0
Percentage of Inconsistency (%)
Fig. 9. Average access cost vs. popularity inconsistency
of these different sets becomes larger, leading to a larger Complementary Content Store and a smaller Advertised Content Store, which eventually increases the average content access cost due to the reduced number of unique contents stored in the network. Secondly, the average access cost of HIE remains almost the same. The reason is that HIE does not rely on consistency of popularity seen by different nodes, and thus is not affected by popularity inconsistency. However, even when the percentage of inconsistency is as high as 30%, GCC and LCC still improve the average access cost by approximately 30%, due to the reason that HIE does not take full advantage of cache available from other routers nearby, leading to an inefficient use of caching.
In this paper we propose a novel distributed, popularity-guided collaborative forwarding and caching design for content-centric networks, where we introduce an Availability Information Base to allow coordination between forwarding and caching in content routers. In order to deal with popularity inconsistency in realistic networks, we also propose a self-adaptive dual-segment cache division algorithm. We evaluate our design via extensive simulations and demonstrate that our design improves content access cost and cache miss rate by at least 30% in a diverse network settings. There are many avenues to future work. We plan to implement a prototype based on CCNx [1] and conduct medium- to large-scale experiments. This also gives us opportunities to investigate the complexity and feasibility of the proposed framework. We also plan to theoretically model and analyze the impacts of popularity inconsistency on the effectiveness of the proposed design. Acknowledgements. This work was partially supported by the National Natural Science Foundation of China under Grant No. 61073192, by the Grand Fundamental Research Program of China (973 Program) under Grant No. 2011CB302905, by the New Century Excellent Talents Program, and by the Fundamental Research Funds for Central Universities under Grant No. WK0110000014.
References 1. CCNx, http://www.ccnx.org 2. Abilene: Internet2 IP IGP Metrics, http://noc.net.internet2.edu/i2network/maps--documentation/maps.html 3. Akamai Technologies, http://www.akamai.com 4. Amazon CloudFront Express, http://www.amazon.com/cloudfront 5. Anand, A., Dogar, F., Han, D., Li, B., Lim, H., Machadoy, M., Wu, W., Akella, A., Andersen, D., Byersy, J., Seshan, S., Steenkiste, P.: XIA: An architecture for an evolvable and trustworthy internet. Tech. Rep. CMU-CS-11-100, Carnegie Mellon University (February 2011) 6. Anderson, T., Birman, K., Broberg, R., Caesar, M., Comer, D., Cotton, C., Freedman, M., Haeberlen, A., Ives, Z., Krishnamurthy, A., Lehr, W., Loo, B.T., Mazires, D., Nicolosi, A., Smith, J., Stoica, I., van Renesse, R., Walfish, M., Weatherspoon, H., Yoo, C.: NEBULA - a future internet that supports trustworthy cloud computing. White Paper (2010) 7. BitTorrent, http://www.bittorrent.com 8. Borst, S., Gupta, V., Walid, A.: Distributed caching algorithms for content distribution networks. In: IEEE INFOCOM 2010, San Diego, CA (March 2010) 9. Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and zipf-like distributions: evidence and implications. In: Proc. IEEE INFOCOM 1999, vol. 1 (March 1999) 10. Carofiglio, G., Gallo, M., Muscariello, L., Perino, D.: Modeling data transfer in content-centric networking. In: ITC 2011, pp. 111–118 (2011) 11. CDNetworks, http://www.cdnetworks.com 12. Cernet: Cernet Topology, http://www.edu.cn/20060111/3170194.shtml 13. Cheng, X., Dale, C., Liu, J.: Statistics and social network of youtube videos. In: Proc. IWQoS 2008, pp. 229–238 (June 2008) 14. Chow, C.Y., Leong, H.V., Chan, A.T.S.: Distributed group-based cooperative caching in a mobile broadcast environment. In: Proc. of Mobile Data Management 2005, pp. 97–106 (2005) 15. Dannewitz, C.: NetInf: An information-centric design for the future internet. In: Proc. 3rd GI/ITG KuVS Workshop on the Future Internet (May 2009) 16. Dilley, J., Maggs, B., Parikh, J., Prokop, H., Sitaraman, R., Weihl, B.: Globally distributed content delivery. IEEE Internet Computing, 50–58 (September/October 2002) 17. Dykes, S., Robbins, K.: A vaibility analysis of cooperative proxy caching. In: IEEE INFOCOM 2001, pp. 1205–1214. Anchorage, AK (2001) 18. eMule-Project.net, http://www.emule-project.net 19. Erman, J., Gerber, A., Hajiaghayi, M.T., Pei, D., Sen, S., Spatscheck, O.: To cache or not to cache: The 3g case. IEEE Internet Computing 15, 27–34 (2011) 20. Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Trans. Netw. 8 (June 2000) 21. Gadde, S., Chase, J., Rabinovich, M.: Web caching and content distribution: a view from the interior. Computer Communications 24(2), 222–231 (2001) 22. Gill, P., Arlitt, M., Li, Z., Mahanti, A.: Youtube traffic characterization: a view from the edge. In: Proc. ACM IMC 2007. ACM, New York (2007) 23. Hefeeda, M., Noorizadeh, B.: On the benefits of cooperative proxy caching for peer-to-peer traffic. IEEE Transactions on Parallel and Distributed Systems 21, 998–1010 (2010)
24. Helgason, O., Karlsson, G.: Podnet: A system architecture for opportunistic content distribution. Tech. rep., Royal Institute of Technology (KTH) (February 2010) 25. Jacobson, V., Smetters, D.K., Thornton, J.D., Plass, M.F., Briggs, N.H., Braynard, R.L.: Networking named content. In: ACM CoNEXT 2009, Rome, Italy (December 2009) 26. Korupolu, M.R., Dahlin, M.: Coordinated placement and replacement for largescale distributed caches. IEEE Transactions on Knowledge and Data Engineering 14, 1317–1329 (2002) 27. Level3 Communications, http://www.level3.com 28. Limelight Networks, http://www.limelight.com 29. Ni, J., Tsang, D.: Large-scale cooperative caching and application-level multicast in multimedia content delivery networks. IEEE Communications Magazine, 43(5) (May 2005) 30. Pathan, M., Buyya, R., Vakali, A.: Content delivery networks: State of the art, insights, and imperatives. In: Buyya, R., Pathan, M., Vakali, A. (eds.) Content Delivery Networks. LNEE, vol. 9, pp. 3–32. Springer, Heidelberg (2008) 31. Psaras, I., Clegg, R., Landa, R., Chai, W., Pavlou, G.: Modelling and Evaluation of CCN-Caching Trees. In: Domingo-Pascual, J., Manzoni, P., Palazzo, S., Pont, A., Scoglio, C. (eds.) NETWORKING 2011, Part I. LNCS, vol. 6640, pp. 78–91. Springer, Heidelberg (2011) 32. Sailhan, F., Issarny, V.: Cooperative Caching in Ad Hoc Networks. In: Chen, M.-S., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds.) MDM 2003. LNCS, vol. 2574, pp. 13–28. Springer, Heidelberg (2003) 33. Sarkar, P., Hartman, J.H.: Hint-based cooperative caching. ACM Trans. Comput. Syst. 18 (November 2000) 34. Wessels, D., Claffy, K.: Internet cache protocol (icp), version 2 (1997) 35. Wolman, A., Voelker, M., Sharma, N., Cardwell, N., Karlin, A., Levy, H.M.: On the scale and performance of cooperative web proxy caching. In: Proc. ACM SOSP 1999, pp. 16–31 (1999) 36. Xie, H., Shi, G., Wang, P.: TECC: Towards collaborative in-network caching guided by traffic engineering. In: IEEE INFOCOM 2012, Orlando, FL (March 2012) 37. Yin, L., Cao, G.: Supporting cooperative caching in ad hoc networks. IEEE Transactions on Mobile Computing 5, 77–89 (2006) 38. Zhang, L., Estrin, D., Burke, J., Jacobson, V., Thornton, J.D., Smetters, D.K., Zhang, B., Tsudik, G., Claffy, K.C., Krioukov, D., Massey, D., Papadopoulos, C., Abdelzaher, T., Wang, L., Crowley, P., Yeh, E.: Named data networking (NDN) project. Tech. Rep. NDN-0001, Palo Alto Research Center (PARC) (October 2010)
Social Caching and Content Retrieval in Disruption ...
Mobility support through caching in content-based ...
Modeling the dynamics of caching in content-based publish/subscribe ...
Caching in content-based publish/subscribe systems
Content-Boosted Collaborative Filtering
Collaborative and Content-based Image Labeling
Webquest: a collaborative strategy to teach content and language on ...
Semantic content ranking through collaborative and ...
A Web Platform for Collaborative Multimedia Content ...
Compressing Forwarding Tables
Partial Mocks using Forwarding Objects
Secured Two Phase Geographic Forwarding Protocol in ... - CiteSeerX
The Effect of Caching in Sustainability of Large Wireless Networks
Overhearing-aided Data Caching in Wireless Ad Hoc Networks
Caching layer PageSpeed server - GitHub
Contention-Aware Data Caching in Wireless Multi-hop ...
Efficient Caching Mechanism in Proxy Servers
FRuG: A Benchmark for Packet Forwarding in Future ...
Geographically Fair In-Network Caching for Mobile Data Offloading
Bankshot: Caching Slow Storage in Fast Non-Volatile ...
Collaborative Forwarding and Caching in Content ...
the paths between a requesting host and one or multiple content origins), and thus forms a ... To the best of our knowledge, our work is among the first ... as ad hoc networks (e.g., [24]), content-centric networks (e.g., [10,31,36], and peer-to-peer ...... the scale and performance of cooperative web proxy caching. In: Proc.
Epidemic routing [10], which floods the entire network. ... popular data at high social-level nodes to which most content ... 2015 International Conference on Computing, Networking and Communications, Wireless Ad Hoc and Sensor Networks.
Most recommender systems use Collaborative Filtering or ... file. Because of these reasons, CF systems have been used ..... -means clustering algorithm.
Sep 7, 2007 - isaperez2: I have a new computer and can do everything on it yet. Vance_XP: ... isaperez2: http://poster.4teachers.org/worksheet/view.php?
model, since, for every new activity, the company needs to invest time and ... ly applied to extract relevant information from Internet .... The typical way to access.
Feb 19, 2009 - quack after the race. EasyMock.replay(mock);. Duck duck = OlympicDuck.createInstance();. Duck partialDuck = new ForwardingDuck(duck) {.
today, [1]. In this context, network caching has a key role, as it can mitigate these inefficiencies ... nectivity, and deliver high quality services as the ones already.
www.example.com/index.html. PageSpeed server. Partially rewritten response for www.example.com/index.html with reinstrumentation done. Cache miss/expiry.
... download popular contents (e.g., maps of a city, shopping information, social media, ... content popularity, even limited-size caches at the network edges can ... locations in the network. ..... store only copies of the most popular contents and
Report Collaborative Forwarding and Caching in Content ...


Jeffrey, C. 2007. Tribe Gymnarrheneae. Pages 147-148 in Families and Genera of Vascular Plants, vol. VIII, Flowering Plants, Eudicots, Asterales (J. W. Kadereit and C. Jeffrey, eds.). Springer-Verlag, Berlin.
Page: Tree of Life Gymnarrhenoideae Panero & Funk. Gymnarrhena micrantha Desf.. Authored by Jose L. Panero. The TEXT of this page is licensed under the Creative Commons Attribution-NonCommercial License - Version 3.0. Note that images and other media featured on this page are each governed by their own license, and they may or may not be available for reuse. Click on an image or a media link to access the media data window, which provides the relevant licensing information. For the general terms and conditions of ToL material reuse and redistribution, please see the Tree of Life Copyright Policies.


Advisor and long-time FDA nutrition and nutritional complement labeling specialist James Summers bargains a entire consultant to figuring out and complying with the nutritional complement labeling necessities of the nutrients and Drug management (FDA) in nutritional complement Labeling Compliance overview, 3rd Edition.
* Sections I via V include the creation and how-to information.
* Sections VI via IX include the compliance step by step evaluate method (in the shape of questions and responses,) and different labeling requirements.
* Sections X via XV include assistance and data for choice making.
This quantity summarizes the present wisdom at the alternate of hint gases among forests and the ambience with the limit that completely carbon and nitrogen compounds are incorporated. For this function the amount brings jointly and interconnects wisdom from varied disciplines of organic and atmospheric sciences.
The dynamic nature of interpreting the data in messenger RNA was once unanticipated on the time the genetic code was once first deciphered. We now recognize that either the which means of person codons and the framing of the readout approach should be converted by means of details in particular messenger RNAs. This e-book describes this "Recoding" phenomenon, revealing the variety of an extra layer of knowledge in mRNAs that serves to counterpoint the expression of genes.
CP violation is a well-established phenomenon in particle physics, yet till 2001 it was once simply saw in kaons. within the final decade, a number of matter-antimatter asymmetries were saw in impartial B mesons according to the expectancies of the traditional version of the vulnerable interplay. Direct CP violation is additionally anticipated within the decay premiums of charged B+ mesons as opposed to that of B- mesons, even though the best results are found in a decay that happens simply two times in 10 million decays.
This quantity bargains a complete overview of modern advances in examine at the vascular endothelium. It offers a historic heritage and a consultant for destiny instructions in learn. This ebook includes 20 chapters through a various crew of authors who've all made major contributions to the sector of analysis within the vascular endothelium.
For flavoring. 5 (Continued) Part 2. , "strawberries in strawberry shortcake,"and the food contains natural flavor derived from the characterizing ingredient and in an amount insufficient to independently characterize the food, or the food contains no such ingredient. , "natural strawberry flavored shortcake" or "strawberry flavored shortcake. , lime used as flavor in product labeled as lemon drink. , lime flavor, or as artificially lemon flavored. c) If the food contains both a characterizing flavor from the product whose flavor is simulated or other natural flavor which simulates, resembles, or reinforces the characterizing flavor.
4(g), as appropriate. A. 36(d/? A. If "YES," continue. B. If "NO," state that the product is fabricated from two or more ingredients, but its label fails to declare each ingredient in the dietary supplement by its common or usual name. Does the ingredient statement appear immediately below the Supplement Facts box, except that if there is insfltcient space below the Supplement Facts box, it appears immediately contiguous and to the right of the Supplement Facts box? A. If "YES," continue. B. 36(g).
47 Chapter VI Does the declaration appear in conspicuous and easily legible bolwbce print or type in distinct contrast (bar typography, layout, color embossing or moldin@ to other matter on the package? [NOTE: An exception to this requirement is made when the declaration of net quantity is blown, embossed, or molded on a glass or plastic surface when all label information is so formed on the surface. (27 CFR 7 0 7 . 7 05(h))] . , no more than three times as high as it is wide); Letter heights pertain to upper case or capital letters; When upper and lower case or all lower case letters are used, it is the lower case letter "0" or its equivalent that shall meet the minimum standards; and When fractions are used, each component numeral shall meet one-half the minimum height standards.


Responsible for printing CD & DVD's album covers, your logo on your merchandising products, flyers, posters...They provide digital printing services.
Provides digital colour printing & mailing services, variable data printing. Xerox partner.
Specialized in printing & packaging for music, film & games products.
Music printers & packaging specialists.
Amarok is a specialized CD & DVD printer, which offers full co lour digital, thermal, silkscreen print & graphic design.
Offers different printing solutions ranging from inkjet, thermal, screen, lytho & no-on body print.
Provides a full service CD & DVD services including media printing as well as offering a wide range of CD & DVD shapes including business cards.
Supplies CD, DVD, disk labels using screen, colour thermal and inkjet printing.


10 Telephone Interview Mistakes You Don't Want to Make – tech360 We Staff I.T.
Let's face it, applying for a job has never been easier. The Internet, smartphones and cloud services have made it fairly simple and quick to apply to job postings "on the fly". As a result, companies and recruiters sometimes get hundreds of responses to a single job posting. Recruiters and corporate HR departments have several methods for scaling down responses to a manageable pile, but that is a topic for another post.
It is rare these days to get an "in person" interview without first going through a telephone interview. As you know, the purpose of a telephone interview is to screen potential candidates and further pare down the list to a short list of individuals who will be asked to interview in person. While these initial telephone screening interviews might seem like a formality, they are not. You would be surprised how many people make simple but fatal mistakes during a telephone interview. If you can't successfully make it through a telephone interview, you have no chance of making it through an in person interview. This is like a "take at home tests", you can (and should) have whatever materials you need right in front of you – there are no excuses. Which of these mistakes have you made?
Make sure you have a quiet area where you can take the telephone interview. Standing in the middle of Grand Central Station or outside on the street is not the way to do it. Not only will you not be able to hear the interviewer, but they will not be able to hear you clearly and will think that you are not taking the interview seriously. Scout out a few potential quiet spots in advance of the telephone interview and test them out with a friend or family member.
You need to have done your homework and researched the company that is interviewing you. You must know (at a minimum), what the company does, who their competitors are and why you want to work for them. To the extent possible (and LinkedIn is a great place to start), learn all you can about the interviewer(s) as well.
Depending on circumstances, you may need to use your cellphone for your telephone interview. If that's the case, make sure that wherever you do your call you have good telephone reception. There is nothing worse than having the call drop or not being able to hear the interviewer (or them hearing you). Scout out some areas a day or two before the call so that you can test the reception. Make sure your phone is fully charged as well.
You are interviewing for a job that is a great fit for you. You should have read the job description and you should be familiar with it. The best part is that you can have the job description right in front of you for reference while you are interviewing, but you should not be reading it for the first time. Take notes and highlight potential questions prior to the interview. You may expect that the interview is a high level screening, but it would not be unusual to be asked very detailed questions.
Your dog might be ready for a walk but you are in the middle of an interview. Your spouse may be looking for you to run some errands and your children think you are taking them out to play. If you are making your call from home or a common area, focus on the conversation on hand. Make sure your family knows you are on a telephone interview so that you are not interrupted. Make sure you've cleared your calendar and not one is expecting you to be available.
It's more difficult to get the ebb and flow of conversation in a telephone interview as compared to an in person interview. Listen for cues from the interviewer and be careful not to dominate the conversation when it's your turn to speak. While you will want to direct the conversation to your skills and experience, allow the interviewer to ask all of their screening questions.
You might find this hard to believe, but there are people who get an incoming call and then ask their interviewer to "hold on". Needless to say, it is doubtful they will make it to the next round. Turn off your call waiting, email notices, Facebook notices and Twitter notices while you are on your call.
You may have read the job description and done your homework in terms of the company, but have you prepared both, answers to questions that might be asked and questions that you may have? Some interviewers will ask open ended questions like – "Why do you want to work here?", "What attracts you to XYZ company?", "Why do you think you are a good fit for this position?". Be prepared.
Keep focused and engaged during the interview. When you speak about your experience, be confident about your achievements. While the interviewer may ask difficult questions or challenge your achievements, stand firm in your conviction of your accomplishments and qualifications.
Don't speak badly of your current employer. The interviewer knows you have reasons for looking for new employment. Let your reasons be about career advancement and better opportunity. Regardless of any difficulties in your current job, it will not help your cause to complain about these issues during your interview.
via 10 Telephone Interview Mistakes You Don't Want to Make – CareerAlley.


If your air conditioner is not turning on there are number of reasons behind that. Some problems can be fixed manually but some of them must be left for the experts to handle.
There is a possibility that you might have not programmed your thermostat properly check that your thermostat is set to cool and should be minimum 5o bellow than your normal temperature.
There is a chance that your thermostat is having some defects. Try to turn the unit on from the central unit.
Dirty air filters are the most common reasons for this problem. Change the filters if they are dirty. Proper maintenance of the unit can help you avoid this problem.
Most number times if your motors are defective your air conditioner will shut down. Call the professional to check the motor if you can't repair than you have to be ready to buy a new one.
Look around for your electric panel turn off your tripped breakers and turn it on again. If the breaker trips again, call the technician.
Your ac unit will not come on if there is any problem in the compressor. Proper maintenance of your compressor is necessary to avoid this problem.
Your ac unit will turn on if there isn't sufficient refrigerant available in your compressor or leakage off refrigerant.
Go outside the house search for the condensate drain line. Connect the vacuum hose to clean the condensate.
If the above tricks don't work than there is a bigger problem in your system it is the time to call the professional to check the unit.


text:
Katsuura se poate referi la:

 Municipiul Katsuura, o localitate în Japonia, în prefectura Chiba
 Orașul Katsuura, o localitate în Japonia, în prefectura Tokushima
 Asteroidul 12469 Katsuura, un corp ceresc numit după municipiul Katsuura (pref. Chiba).

redpajama_set_name: RedPajamaWikipedia


text:
Series: The Breakdown
Hillary Clinton's Top Five Clashes Over Secrecy
The latest flap over her private emails as secretary of state is far from the first time she's been accused of lacking transparency.
by Jeff Gerth
March 13, 2015, 8 a.m. EDT
How politics and government really work, and why they don't.
Back in April of 2007, when she was campaigning for the Democratic presidential nomination for the first time, then-Senator Hillary Clinton lashed out at the secrecy of the George W. Bush administration.
She told a New Hampshire audience that if elected she would implement a "plan to enhance accountability and transparency" and "to replace secrecy and mystery with openness." One part of her plan: "It's time our government went fully online as well."
She lost her White House bid. But 20 months later, before Barack Obama took that job and she became secretary of state, she set up a private computer server registered to her home in Chappaqua, N.Y., to handle all her official, as well as private, emails for the next four years. Her decision — a secret until earlier this month — impeded efforts by the press and others to review State Department actions.
Today it is Hillary Clinton's record of transparency that has come under fire. At a press conference Tuesday, she acknowledged that in retrospect "it would've been better for me to use two separate phones and two email accounts." She has asked the State Department to release her official emails, a process that could take months.
Few public figures have been as scrutinized as Hillary Clinton. Sometimes her disclosures go beyond what is required, but she's also racked up a reputation for secrecy that at times has returned to haunt her.
Here are five examples covering the last two decades. Some are drawn from a 2007 book I did, with Don Van Natta Jr., entitled "Her Way: The Hopes and Ambitions of Hillary Rodham Clinton. (Little Brown & Co.) Clinton's office didn't respond to a request for comment.
1) 1992: The Commodity Trades
During Bill Clinton's first run for the White House, his campaign declined to release all of the couple's tax returns. Later it emerged that the campaign had weighed requests from the press and decided not to do so, because a few of the returns showed Hillary Clinton's spectacular success in commodities trading, in which she made almost $100,000 from an initial investment of $1,000 in a matter of months for a return of almost 10,000 percent. Hillary Clinton threatened a campaign lawyer who had access to the material with retribution if she released the data: "You'll never work in Democratic politics again," the lawyer, Loretta Lynch, says Clinton told her. It wasn't until 1994, as the New York Times prepared to publish an article detailing the trades, that the Clintons made public the returns.
2) 1993: The Health Care Task Force
As First Lady, Clinton led a presidential task force to overhaul the U.S. health care system. The group, which produced a 1,342-page bill that failed to win approval, came under intense criticism from lawmakers and interest groups for meeting behind closed doors. Several court challenges were brought in an attempt to open the process. Ultimately the courts provided a partial legal victory to the administration. Clinton later wrote she didn't mind the criticism since she was "trying to do something important for people" but acknowledged the failure was partially the result of her "own missteps" in "trying to do too much, too fast."
3) 1994: Records from the Rose Law Firm
U.S. investigators in 1994 subpoenaed the First Lady's billing records from her years at the Rose Firm in Little Rock, Arkansas, documents that had been also sought by reporters. A focus of their interest was her legal work for a failing savings and loan, but records of those billings weren't found. Much later, Clinton's long-time assistant, Carolyn Huber, said she found in the White House residence an additional box of records that contained the billing memos. They were turned over to the independent counsel in 1996. Clinton testified she had no knowledge of how the records wound up where they did.
4) 2006: The Energy Task Force
Late in her first term as U.S. senator from New York, Clinton set up an energy task force to help her work through the issue, deliver a major speech on the subject and prepare for a possible presidential run, participants in the task force told us for the book. They produced a 40-page report in April 2006. The whole project, including the existence of the group, its members and its work product was a secret, designed, participants said, to encourage frank discussions of the issue. The leader of the task force headed an investment firm with major holdings in the energy sector. Senators routinely get input from outsiders and no law requires their disclosure, but a secret task force is unusual.
5) 2015: The Family Foundation
The Clinton family foundation, now called the Bill, Hillary and Chelsea Clinton Foundation, made disclosures that exceed the legal requirements. Charities are not required to list donors, but as part of Clinton's selection as secretary of state the foundation agreed to disclose the identity of contributors and restrict solicitations from foreign governments. Still, the information on the foundation's website is less than full. Donors are identified but not the exact amount of each donation or the date of those contributions. Instead donations fall under ranges and are listed cumulatively. The foundation did not announce that it started raising money from foreign governments after Hillary Clinton left office. But last month the Wall Street Journal pieced together some new foreign donations after the foundation's web site was updated. That article was the first in a spate of news accounts raising questions about foreign money coming into the Clinton network as she prepares a run for president. The foundation has said donors are carefully vetted and their money goes to important charitable projects.
Jeff Gerth
Jeff Gerth was a senior reporter at ProPublica. Previously, Gerth worked as an investigative reporter at The New York Times. He has twice been awarded the Pulitzer Prize.

redpajama_set_name: RedPajamaCommonCrawl


The type specimen used for original description comes from Brazil, Amazonas.
Mauesia acorniculata Julio, 2003 is the full name of the group-species in the taxonomic classification system.
The species is combined with the Mauesia genus ranked in the Mauesiini tribe of Lamiinae.


text:
Download Dead Man Escape for PC – Windows and Mac OS X
0.0 00 Dead Man Escape, an adventure game develop by Era Hoffman, has now been made available for smart devices worldwide. It is completely free and you can download it easily from Google play for your smart devices. Those of…
January 25, 2016 · by	Umar Ashraf ·
Elite Killer SWAT for PC – Windows and Mac
0.0 00 As now the most recent action packed FPS, Elite Killer SWAT has landed in the app stores for both Android and iOS platforms, we have good news for the PC (Windows and Mac) lovers. For those who love to play…
BLEACH Brave Souls for PC (Windows and Mac)
3.5 02 Another 3D action packed game has been made available worldwide for smart devices including both Android and iOS platforms. For those who love to watch anime or read manga, BLEACH Brave Souls is no less than a dream. It is an…
Crisis Action FPS eSports for PC – Windows and Mac
5.0 01 Good news for the FPS gamers as the latest FPS game, Crisis Action FPS eSports has been made available for both Android and iOS platforms. With over 10 million online gamers everyday, Crisis Action FPS eSports is now topping the…
Shipwrecked New World for PC (Windows and Mac)
0.0 00 Shipwrecked New World is a thriving adventure game that allows you to explore a mythical island to find a supporting habitat. All started when a thunderstorm wrecked the ship you were travelling in, now you must have to help the…
Rolling Sky for PC (Windows and Mac)
5.0 05 Another puzzle game, Rolling Sky is ready to hit the big screens of your Windows PC and Mac devices. It is an iOS exclusive game and isn't available in all app stores therefore, you cannot directly install it on…
Brick Breaker Hero for PC – Windows and Mac
0.0 00 Brick Breaker Hero, a perfect game developed by Game Circus LLC to test your control and management skills. It is based on the concept of typical brick breaker game, but with an addition of new twist. The gameplay is simple, pretty…
Piano Tiles 2 for PC (Windows XP/7/8/8.1/10 and Mac)
3.0 09 Another amazing music oriented game, Piano Tiles 2 is getting your attention and therefore, we have decided to list down the necessary steps to install this amazing game on your PC (Windows and Mac) devices. Following this guide and you'll be…
Download Genies and Gems for PC
4.3 03 Genies and Gems is a new match-3 puzzle game for smart devices including both smartphones and tablets. Due to an interesting story-line and colorful gameplay it is quite famous now-a-days. It features the story of Jenni the genie and her…
World Chef for PC (Windows and Mac)
3.4 05 The mouth-watering World Chef is now available in all app stores. It is so addicted that one cannot simply contain it to the smart devices. Therefore, for food lovers who cannot resist the delicious recipes we have compiled this guide.…


This book "The clarifying Discussion of Mistakes Done in Salāt" discusses many mistakes that are commonly committed by praying Muslims. The authenticity of some of which is not established; on the contrary they are mere innovations. And others are some optional or obligatory acts that are not done in their proper positions or in the appropriate manner. No doubt that plotting away false beliefs and misconceptions from peoples' minds and hearts by establishing truth instead, is on of the greatest paths of calling to that which is one good [i.e. calling to Allāh aza wa jal]..


text:
Paris Herouni
This article may require copy editing for grammar, style, cohesion, tone, or spelling. You can assist by editing it. (July 2019) (Learn how and when to remove this template message)
(1933-12-17)December 17, 1933
Yerevan, Soviet Armenia
December 5, 2008(2008-12-05) (aged 74)
Yerevan, Armenia
Moscow Power Engineering Institute
creation of the "Herouni Mirror Radio telescope"
USSR State Prize (1986)
Radiotechnical systems
National Polytechnic University of Armenia
Paris M. Herouni (Armenian: Պարիս Հերունի, December 17, 1933 – December 5, 2008)[1][2] was an Armenian physicist and engineer. He was a member of National Academy of Sciences of the Republic of Armenia in the fields of radio-physics, radio-engineering, and radio-astronomy. He was the head of the "Antenna Systems" chair (which he founded), in the National Polytechnic University of Armenia, as well as the Radio physics Research Institute (RRI). In 1986 he was awarded the USSR State Prize.
2 Scientific works
3 Other research
4.1 in English
4.2 in Russian
Herouni was born in Yerevan, Armenia on December 17, 1933. His father was a genocide survivor from Hadjin. Upon completion of his undergraduate studies in Yerevan, Herouni attended Moscow Power Engineering Institute, where he got his graduate degree in radio technology in 1957. He would go on to get his doctorate of philosophy in radio techniques from the same institution in 1965. Herouni became an associate professor in 1968 and a full professor in 1983. Because of his many scientific discoveries, Herouni has received numerous awards, such as the Order of the Red Banner of Labour, Silver Medal of Catholicos of All Armenians (given to him by Vazgen I), State Prize of Soviet Armenia in the field of Science (1985), Medal "Veteran of Labour", a Bronze Medal from the Ministry of Foreign Affairs of France, and the Russian Academy of Sciences Lomonosov Gold Medal.[3]
In addition, he also holds over 20 patents and has published over 340 scientific works, including two monographs.[4]
Scientific works[edit]
Herouni's scientific discoveries and theories include his theory and calculations on the Method of the Large Double mirror Antennas with Fixed Spherical Main Mirror, Theory and equations of electromagnetic field diffraction on the holes (apertures) of different configurations, Radio holography - methods of field determination in space by measurements of complex field near (NF) of the emitting or scattering objects, Methods of Near–to-Far (NF - FF) measurements of antennas and scattering objects parameters, Theory of field diffraction in antenna edges when illuminates the part of main aperture, and Antenna Metrology direction.
Among his many experiments are his Projected, built, and adjusted which was used for the First Radio-Optical Telescope (ROT-54/2.6) – the "Herouni Mirror Radio telescope" – the large antenna of which with a diameter 54 m has one of the best parameters[5] among all Large Antennas in the world. He concluded and built an Antenna Parameters and Phase Shift Angle, being the first 11, based on the World National Primary Standards. The "AREV" Project, which is a new type of powerful and ecologically pure Solar Power Plant. He was the first to come across the powerful radio-flare on Eta Geminorum star, a red giant and the powerful flares associated with that type of star. He also was the first to measure an aperture of an antenna, in the World Radio Hologram. Using this, he designed and built many highly, effective Automatic Complexes of equipment for NF –FF Antenna Measurement.[6]
Other research[edit]
Later he turned his attention to megalithic structures, such as Carahunge (sometimes referred to as Zorats Karer) in Armenia. By using four telescopic methods, and the precession laws of Earth, he argued that Zorats Kaher is more than 7500 years old; dating it to around 5500 BC. According to him, some of the stones mirror the brightest star of Cygnus constellation - Deneb. Herouni wrote about his claims in his 2004 book, Armenians and Old Armenia[7]. Archaeostronomer Clive Ruggles, writing about the site, stated that "Inevitably there have been other claims—more speculative and less supportable—relating to the astronomical significance of the site. One is that it can be astronomically dated to the sixth millennium B.C.E. And direct comparisons with Stonehenge, which few now believe was an observatory, are less than helpful."[8] An overview of ancient astronomy in the Caucasus region briefly discussed Carahunge, citing a preliminary report of a recent survey as evidence that Carahunge indicated astronomical alignments to the Sun, Moon, and selected stars. The authors consider that Carahunge may have been a dual purpose site: a burial place for a significant person and a place for astronomically related ritual.[9] A critical assessment found several problems with the archaeoastronomical interpretations of the site. The northeast avenue, which extends about 50 meters from the center, has been inconsistently associated with the summer solstice, the major northern lunistice, or the rising of Venus.[10] However, this must remain conjectural as the holes are relatively unweathered and may not even be prehistoric in origin.[11] Herouni had postulated that in order to use the holes in the megaliths for astronomical observations sufficiently precise to determine the date of the solstices, it would have been necessary to restrict the field of vision by inserting a narrow tube in the existing perforations. Without these modifications, for which there is no archaeological evidence, the claimed astronomical significance of the orientations of the holes vanishes. As a consequence, González-Garcia concluded that the archaeoastronomical claims for the site are untenable, although further investigations to determine the astronomical potential of Carahunge and similar sites are merited.[12]
Herouni also invented solar energy plant AREV-1 which is a 100 kW solar power plant based on heat absorption of reflected sunbeams and rotating a compressor by the heated air to generate power[13].
in English[edit]
Herouni P. M., Theoretical problems of double mirror spherical radio telescopes. Report at the XI General Assembly of Internat. Astronomical Union, San-Francisco, 8 p., USA, 1960.
Herouni P. M. The First Radio-Optical Telescope. Trans. of the Sixth International Conference on Antennas and Propagation ICAP-89, pp. 540-546, IEEE-URSI, UK, 1989.
Herouni P. M. Constructions and Operation of Radio-Optical Telescope ROT-32/54/2,6.- Trans. of the URSI Internat. Meeting of Mirror Antenna Construction, pp. 34-41, Riga, 1990.
P. M. Herouni About Self Noises of Radio-Optical Telescope ROT- 54/2.6 Antenna, Journal of Applied Electromagnetism, Trans- Black Sea Region Union of Applied Electromagnetism, pages 51-57, Athens, Greece, June 1999.
in Russian[edit]
П. М. Геруни, "Вопросы расчета сферических двухзеркальных антенн."-Радиотехника и электроника, т.19, N1, с. 3-12., Москва, 1964.
П. М. Геруни, "Пятиметровая сферическая антенна миллиметрового диапазона"- Сб. "Антенны", вып. 4, с. 3-15, "Связь", Москва, 1968.
П. М. Геруни, "Зеркальный радиотелескоп Геруни." АС N 1377941 от 01.11.87 (приоритет от 02.01.86).
^ LLC, Helix Consulting. "PRESIDENT'S CONDOLENCES TO PARIS HERUNI'S FAMILY". www.panorama.am.
^ Biography at AAS site
^ Obituary
^ Herouni, Paris M. (2007). "Measured Parameters of Large Antenna of ROT-54/2.6 Tell about Absence of Big Bang" (PDF). 107 (1). National Academy of Sciences of Armenia: 73–78.
^ Armenians and old Armenia: archaeoastronomy, linguistics, oldest history (in English), by Paris M. Herouni, Yerevan, Tigran Mets, 2004, 272 p.
^ Ruggles (2005), pp. 65–67.
^ Simonia, Irakli; Jijelava, Badri (2014), "Astronomy in the Ancient Caucasus", in Ruggles, Clive L. N. (ed.), Handbook of Archaeoastronomy and Ethnoastronomy, New York: Springer Science+Business Media, pp. 1443–1451, doi:10.1007/978-1-4614-6141-8_138, ISBN 978-1-4614-6140-1
^ González-Garcia, A. César (2014), "Carahunge - A Critical Assessment", in Ruggles, Clive L. N. (ed.), Handbook of Archaeoastronomy and Ethnoastronomy, New York: Springer Science+Business Media, p. 1455, doi:10.1007/978-1-4614-6141-8_140, ISBN 978-1-4614-6140-1
^ Ruggles, Clive (2005), "Carahunge", Ancient Astronomy: An Encyclopedia of Cosmologies and Myth, Santa Barbara, CA: ABC CLIO, pp. 65–67, ISBN 1-85109-477-6
^ González-Garcia, A. César (2014), "Carahunge - A Critical Assessment", in Ruggles, Clive L. N. (ed.), Handbook of Archaeoastronomy and Ethnoastronomy, New York: Springer Science+Business Media, pp. 1453–1460, doi:10.1007/978-1-4614-6141-8_140, ISBN 978-1-4614-6140-1
^ Renewable energy in the Republic of Armenia, by Vahe Odabashian, Susanna Khachatryan, «21-st CENTURY» journal, № 1 (3), 2008
Wikimedia Commons has media related to Paris Herouni.
"Professor Paris M.Herouni". Carahunge, Armenia. carahunge.com. Archived from the original on 30 March 2010. Retrieved 7 March 2010.
Herouni, Paris (2004). Armenians and Old Armenia:archaeoastronomy, linguistics, oldest history. Tigran Mets.
Terzian, Yervant; Lisa Natcharian. "Profiles of Armenian Scientists:" (PDF). SCIENCE AND TECHNOLOGY IN ARMENIA. A.N.S.E.F. Armenian National Science & Education Fund. Archived from the original (PDF) on 25 August 2014. Retrieved 7 March 2010.
Herouni's telescope, Big Bang Theory, and Ian Gillan's only question, Mediamax, 2019
Retrieved from "https://en.wikipedia.org/w/index.php?title=Paris_Herouni&oldid=906852217"
People from Yerevan
Armenian engineers
Soviet engineers
20th-century engineers
Soviet scientists
Armenian academics
Armenian physicists
Wikipedia articles needing copy edit from July 2019
All articles needing copy edit
Articles containing Armenian-language text


text:
const express 	= require( 'express')
const router	= express.Router( )
const db		= require(__dirname + '/../modules/database')

// FOOD
router.get('/memory-food-fr', (request, response) => {
	let user = request.session.user
	db.game.findOne({
		where: {
			language: 'FR',
			theme: 'food',
			userId: request.session.user.id
		},
		attributes: ['score']
	}).then(score => {
		response.render('memoryfrench', {user: user, score: score})
	})
})

router.post('/memory-food-fr', (request, response) => {
	let seconds = request.body.seconds
	let tries = request.body.tries
	let points = Number(tries) + (Number(seconds)/10)
	db.game.findOne({
		where: {
			language: 'FR',
			theme: 'food',
			userId: request.session.user.id
		}
	}).then(id => {
		if(id.score == null) {
			id.update({
				finished: true,
				score: points * 10
			})
			response.send('Done')
		} else {
			if((points * 10) < id.score) {
				id.update ({
					finished: true,
					score: points * 10
				})
				response.send('Done')
			} else {
				response.send('Done')
			}
		}
	})
})

// ANIMALS
router.get('/memory-animal-fr', (request, response) => {
	let user = request.session.user
	db.game.findOne({
		where: {
			language: 'FR',
			theme: 'animals',
			userId: request.session.user.id
		},
		attributes: ['score']
	}).then(score => {
		response.render('memoryfrench2', {user: user, score: score})
	})
})

router.post('/memory-animal-fr', (request, response) => {
	let seconds = request.body.seconds
	let tries = request.body.tries
	let points = Number(tries) + (Number(seconds)/10)
	db.game.findOne({
		where: {
			language: 'FR',
			theme: 'animals',
			userId: request.session.user.id
		}
	}).then(id => {
		if(id.score == null) {
			id.update({
				finished: true,
				score: points * 10
			})
			response.send('Done')
		} else {
			if((points * 10) < id.score) {
				id.update ({
					finished: true,
					score: points * 10
				})
				response.send('Done')
			} else {
				response.send('Done')
			}
		}
	})
})

// FAMILY
router.get('/memory-family-fr', (request, response) => {
	let user = request.session.user
	db.game.findOne({
		where: {
			language: 'FR',
			theme: 'family',
			userId: request.session.user.id
		},
		attributes: ['score']
	}).then(score => {
		response.render('memoryfrench3', {user: user, score: score})
	})
})

router.post('/memory-family-fr', (request, response) => {
	let seconds = request.body.seconds
	let tries = request.body.tries
	let points = Number(tries) + (Number(seconds)/10)
	db.game.findOne({
		where: {
			language: 'FR',
			theme: 'family',
			userId: request.session.user.id
		}
	}).then(id => {
		if(id.score == null) {
			id.update({
				finished: true,
				score: points * 10
			})
			response.send('Done')
		} else {
			if((points * 10) < id.score) {
				id.update ({
					finished: true,
					score: points * 10
				})
				response.send('Done')
			} else {
				response.send('Done')
			}
		}
	})
})

module.exports = router

redpajama_set_name: RedPajamaGithub


Smaller version of Clasp 001, gold-on-sterling silver clasp.
18mm long (size references Clasp only, not including connector (eye) or ring below clasp in measurement).
Handmade in Sri Lanka. Rita's design. Price per half-dozen (6).
These have been out of stock for a long time - just got them back in.


We offer programs to meet the needs of future planners, current planning professionals, and community members throughout Idaho.
We work with communities throughout Idaho on local planning issues.
Our students can choose to study in Moscow, Boise, or online from their local communities.
Our mission is to create a culture of planning that connects people with the places they call home.
With rapid change facing cities and small towns throughout the country, we are in jeopardy of losing the unique sense of place that defines these cities and towns. At the same time, today's planners are seeking an education that meets the changing needs of communities in an increasingly global world.
The Bioregional Planning and Community Design (BIOP) program challenges the traditional planning education paradigm by leading with people and place-based community values—not statistics. Led by planning practitioners and a diverse faculty from eight academic units, our curriculum was designed, and is continuously evaluated, to be responsive to today's planning needs. We offer a shared-class format where graduate students and practitioners seeking continuing education come together to explore new concepts and current planning issues from their unique perspectives.
This interdisciplinary program prepares you for a wide range of career possibilities in the built and natural environments.
Our innovative curriculum allows you to customize your education and build towards a certificate or graduate degree.


text:
import Handlebars from 'handlebars';

export default class Component {

  constructor() {
    this.name = null;
    this.tpl = null;
    this.context = null;
  }

  /**
   * Get the dom element
   * @returns {Element}
   */
  get el() {
    const $comp = document.querySelector(this.name);
    if (!$comp) {
      throw Error(`No component found for component name "<${this.name}>"`);
    }
    return $comp;
  }

  /**
   * Get the compiled template
   * @returns {string}
   */
  get compile() {
    if (!this.tpl) {
      throw Error('No template defined');
    }
    return Handlebars.compile(this.tpl(this.context))();
  }

  /**
   * Initialize the component
   * ::WARN:: Importance order for component runtime
   */
  init() {
    console.debug(`Component Initializing: ${this.name}`);
    // 1. Render
    this.render();
    // 2. Init component
    this.compInit();
  }

  /**
   * Render the html inside the component element
   */
  render() {
    // clean element
    this.destroy();
    // render the compiled template
    this.el.innerHTML = this.compile;
    // bind events again
    this.bindEvents();
  }

  /**
   * Dummy init for the extended comp to render
   */
  compInit() {
  }

  /**
   * Destroy the component
   */
  destroy() {
    console.debug(`Component Destroying: ${this.name}`);
    this.removeEvents();
    this.el.innerHTML = '';
  }

  /**
   * Bind events to the component (or children)
   */
  bindEvents() {
  }

  /**
   * Remove the bound events to the component (or children)
   */
  removeEvents() {
  }
}


text:
Any other Business that the Chairman considers urgent
Alderwoman Susan Pearson – Membership of Sub-Committees
The Town Clerk, noting that Alderwoman Person had retained her place on the Committee, representing the Ward of Cripplegate, stated that the Committee were now also asked to consider whether her continued membership of both the Streets and Walkways and Local Plans Sub-Committee were appropriate. The Committee were reminded that membership of both bodies had been expanded at the start of this civic year to ensure that all those interested in participating on those bodies were able to do so.
RESOLVED – That the Committee support Alderwoman Susan Pearson's continued membership of both the Streets and Walkways and Local Plans Sub-Committee.
Opportunity London Campaign
With the permission of the Chairman, the Committee considered a late, separately circulated report of the Director of Environment and the City Surveyor seeking agreement to continue the City Corporations sponsorship of the Opportunity London campaign and setting out what it has delivered to date, the costs of continued sponsorship and outlining an umbrella programme of key property related events for 2023 that the City Corporation could seek to attend in conjunction with Opportunity London, together with associated costs.
Officers apologise for the timing of this report but clarified that they had only learned last week what action needed to be taken to permit the City's attendance at MIPIM and the costs associated with this. It was underlined that appropriate accommodation could only be secured once a decision had been taken as to the City's presence at the event. The report set out an annual programme of engagement to promote the City to domestic and international property investors which was parallel and interlinked to the promotion undertaken on the City as a world-class financial and business services centre. This would be delivered in collaboration with Opportunity London – a new partnership promoting investment into London. Officers highlighted the three areas of consideration today and highlighted that the report was also to be considered by the Policy and Resources Committee and the Property Investment Board. It was highlighted that the total funding seeking approval was £140,000 to be taken from local risk budgets.
Officers went on to underline that the report also sought approval for the continuation of the City's sponsorship of Opportunity London once the current sponsorship expired in March 2023. Members were informed that, in February of this year, the Policy and Resources Committee had approved the principle of being an initial partner in Opportunity London and committed £25,000 to this given that there were no other bodies at the time promoting foreign investment into London. It was reported that this investment had also helped secure additional investment of £65,000 from the GLA and £45,000 from London Councils as well as approximately £200,000 of private sector funding which equalled approximately £310,000 of total investment against a target of £500,000 with discussions with the private sector still ongoing demonstrating that there was a clear appetite for having a vehicle to promote and deliver on investment into London and the City.
Secondly, it was highlighted that Opportunity London had identified a series of events that would enable engagement with domestic, European and international investors which included MIPIM. Members were informed that over 22,000 people had attended MIPIM last year and paid to go into the conference programme with over 25,000 were expected this year. It was anticipated that an additional 20,000 people would be present and networking around the programme. Officers stated that it was critical for London to be adequately represented here to demonstrate and promote the values of the City as a place to invest and afford strategic engagement with investors. MIPIM was also a key opportunity to raise the profile of and champion the work of this Planning and Transportation Committee as well as to highlight policies that would encourage investment. The budget proposed here for MIPIM was £65,000 which would see a team of eight people attending including the Chairs of this Committee, Policy and Resources and the Property Investment Board alongside the Executive Director, Environment, the City Surveyor and a team of three to support this attendance.
The final element of the report focused on a parallel, umbrella event, attendance at which would be costed at £50,000.
The Chairman stated that part of the remit of this Committee was to promote the City of London and the built environment. However, he added that he would be seeking firm reports back to Committee on this demonstrating the results of these various engagements and outlining the benefits of this.
A Member questioned whether this had been budgeted for in this financial year and questioned whether this was entirely City Fund monies. Officers reported that funding would be across two financial years and that this current financial year would only require funding for Opportunity London and MIPIM for which there were existing budgets set aside for this purpose. It was also confirmed that this would all be from City Fund.
A Member stated that the sole reason that this matter required this Committee's approval was a result of Member involvement and member travel that needed to be authorised here. They argued that, fundamentally, this was core business in terms of promoting the Square Mile as a place to do business.
A Member stated that a report earlier this year had sought funding for the Chairman to attend an event in New York but that this had subsequently been withdrawn. She asked whether this was also addressed here. Officers reported that this would no longer be pursued but highlighted that there may be a need to engage directly with North America or indeed the Far East alongside the Opportunity London campaign. A budget was therefore proposed for this at this stage in order to allow for the appropriate Member to attend and deliver key messages to the right audiences.
A Member stated that she had some concern around this coming from the Environment Department budget as opposed to Policy and Resources which she felt should be the umbrella Committee in terms of funding this. She went on to state that, in terms of public perception, it was difficult to justify funds being directed here as opposed to towards street cleansing for example. She underlined that she also had concerns around references to assisting developers given public perception, the need for impartiality and the fact that the Planning Committee ought to have an arm's length relationship with the industry. Officers stated that the budget for MIPIM attendance had previously been held by the CPAT team but had now transferred across to the Environment Department due to new arrangements enacted by the Target Operating Model. It was reiterated that this budget had been provisioned for the purpose or promoting the City as a place to invest and do business.
Another Member echoed the need for robust and comprehensive feedback reports and stressed that there did not appear to be a proper business case set out for this.
A Member commented on proposed MIPIM attendees in terms of Members. She questioned why the Chair of this Committee was required to attend given that this Committee had a quasi-judicial role and had to judge each application before it on its merits and policy as opposed to promoting investment. Secondly, the Member questioned what seminars or events the City were providing as opposed to just attending in order to promote the City and justify the costs set our here.
A Member commented that their understanding was that the Chair of this Committee was invited to attend MIPIM was so that they could better understand what was going on in the market as opposed to to discuss specific developments. As well as sitting in a quasi-judicial capacity, this Committee also had a broader remit around things such as the City Plan and what the City was going to look like over the coming decades and for this reason they felt that the Planning Chair's attendance was necessary here.
A Member questioned how investment trends had fared during the pandemic when attendance at these events had not been possible. She also stressed that physical attendance at these events might not be the only or indeed best way to do business any longer and that it might be preferable to invite investors to events in London as an alternative in order to better showcase the City. Officers confirmed that a large part of the Opportunity London campaign was around hosting events in the UK and London. The Opportunity London Summit had taken place in September and the London Real Estate Forum would also be looking to engage with investors. However, they also underlined the need to travel to events such as MIPIM where the biggest concentration of investors could be found which would be the approach taken by other cities.
Officers confirmed that there was a very tight and specific programme in place for MIPIM which included opportunities to push the City's key messages on the London stand and at various breakfasts, lunches, dinners and meetings with investors. This focused on their attitude to investment and not individual applications or developments. Members were informed that attendance at MIPIM was considered essential in order to push key messages.
In response to further questions, Officers reported that total attendance had been reduced by two in relation to previous years and that the total budget for this had been reduced down from £95,000 to £65,000. In terms of flight and hotel costs, it was reiterated that hotel bookings would not be released until such time as the City had agreed to take a stand. Ideally, attendees would be seeking to stay in Cannes given that the days programmes were from 7.30am-midnight. Officers confirmed that they intended to be frugal in terms of hotel bookings.
The Chairman asked that Officers give further consideration as to where the budget for this was held and also to the reporting cycle for this work going forward. Members highlighted that they also intended to raise this point at the Policy and Resources Committee when this matter was considered further here.
I. That the Planning and Transportation Committee agree that £25,000 from the Environment Departments(Partnership and Engagement) local risk budget should be used to fund the ongoing sponsorship of Opportunity London;
II. That the Planning & Transportation Committee approve that the City of London Corporation should attend MIPIM 2023 with a total budget of £65,000 to be funded via Environment Departments (Partnership and Engagement) local risk budget (£40,000).
III. That the Planning and Transportation Committee agree that £50,000 from the Environment Departments (Partnership and Engagement) local risk budget should be used to fund the attendance of an umbrella programme of property related events being supported by Opportunity London.
Barbican Podium – Phase II works
A Member raised the finances of this which would be public expenditure drawn from street parking funds.
A Member questioned whether this was considered sufficiently urgent by the Chairman to be raised at this stage. The Chairman permitted the Member to continue.
The Member stated that he was keen for Members to be aware of what was happening here and underlined that his concern was around the majority public expenditure being utilised to repair the membrane which did not have any public benefit but would fix leaks into a gym, conference centres and carparks. To balance this, a lot of money was also to be spent on an area of public realm above however the City's own City Plan indicated that the pedestrian density extrapolated out to 2026 on this particular area was one of the lowest in the City. It was stressed that a concerted effort was therefore needed to show how the public might be encouraged to use this space and thereby justify this public expenditure and for studies to demonstrate that this had been successful thereafter.
LATE ITEM - Opportunity London report final 003, item 18. PDF 160 KB