2011-03-17T17:23:34Z

2011-03-10T18:52:25Z

Slyons: /* Observability */

==Observability==

* How do we define 'public' action? How do we monitor 'public' action without monitoring every action?
* How can you make sure your agent is acting according to your instructions?
* How can we ensure that information we receive through a third-party is legitimate?
* What '''CAN''' be observed?

== Contract Monitoring ==

[http://dx.doi.org/10.1007/978-3-642-03668-2_29 Contract Monitoring in Agent-Based Systems: Case Study] from Lecture Notes in Computer Science by Jiří Hodík, Jiří Vokřínek and Michal Jakob, 2009

=== Abstract ===

Monitoring of fulfilment of obligations defined by electronic contracts in distributed domains is presented in this paper. A two-level model of contract-based systems and the types of observations needed for contract monitoring are introduced. The observations (inter-agent communication and agents’ actions) are collected and processed by the contract observation and analysis pipeline. The presented approach has been utilized in a multi-agent system for electronic contracting in a modular certification testing domain.

== Monitoring Service Contracts ==

[http://dx.doi.org/10.1007/3-540-45705-4_15 An Agent-Based Framework for Monitoring Service Contracts] from Lecture Notes in Computer Science by Helmut Kneer, Henrik Stormer, Harald Häuschen and Burkhard Stiller, 2002

=== Abstract ===

Within the past few years, the variety of real-time multimedia streaming services on the Internet has grown steadily. Performance of streaming services is very sensitive to traffic congestion and results very often in poor service quality on today’s best effort Internet. Reasons include the lack of any traffic prioritization mechanisms on the network level and its dependence on the cooperation of several Internet Service Providers and their reliable transmission of data packets. Therefore, service differentiation and its reliable delivery must be enforced on a business level through the introduction of service contracts between service providers and their customers. However, compliance with such service contracts is the crucial point that decides about successful improvement of the service delivery process. For that reason, an agent-based monitoring framework has been developed and introduced enabling the use of mobile agents to monitor compliance with contractual agreements between service providers and service customers. This framework describes the setup and the functionality of different kinds of mobile agents that allow monitoring of service contracts across domains of multiple service providers.

==Contracts==

* What can or can't be contracted?
* How can you quantify abstract resources?
* How can two or more parties agree with a minimum of intervention?

Some forms of contracts exist in the form of Service Level Agreements, and there have been efforts made to automate this process:

== AURIC ==
[http://dx.doi.org/10.1007/978-3-540-75694-1_21 AURIC: A Scalable and Highly Reusable SLA Compliance Auditing Framework] from Lecture Notes in Computer Science, by Hasan and Burkhard Stiller, 2007.

=== Abstract ===
Service Level Agreements (SLA) are needed to allow business interactions to rely on Internet services. Service Level Objectives (SLO) specify the committed performance level of a service. Thus, SLA compliance auditing aims at verifying these commitments. Since SLOs for various application services and end-to-end performance definitions vary largely, automated auditing of SLA compliances poses the challenge to an auditing framework. Moreover, end-to-end performance data are potentially large for a provider with many customers. Therefore, this paper presents a scalable and highly reusable auditing framework and a prototype, termed AURIC (Auditing Framework for Internet Services), whose components can be distributed across different domains.

== Bandwidth ==
[http://dx.doi.org/10.1007/978-3-540-30189-9_19 SLA-Driven Flexible Bandwidth Reservation Negotiation Schemes for QoS Aware IP Networks] from Lecture Notes in Computer Science by Gerard Parr and Alan Marshall, 2004.

=== Abstract ===
We present a generic Service Level Agreement (SLA)-driven service provisioning architecture, which enables dynamic and flexible bandwidth reservation schemes on a per- user or a per-application basis. Various session level SLA negotiation schemes involving bandwidth allocation, service start time and service duration parameters are introduced and analysed. The results show that these negotiation schemes can be utilised for the benefits of both end user and network provide such as getting the highest individual SLA optimisation in terms of Quality of Service (QoS) and price. A prototype based on an industrial agent platform has also been built to demonstrate the negotiation scenario and this is presented and discussed.

== Dynamic Adaptation ==
[http://dx.doi.org/10.1007/978-3-540-89652-4_28 Context-Driven Autonomic Adaptation of SLA] from Lecture notes in Computer Science, by authors Caroline Herssens, Stéphane Faulkner and Ivan Jureta, 2008.

=== Abstract ===
Service Level Agreements (SLAs) are used in Service-Oriented Computing to define the obligations of the parties involved in a transaction. SLAs define the service users’ Quality of Service (QoS) requirements that the service provider should satisfy. Requirements defined once may not be satisfiable when the context of the web services changes (e.g., when requirements or resource availability changes). Changes in the context can make SLAs obsolete, making SLA revision necessary. We propose a method to autonomously monitor the services’ context, and adapt SLAs to avoid obsolescence thereof.

== Heuristics for Enforcing Service Level Agreements ==
[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.127.8674&rep=rep1&type=pdf Heuristics for Enforcing Service Level Agreements in a Public Computing Utility] A masters thesis paper by Balasubramaneyam Maniymaran.

=== Abstract ===
With the increasing popularity of consumer and research oriented wide-area applications,there arises a need for a robust and efﬁcient wide-area resource management system. Even though there exists number of systems for wide area resource management, they fail to couple the QoS management with cost management, which is the key issue in pushing such a system to be commercially successful. Further, the lack of IT skills within the companies arouses the need of decoupling service management from the underlying complex wide-area resource management. A public computing utility (PCU) addresses both these issues, and, in addition, it creates a market place for the selling idling computing resources.

This work proposes a PCU model addressing the above mentioned issues and develops heuristics to enforce QoS in that model. A new concept called virtual clusters (VCs) is introduced as semi-dynamic, service speciﬁc resource partitions of a PCU, optimizing cost, QoS, and resource utilization. This thesis describes the methodology of VC creation, analyses the formulation of a VC creation into an optimization problem, and develops solution heuristics. The concept of VC is supported by two other concepts introduced here namely anchor point (AP) and overload partition (OLP). The concept of AP is used to represent the demand distribution in a network that assists the problem formulation of the VC creation and SLA management. The concept of overload partition is used to handle the demand spikes in a VC.

In a PCU, the VC management is implemented in two phases: the ﬁrst is an off-line phase of creating a VC that selects the appropriate resources and allocates them for the particular service; and the second phase employs on-line scheduling heuristic to distribute the jobs/requests from the APs among the VC nodes to achieve load balancing. A detailed simulation study is conducted to analyze the performance of different VC conﬁgurations for different load conditions and scheduling schemes and this performance is compared with a fully dynamic resource allocation scheme called Service Grid. The results verify the novelty of the VC concept.

== Service Level Agreement in Cloud Computing ==
[http://knoesis.wright.edu/library/download/OOPSLA_cloud_wsla_v3.pdf SLAs in Cloud Computing] A paper written by Pankesh Patel, Ajith Ranabahu, Amit Sheth.

=== Abstact ===
Cloud computing that provides cheap and pay-as-you-go computing resources is rapidly gaining momentum as an alternative to traditional IT Infrastructure. As more and more consumers delegate their tasks to cloud providers, Service Level Agreements(SLA) between consumers and providers emerge as a key aspect. Due to the dynamic nature of the cloud, continuous monitoring on Quality of Service (QoS)attributes is necessary to enforce SLAs. Also numerous other factors such as trust (on the cloud provider) come into consideration, particularly for enterprise customers that may outsource its critical data. This complex nature of the cloud landscape warrants a sophisticated means of managing SLAs. This paper proposes a mechanism for managing SLAs in a cloud computing environment using the Web Service Level Agreement(WSLA) framework, developed for SLA monitoring and SLA enforcement in a Service Oriented Architecture (SOA). We use the third party support feature of WSLA to delegate monitoring and enforcement tasks to other entities in order to solve the trust issues. We also present a real world use case to validate our proposal.

== Service Level Agreements on IP Networks ==

By Dinesh C. Verma, IBM T. J Watson Research center
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1323286&tag=1

=== Abstract ===
Abstract: This paper provides an overview of service-level agreements in IP networks. It looks at the typical components of a service-level agreement, and identifies three common approaches that are used to satisfy service level agreements in IP networks. The implications of using the approaches in the context of a network service provider, a hosting service provider, and an enterprise are examined. While most providers currently offer a static insurance approach towards supporting service level agreements, the schemes that can lead to more dynamic approaches are identified.

== Trustworthiness of New Contracts ==

[http://dx.doi.org/10.1007/978-3-642-10203-5_12 Determining the Trustworthiness of New Electronic Contracts] from Lecture Notes in Computer Science by Paul Groth, Simon Miles, Sanjay Modgil, Nir Oren, Michael Luck and Yolanda Gil, 2009.

=== Abstract ===

Expressing contractual agreements electronically potentially allows agents to automatically perform functions surrounding contract use: establishment, fulfilment, renegotiation etc. For such automation to be used for real business concerns, there needs to be a high level of trust in the agent-based system. While there has been much research on simulating trust between agents, there are areas where such trust is harder to establish. In particular, contract proposals may come from parties that an agent has had no prior interaction with and, in competitive business-to-business environments, little reputation information may be available. In human practice, trust in a proposed contract is determined in part from the content of the proposal itself, and the similarity of the content to that of prior contracts, executed to varying degrees of success. In this paper, we argue that such analysis is also appropriate in automated systems, and to provide it we need systems to record salient details of prior contract use and algorithms for assessing proposals on their content. We use provenance technology to provide the former and detail algorithms for measuring contract success and similarity for the latter, applying them to an aerospace case study.

== Web Privacy with P3P ==

http://www.oreilly.de/catalog/webprivp3p/

This book talks about P3P and how companies and web developers can comply with p3p.
Also check http://www.w3.org/P3P/

==Consumer Privacy: Balancing Economic and Justice Considerations==

M.Culnan, R. Biles, Journal of Social Issues

http://onlinelibrary.wiley.com/doi/10.1111/1540-4560.00067/full

=== Abstract ===

Check link for abstract, couldn't copy paste! This paper talks about government regulation, industry self-regulation and technological solutions with regards to the internet.

Talk:DistOS-2011W Observability & Contracts

2011-03-08T18:29:56Z

Slyons: /* Observability */

==Observability==

* How do we define 'public' action? How do we monitor 'public' action without monitoring every action?
* How can you make sure your agent is acting according to your instructions?
* How can we ensure that information we receive through a third-party is legitimate?

== Contract Monitoring ==

[http://dx.doi.org/10.1007/978-3-642-03668-2_29 Contract Monitoring in Agent-Based Systems: Case Study] from Lecture Notes in Computer Science by Jiří Hodík, Jiří Vokřínek and Michal Jakob, 2009

=== Abstract ===

Monitoring of fulfilment of obligations defined by electronic contracts in distributed domains is presented in this paper. A two-level model of contract-based systems and the types of observations needed for contract monitoring are introduced. The observations (inter-agent communication and agents’ actions) are collected and processed by the contract observation and analysis pipeline. The presented approach has been utilized in a multi-agent system for electronic contracting in a modular certification testing domain.

==Contracts==

* What can or can't be contracted?
* How can you quantify abstract resources?
* How can two or more parties agree with a minimum of intervention?

Some forms of contracts exist in the form of Service Level Agreements, and there have been efforts made to automate this process:

== AURIC ==
[http://dx.doi.org/10.1007/978-3-540-75694-1_21 AURIC: A Scalable and Highly Reusable SLA Compliance Auditing Framework] from Lecture Notes in Computer Science, by Hasan and Burkhard Stiller, 2007.

=== Abstract ===
Service Level Agreements (SLA) are needed to allow business interactions to rely on Internet services. Service Level Objectives (SLO) specify the committed performance level of a service. Thus, SLA compliance auditing aims at verifying these commitments. Since SLOs for various application services and end-to-end performance definitions vary largely, automated auditing of SLA compliances poses the challenge to an auditing framework. Moreover, end-to-end performance data are potentially large for a provider with many customers. Therefore, this paper presents a scalable and highly reusable auditing framework and a prototype, termed AURIC (Auditing Framework for Internet Services), whose components can be distributed across different domains.

== Bandwidth ==
[http://dx.doi.org/10.1007/978-3-540-30189-9_19 SLA-Driven Flexible Bandwidth Reservation Negotiation Schemes for QoS Aware IP Networks] from Lecture Notes in Computer Science by Gerard Parr and Alan Marshall, 2004.

=== Abstract ===
We present a generic Service Level Agreement (SLA)-driven service provisioning architecture, which enables dynamic and flexible bandwidth reservation schemes on a per- user or a per-application basis. Various session level SLA negotiation schemes involving bandwidth allocation, service start time and service duration parameters are introduced and analysed. The results show that these negotiation schemes can be utilised for the benefits of both end user and network provide such as getting the highest individual SLA optimisation in terms of Quality of Service (QoS) and price. A prototype based on an industrial agent platform has also been built to demonstrate the negotiation scenario and this is presented and discussed.

== Dynamic Adaptation ==
[http://dx.doi.org/10.1007/978-3-540-89652-4_28 Context-Driven Autonomic Adaptation of SLA] from Lecture notes in Computer Science, by authors Caroline Herssens, Stéphane Faulkner and Ivan Jureta, 2008.

=== Abstract ===
Service Level Agreements (SLAs) are used in Service-Oriented Computing to define the obligations of the parties involved in a transaction. SLAs define the service users’ Quality of Service (QoS) requirements that the service provider should satisfy. Requirements defined once may not be satisfiable when the context of the web services changes (e.g., when requirements or resource availability changes). Changes in the context can make SLAs obsolete, making SLA revision necessary. We propose a method to autonomously monitor the services’ context, and adapt SLAs to avoid obsolescence thereof.

== Heuristics for Enforcing Service Level Agreements ==
[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.127.8674&rep=rep1&type=pdf Heuristics for Enforcing Service Level Agreements in a Public Computing Utility] A masters thesis paper by Balasubramaneyam Maniymaran.

=== Abstract ===
With the increasing popularity of consumer and research oriented wide-area applications,there arises a need for a robust and efﬁcient wide-area resource management system. Even though there exists number of systems for wide area resource management, they fail to couple the QoS management with cost management, which is the key issue in pushing such a system to be commercially successful. Further, the lack of IT skills within the companies arouses the need of decoupling service management from the underlying complex wide-area resource management. A public computing utility (PCU) addresses both these issues, and, in addition, it creates a market place for the selling idling computing resources.

This work proposes a PCU model addressing the above mentioned issues and develops heuristics to enforce QoS in that model. A new concept called virtual clusters (VCs) is introduced as semi-dynamic, service speciﬁc resource partitions of a PCU, optimizing cost, QoS, and resource utilization. This thesis describes the methodology of VC creation, analyses the formulation of a VC creation into an optimization problem, and develops solution heuristics. The concept of VC is supported by two other concepts introduced here namely anchor point (AP) and overload partition (OLP). The concept of AP is used to represent the demand distribution in a network that assists the problem formulation of the VC creation and SLA management. The concept of overload partition is used to handle the demand spikes in a VC.

In a PCU, the VC management is implemented in two phases: the ﬁrst is an off-line phase of creating a VC that selects the appropriate resources and allocates them for the particular service; and the second phase employs on-line scheduling heuristic to distribute the jobs/requests from the APs among the VC nodes to achieve load balancing. A detailed simulation study is conducted to analyze the performance of different VC conﬁgurations for different load conditions and scheduling schemes and this performance is compared with a fully dynamic resource allocation scheme called Service Grid. The results verify the novelty of the VC concept.

== Service Level Agreement in Cloud Computing ==
[http://knoesis.wright.edu/library/download/OOPSLA_cloud_wsla_v3.pdf SLAs in Cloud Computing] A paper written by Pankesh Patel, Ajith Ranabahu, Amit Sheth.

=== Abstact ===
Cloud computing that provides cheap and pay-as-you-go computing resources is rapidly gaining momentum as an alternative to traditional IT Infrastructure. As more and more consumers delegate their tasks to cloud providers, Service Level Agreements(SLA) between consumers and providers emerge as a key aspect. Due to the dynamic nature of the cloud, continuous monitoring on Quality of Service (QoS)attributes is necessary to enforce SLAs. Also numerous other factors such as trust (on the cloud provider) come into consideration, particularly for enterprise customers that may outsource its critical data. This complex nature of the cloud landscape warrants a sophisticated means of managing SLAs. This paper proposes a mechanism for managing SLAs in a cloud computing environment using the Web Service Level Agreement(WSLA) framework, developed for SLA monitoring and SLA enforcement in a Service Oriented Architecture (SOA). We use the third party support feature of WSLA to delegate monitoring and enforcement tasks to other entities in order to solve the trust issues. We also present a real world use case to validate our proposal.

== Service Level Agreements on IP Networks ==

By Dinesh C. Verma, IBM T. J Watson Research center
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=1323286&tag=1

=== Abstract ===
Abstract: This paper provides an overview of service-level agreements in IP networks. It looks at the typical components of a service-level agreement, and identifies three common approaches that are used to satisfy service level agreements in IP networks. The implications of using the approaches in the context of a network service provider, a hosting service provider, and an enterprise are examined. While most providers currently offer a static insurance approach towards supporting service level agreements, the schemes that can lead to more dynamic approaches are identified.

Talk:DistOS-2011W Observability & Contracts

2011-03-08T05:37:48Z

Slyons:

Talk:DistOS-2011W Observability & Contracts

2011-03-08T05:33:15Z

Slyons:

Talk:DistOS-2011W Observability & Contracts

2011-03-08T05:30:21Z

Slyons: /* AURIC */

Talk:DistOS-2011W Observability & Contracts

2011-03-08T05:30:08Z

Slyons: /* AURIC */

Talk:DistOS-2011W Observability & Contracts

2011-03-08T05:29:49Z

Slyons: /* Contracts */

Template:Rp/doc

2011-03-08T05:22:08Z

Slyons: 1 revision

{{Documentation subpage}}


==Function==
Use this template when you are referring to specific pages within a cited source many times in the same article. The following example sentence shows the formatting produced by
:<code><nowiki><ref name="aardvark"></nowiki></code>... details of cited source ...<code><nowiki></ref>{{rp|23}}</nowiki></code>
which would be used to refer to a fact on page 23 of reference [1]:
:Apples should be eaten when they are ripe.<ref name="aardvark">A. A. Aardvark (1999). ''The Best Moments for Eating''. Green Press.</ref>{{rp|23}}
This second example sentence shows the formatting produced by
:<code><nowiki><ref name="aardvark" />{{rp|56}}</nowiki></code>
which would be used as citation for a statement supported by a fact on page 56 of the same reference [1], which will appear only once in the list of references:
:Porridge, usually eaten for breakfast, can also serve as a dessert.<ref name="aardvark" />{{rp|56}}

==Usage==
===With colon===
{{tlx|rp|page number(s)}}

"Page number(s)" can be a single page number (287), several (xii, 287, 292, 418) or a range (287–88) or any combination thereof. Do not add "Page", "pp.", etc.{{mdash}} just the numbers. Of course, it can also be used for non-numeric pages, for example: "f. 29", "A7", and "back cover", etc., and can also be used for non-paginated sources, e.g., "0:35:12" for a video source.

This template (the name of which stands for "reference pages") is for appending page numbers in [[WP:HARV|Harvard referencing]] style (or [[AMA style]], as an option – ''see "[[#With parentheses|With parentheses]]", below'') to [[WP:FN|Cite.php-generated inline reference citations]]. It is a solution for the problem of an article with a source that must be cited many, many times, at numerous different pages. It is an alternative to the more common method of using [[WP:CITESHORT|shortened footnotes]], that does not require the reader to follow two links to see the source. The Cite.php <code><nowiki><ref ...></nowiki></code> footnoting system is desired to be used instead of the incredibly tedious and easy-to-break {{tl|ref label}} and {{tl|note label}} system (tedious and fragile in ''this'' context; the templates are not terribly difficult to use and are quite useful in other situations).

The problem of course is that a work cited 100+ times with page numbers in each appearance, with individual <code><nowiki><ref ...></nowiki></code>'s will result in more than 100 lines generated for the same source by <code><nowiki><references /></nowiki></code> (or {{tl|Reflist}}),[[[#note1|*note]]] while using a single <code><nowiki><ref ...>...</ref></nowiki></code> and followup <code><nowiki><ref ... /></nowiki></code>'s with the same <code>name=</code> and simply mentioning all of the pages cited, in the single line generated by <code><nowiki><references /></nowiki></code> could result in at least 100 pages being specifically cited in a single reference citation footnote, rendering it basically unreadable and certainly useless. Given that [[WP:FA|Featured Article]] and sometimes even [[WP:GA|Good Article]] review generally insist upon specific facts being cited with specific page numbers, Cite.php's limitations are in fact a severe problem for editors. Even more importantly, either of the two results above is a severe problem for encyclopedia readers.

This template solves this problem (perhaps temporarily, as Cite.php may be upgraded at some future date to account for this problem, in which case a bot can be created to convert {{tl|Rp}} instances to the new, improved "Super-<code><nowiki><ref ...></nowiki></code>").

:{{Anchor|note1}}* Note: ''See [http://en.wikipedia.org/w/index.php?title=Delaware_Basin&oldid=328167809#References this diff] for a short but already reader-annoying example. Imagine it with 100+ citations to one source instead of just 13.''

====Example====
The example below shows {{tl|Rp}} in use both at a first occurrence [<code><nowiki><ref ...>...</ref></nowiki></code>], with other references and inline superscript templates present so one can see how it looks when used in series, and at a later [<code><nowiki><ref ... /></nowiki></code>] occurrence.

;Code:
<code>An asserted fact.<nowiki>{{</nowiki>Clarifyme|date={{CURRENTMONTHNAME}} {{CURRENTYEAR}}<nowiki>}}</nowiki><nowiki><</nowiki>ref name="Jackson1999"><nowiki>{{</nowiki>Cite book 
|last=Jackson 
|first=Jennifer 
|title=The Unlightable Being of Bareness 
|publisher=Funky Publications|location=<nowiki>[[</nowiki>San Francisco, CA]] 
|year=1999 
|isbn=1-2345-6789-0 
}}<nowiki><</nowiki>/ref><nowiki>{{</nowiki>rp|233–7}}<nowiki><</nowiki>ref name="Smith2000"><nowiki>{{</nowiki>Cite book 
|last=Smith 
|first=Bob 
|title=Another Source 
|publisher=Another Publisher 
|location=<nowiki>[[</nowiki>Chicago, IL]] 
|year=2000 
|isbn=0-0986-5432-1 
|page=27 
}}<nowiki><</nowiki>/ref><nowiki><</nowiki>ref name="NYT20060120"><nowiki>{{</nowiki>Cite news 
|url= <nowiki>http://url.goes.here.tld/</nowiki> 
|title=Some Article 
|last=Jones 
|first=Bill 
|work=New York Times 
|page=S4, "Style" section 
|publisher=<nowiki>[[</nowiki>New York Times Company]] 
|location=<nowiki>[[</nowiki>New York, NY]] 
|date=January 20, 2006 
|accessdate=2007-03-17 
}}<nowiki></ref></nowiki></code> 
... 
<code><nowiki>Another asserted fact.<ref name="Jackson1999" />{{rp|27, 422}}</nowiki></code> 
... 
<code><nowiki>{{Reflist}}</nowiki></code>

;Results:
An asserted fact.[[[Wikipedia:Please clarify|''clarify'']]]<ref name="Jackson1999">{{Cite book|last=Jackson|first=Jennifer|title=The Unlightable Being of Bareness|publisher=Funky Publications|location=[[San Francisco, CA]]|year=1999|isbn=1-2345-6789-0}}</ref>{{rp|233–7}}<ref name="Smith2000">{{Cite book|last=Smith|first=Bob|title=Another Source|publisher=Another Publisher|location=[[Chicago, IL]]|year=2000|isbn=0-0986-5432-1|page=27}}</ref><ref name="NYT20060120">{{Cite news|url= http://url.goes.here.tld/ |title=Some Article|last=Jones|first=Bill|work=New York Times|page=S4, "Style" section|publisher=[[New York Times Company]]|location=[[New York, NY]]|date=January 20, 2006|accessdate=2007-03-17}}</ref> 
... 
Another asserted fact.<ref name="Jackson1999" />{{rp|27, 422}} 
... 
{{Reflist}}

===With parentheses===
AMA style puts superscripted page numbers inside parenthesis instead of after a colon. For editors that prefer this style, this template has parameters ''page'', ''pages'', and ''at''.

;Code:
<code>An asserted fact.<nowiki><</nowiki>ref name="Jackson1999"><nowiki>{{</nowiki>Cite book 
|last=Jackson 
|first=Jennifer 
|title=The Unlightable Being of Bareness 
|publisher=Funky Publications|location=<nowiki>[[</nowiki>San Francisco, CA]] 
|year=1999 
|isbn=1-2345-6789-0 
}}<nowiki><</nowiki>/ref><nowiki>{{</nowiki>rp|page=148}}</code> 
... 
<code><nowiki>Another asserted fact.<ref name="Jackson1999" />{{rp|pages=233–7}}</nowiki></code> 
... 
<code><nowiki>A third asserted fact.<ref name="Jackson1999" />{{rp|at=dust jacket}}</nowiki></code> 
... 
<code><nowiki>{{Reflist}}</nowiki></code>

;Results:
An asserted fact.<ref group="a" name="Jackson1999">{{Cite book|last=Jackson|first=Jennifer|title=The Unlightable Being of Bareness|publisher=Funky Publications|location=[[San Francisco, CA]]|year=1999|isbn=1-2345-6789-0}}</ref>{{rp|page=148}} 
... 
Another asserted fact.<ref group="a" name="Jackson1999" />{{rp|pages=233–7}} 
... 
A third asserted fact.<ref group="a" name="Jackson1999" />{{rp|at=dust jacket}} 
... 
{{Reflist|group="a"}}

===Missing page numbers===
If a reference needs a page number but it is missing, use <code>{{tlx|rp|needed=y|<nowiki>{{subst:DATE}}</nowiki>}}</code> or <code>{{tlx|rp|needed=y|date={{CURRENTMONTHNAME}} {{CURRENTYEAR}}}}</code>. This will automatically use the {{tlx|page needed}} template to add the article to [[:Category:Wikipedia articles needing page number citations|the appropriate category]]. For example, <code><nowiki><ref group="b" name="Jackson 1999 ex. 1" /></nowiki>{{tlx|rp|needed=y|<nowiki>{{subst:DATE}}</nowiki>}}</code> results in: <ref group="b" name="Jackson1999">{{Cite book|last=Jackson|first=Jennifer|title=The Unlightable Being of Bareness|publisher=Funky Publications|location=[[San Francisco, CA]]|year=1999|isbn=1-2345-6789-0}}</ref>{{fix
|link=Wikipedia:Citing sources
|text=page needed}}

This is preferable to something like <code>{{tlx|rp|page number?}}</code> or <code>{{tlx|rp|?}}</code>, since the cleanup categorization takes place. It is preferable to simply using {{tlx|page needed}} in articles that make use of {{tlx|rp}}, since it preserves the use of the {{tlx|rp}} syntax.

Do not nest the {{tlx|page needed}} template inside the {{tlx|rp}} template, or the results are too small to be legible for many readers, and with a stray colon: <code><nowiki><ref group="b" name="Jackson 1999" /></nowiki>{{tlx|rp|{{tlx|page needed|<nowiki>{{subst:DATE}}</nowiki>}}</code> results in: <ref group="b" name="Jackson1999">{{Cite book|last=Jackson|first=Jennifer|title=The Unlightable Being of Bareness|publisher=Funky Publications|location=[[San Francisco, CA]]|year=1999|isbn=1-2345-6789-0}}</ref>{{rp|{{fix
|link=Wikipedia:Citing sources
|text=page needed}}}}

{{Reflist|group="b"}}

===Warning===
This template should not be used unless necessary. In the vast majority of cases, citing page numbers in the <code><nowiki><ref ...>...</ref></nowiki></code> code is just fine. This template is only intended for sources that are used many, many times in the same article, to such an extent that normal citation would produce a useless line in <code><nowiki><references /></nowiki></code> or too many individual ones. Overuse of this template will make prose harder to read, and is likely to be reverted by other editors. Used judiciously, however, it is much less interruptive to the visual flow than [[Wikipedia:Harvard referencing|full Harvard referencing]] and some other reference citation styles.

==See also==
* [[w:WP:CITESHORT|Shortened footnotes]] in [[w:Wikipedia:Citing sources]], which describes the most common way of citing multiple pages of the same source.
* {{tl|w:sfn}}, a template that implements the most common way of citing multiple pages of the same source.

<includeonly>

[[Category:Citation templates]]
[[Category:Inline templates]]

[[de:Vorlage:Rp]]
[[en:Template:Rp]]
[[ja:Template:Rp]]
[[ko:틀:Rp]]
[[pl:Szablon:Rp]]
[[ru:Шаблон:rp]]
</includeonly>

Template:Cite news

2011-03-08T05:22:07Z

Slyons: 1 revision

#REDIRECT [[Template:Cite journal]]

Template:Anchor

2011-03-08T05:22:07Z

Slyons: 1 revision

<noinclude>
{{Documentation}}
</noinclude>

Template:Reflist/doc

2011-03-08T05:22:07Z

Slyons: 1 revision

<noinclude>{{documentation subpage}}</noinclude>


== Usage ==
Use this template to create a reference list in an article.

If used with no parameters, it will simply produce a reference list in a small font.

=== Multiple columns ===

Using <tt><nowiki>{{reflist|2}}</nowiki></tt> will create a two-column reference list, and <tt><nowiki>{{reflist|3}}</nowiki></tt> will create a three-column list.

Using <tt><nowiki>{{reflist|colwidth=30em}}</nowiki></tt> will allow the browser to automatically choose the number of columns based on the width of the web browser. Choose a column width that's appropriate for the average width of the references on the page.

Note: multiple columns currently render properly only in [[Mozilla Firefox]],<ref>{{cite web|accessdate=2006-11-24|date=[[2005-12-30]]|title=CSS3 Multi-Column Thriller|url=http://www.stuffandnonsense.co.uk/archives/css3_multi-column_thriller.html}}</ref> though the feature is included in [[Cascading Style Sheets|CSS3]], so it should work for a larger number of browsers in the future.<ref>{{cite web|url=http://www.w3.org/TR/css3-multicol|title=CSS3 module: Multi-column layout|publisher=[[World Wide Web Consortium|W3C]]|date=[[2005-12-15]]|accessdate=2006-11-24}}</ref>

=== Three options for usage ===

==== Option 1 (only specific references) - see [[w:The Rule]] ====

<pre>
== Content ==

Lorem ipsum.<ref>Source name, access date, etc.</ref>

Lorem ipsum dolor sit amet.<ref>Source name, access date, etc.</ref>

== References ==

{{reflist}}
</pre>

==== Option 2 (only general references) - see [[w:National Publications]] ====

<pre>
== Content ==

Lorem ipsum.

Lorem ipsum dolor sit amet.

== References ==

{{refbegin}}
* general reference 1
* general reference 2
{{refend}}
</pre>

==== Option 3 (both specific and general references) - see [[w:Elephant]] ====

<pre>
== Content ==

Lorem ipsum.<ref>Source name, access date, etc.</ref>

Lorem ipsum dolor sit amet.<ref>Source name, access date, etc.</ref>

Lorem ipsum.

Lorem ipsum dolor sit amet.

== References ==

{{reflist}}

{{refbegin}}
* general reference 1
* general reference 2
{{refend}}
</pre>

== See also ==
* [[w:Wikipedia:Citing sources]]
* [[w:Wikipedia:Footnotes]]
* Templates recommended for use with Reflist
** {{tl|Refbegin}}
** {{tl|Refend}}
* Similar-functioning templates
** {{tl|Footnotes}}
** {{tl|FootnotesSmall}}
** {{tl|Ref-section}}

== References ==
{{reflist}}

<includeonly>

[[Category:Citation templates| ]]


</includeonly>

Template:Refend/doc

2011-03-08T05:22:06Z

Slyons: 1 revision

<noinclude>{{documentation subpage}}</noinclude>

== Usage ==
I have suggested this template as an option for usage in the second and third of three options for citing notes on a wikipedia article. The original discussion can be found [[Template talk:Reflist#Instances of ref-small|here]]. Below is a copy of the 3 suggested options...

'''Option 1 (only specific references) - see [[The Rule]]'''

<pre>
== References ==

{{reflist}}
</pre>

'''Option 2 (only general references) - see [[National Publications]]'''

<pre>
== References ==

{{refbegin}}
* general reference 1
* general reference 2
{{refend}}
</pre>

'''Option 3 (both specific and general references) - see [[Elephant]]'''

<pre>
== References ==

{{reflist}}

{{refbegin}}
* general reference 1
* general reference 2
{{refend}}
</pre>

== See also ==

* {{tl|Reflist}}
* {{tl|Refbegin}}

<includeonly>

[[Category:Citation templates|{{PAGENAME}}]]


</includeonly>