<?xml version="1.0" encoding="UTF-8"?>

<rdf:RDF
   xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
   xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#"
   xmlns="http://purl.org/rss/1.0/"
   xmlns:dc="http://purl.org/dc/elements/1.1/"
   xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
   xmlns:dcterms="http://purl.org/dc/terms/"

>
<channel rdf:about="http://www.citeulike.org/about">
<pubDate>Thu, 21 Aug 2008 02:23:50 BST</pubDate>


	<title>CiteULike: wibkemichalk library [11 articles]</title>
	<description>CiteULike: wibkemichalk library [11 articles]</description>


	<link>http://www.citeulike.org/user/wibkemichalk</link>
	<dc:publisher>CiteULike.org</dc:publisher>
	<dc:language>en-gb</dc:language>
	<dc:rights>Copyright &#169; 2004-2008 citeulike.org</dc:rights>
	<items>
    <rdf:Seq>
        <rdf:li rdf:resource="http://www.citeulike.org/user/wibkemichalk/article/2975452"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/wibkemichalk/article/2910446"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/wibkemichalk/article/2910439"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/wibkemichalk/article/2766644"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/wibkemichalk/article/2761687"/>
        <rdf:li rdf:resource="http://www.citeulike.org/user/wibkemichalk/article/2761660"/>

	</rdf:Seq>
	</items>
	</channel>


<item rdf:about="http://www.citeulike.org/user/wibkemichalk/article/2975452">
    <title>SLA management in federated environments</title>
    <link>http://www.citeulike.org/user/wibkemichalk/article/2975452</link>
    <description>&lt;i&gt;Computer Networks, Vol. 35, No. 1. (January 2001), pp. 5-24.&lt;/i&gt;</description>
    <dc:title>SLA management in federated environments</dc:title>

    <dc:creator>P Bhoj</dc:creator>
    <dc:creator>S Singhal</dc:creator>
    <dc:creator>S Chutani</dc:creator>
    <dc:source>Computer Networks, Vol. 35, No. 1. (January 2001), pp. 5-24.</dc:source>
    <dc:date>2008-07-09T08:45:09-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:publicationName>Computer Networks</prism:publicationName>
    <prism:volume>35</prism:volume>
    <prism:number>1</prism:number>
    <prism:startingPage>5</prism:startingPage>
    <prism:endingPage>24</prism:endingPage>
    <prism:category>grid</prism:category>
    <prism:category>sla_management</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/wibkemichalk/article/2910446">
    <title>Requirements for service level agreement management</title>
    <link>http://www.citeulike.org/user/wibkemichalk/article/2910446</link>
    <description>&lt;i&gt;IP Operations and Management, 2002 IEEE Workshop on (2002), pp. 57-62.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The aim of the paper is to introduce and present the main drivers and basic concepts for SLA management. We discuss the business requirements according to two viewpoints: the customer's and the service provider's. We go into more detail on the technical requirements for both the SLA contract itself and the SLA management system. Finally, we give an overview of SLA management open issues in the industrial and research community.</description>
    <dc:title>Requirements for service level agreement management</dc:title>

    <dc:creator>E Marilly</dc:creator>
    <dc:creator>O Martinot</dc:creator>
    <dc:creator>S Betge-Brezetz</dc:creator>
    <dc:creator>G Delegue</dc:creator>
    <dc:identifier>doi:10.1109/IPOM.2002.1045756</dc:identifier>
    <dc:source>IP Operations and Management, 2002 IEEE Workshop on (2002), pp. 57-62.</dc:source>
    <dc:date>2008-06-20T12:10:19-00:00</dc:date>
    <prism:publicationYear>2002</prism:publicationYear>
    <prism:publicationName>IP Operations and Management, 2002 IEEE Workshop on</prism:publicationName>
    <prism:startingPage>57</prism:startingPage>
    <prism:endingPage>62</prism:endingPage>
    <prism:category>sla_management</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/wibkemichalk/article/2910439">
    <title>Policy Based SLA Management in Enterprise Networks</title>
    <link>http://www.citeulike.org/user/wibkemichalk/article/2910439</link>
    <description>&lt;i&gt;Policies for Distributed Systems and Networks (2001), pp. 137-152.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The Differentiated Services Architecture defines the mechanisms that are needed to offer multiple classes of services in an IP network. While this model offers significant scaling advantages over the signaling-oriented approach of Integrated Services, the management of a differentiated services network remains a complex problem. Since the operation of a differentiated network involves numerous access routers, core routers and servers, a consistent operation is difficult to achieve by independently configuring each device. In this paper, we explore a scheme to enable a network administrator to manage and configure DiffServ networks from a central location and also abstract away the specific details of device configuration, and allow him/her to express the management of the network in terms of application-oriented performance metrics. This leads to a simplification of network management task, which can be exploited to support business needs of an enterprise network, such as honoring Service Level Agreements provided to its customers.</description>
    <dc:title>Policy Based SLA Management in Enterprise Networks</dc:title>

    <dc:creator>Dinesh Verma</dc:creator>
    <dc:creator>Mandis Beigi</dc:creator>
    <dc:creator>Raymond Jennings</dc:creator>
    <dc:identifier>doi:10.1007/3-540-44569-2_9</dc:identifier>
    <dc:source>Policies for Distributed Systems and Networks (2001), pp. 137-152.</dc:source>
    <dc:date>2008-06-20T12:06:42-00:00</dc:date>
    <prism:publicationYear>2001</prism:publicationYear>
    <prism:publicationName>Policies for Distributed Systems and Networks</prism:publicationName>
    <prism:startingPage>137</prism:startingPage>
    <prism:endingPage>152</prism:endingPage>
    <prism:category>sla_management</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/wibkemichalk/article/2766644">
    <title>G-QoSM: A Framework for Quality of Service Management</title>
    <link>http://www.citeulike.org/user/wibkemichalk/article/2766644</link>
    <description>&lt;i&gt;&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;Some applications utilizing Grid computing infrastructure require the simultaneous allocation of resources, such as compute servers, networks, memory, disk storage and other specialized resources. Collaborative working and visualization are examples of such applications. In these applications, Quality of Service (QoS) is related to Grid services, and not just to the network connecting these services. With the emerging interest in &#34;Service-Oriented Grids&#34;, resources may be advertised and traded...</description>
    <dc:title>G-QoSM: A Framework for Quality of Service Management</dc:title>

    <dc:creator>Rashid</dc:creator>
    <dc:creator>Omer Rana</dc:creator>
    <dc:creator>David Walker</dc:creator>
    <dc:date>2008-05-07T14:07:21-00:00</dc:date>
    <prism:category>grid</prism:category>
    <prism:category>qos</prism:category>
    <prism:category>sla</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/wibkemichalk/article/2761687">
    <title>Configurable offers and winner determination in multi-attribute auctions</title>
    <link>http://www.citeulike.org/user/wibkemichalk/article/2761687</link>
    <description>&lt;i&gt;European Journal of Operational Research, Vol. 160, No. 2. (16 January 2005), pp. 380-394.&lt;/i&gt;&lt;br /&gt;&lt;br /&gt;The theory of procurement auctions traditionally assumes that the offered quantity and quality is fixed prior to source selection. Multi-attribute reverse auctions allow negotiation over price and qualitative attributes such as color, weight, or delivery time. They promise higher market efficiency through a more effective information exchange of buyer's preferences and supplier's offerings. This paper focuses on a number of winner determination problems in multi-attribute auctions. Previous work assumes that multi-attribute bids are described as attribute value pairs and that the entire demand is purchased from a single supplier. Our contribution is twofold: First, we will analyze the winner determination problem in case of multiple sourcing. Second, we will extend the concept of multi-attribute auctions to allow for configurable offers. Configurable offers enable suppliers to specify multiple values and price markups for each attribute. In addition, suppliers can define configuration and discount rules in form of propositional logic statements. These extensions provide suppliers with more flexibility in the specification of their bids and allow for an efficient information exchange among market participants. We will present MIP formulations for the resulting allocation problems and an implementation.</description>
    <dc:title>Configurable offers and winner determination in multi-attribute auctions</dc:title>

    <dc:creator>Martin Bichler</dc:creator>
    <dc:creator>Jayant Kalagnanam</dc:creator>
    <dc:identifier>doi:10.1016/j.ejor.2003.07.014</dc:identifier>
    <dc:source>European Journal of Operational Research, Vol. 160, No. 2. (16 January 2005), pp. 380-394.</dc:source>
    <dc:date>2008-05-06T15:23:48-00:00</dc:date>
    <prism:publicationYear>2005</prism:publicationYear>
    <prism:publicationName>European Journal of Operational Research</prism:publicationName>
    <prism:volume>160</prism:volume>
    <prism:number>2</prism:number>
    <prism:startingPage>380</prism:startingPage>
    <prism:endingPage>394</prism:endingPage>
    <prism:category>determination</prism:category>
    <prism:category>multi-attribute</prism:category>
    <prism:category>winner</prism:category>
</item>



<item rdf:about="http://www.citeulike.org/user/wibkemichalk/article/2761660">
    <title>Bid expressiveness and clearing algorithms in multiattribute double auctions</title>
    <link>http://www.citeulike.org/user/wibkemichalk/article/2761660</link>
    <description>&lt;i&gt;(2006), pp. 110-119.&lt;/i&gt;</description>
    <dc:title>Bid expressiveness and clearing algorithms in multiattribute double auctions</dc:title>

    <dc:creator>Yagil Engel</dc:creator>
    <dc:creator>Michael Wellman</dc:creator>
    <dc:creator>Kevin Lochner</dc:creator>
    <dc:identifier>doi:10.1145/1134707.1134720</dc:identifier>
    <dc:source>(2006), pp. 110-119.</dc:source>
    <dc:date>2008-05-06T15:11:42-00:00</dc:date>
    <prism:publicationYear>2006</prism:publicationYear>
    <prism:startingPage>110</prism:startingPage>
    <prism:endingPage>119</prism:endingPage>
    <prism:publisher>ACM</prism:publisher>
    <prism:category>determination</prism:category>
    <prism:category>multi-attribute</prism:category>
    <prism:category>winner</prism:category>
</item>



</rdf:RDF>

