{"title":"Proportional Nested Deficit Round Robin: Improving the Latency of Packet Scheduler with an O(1) Complexity","authors":"Afshin Shiravi, Yoon G. Kim, P. S. Min","doi":"10.1109/AAA-IDEA.2005.14","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.14","url":null,"abstract":"In recent years, many fair packet scheduling algorithms have been proposed for switches and routers to provide the quality of service (QoS) guarantees required by many applications. In addition to the fairness and low end-to-end delay that these algorithms have to have, simplicity and scalability are two significant factors that play an important role. In this paper, we present a new scheduling discipline called proportional nested deficit round robin (PNDRR), which has a low latency and reduces burstiness. PNDRR is a class of nested-DRR in which each DRR round is split into some smaller inner rounds. However, unlike nested-DRR, flows receive credits proportional to their deficit counters in each inner round. PNDRR takes advantage of the input traffic pattern and decreases the serving size of flows when the input traffic contains many small packets. This helps to interleave packets in many practical scenarios, such as the Internet, where the majority of packets are relatively small. The latency and fairness of PNDRR are studied and compared to other algorithms using simulation. PNDRR has a per-packet computational complexity of O(1)","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115719062","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Autonomic Data Placement Strategies for Update-intensiveWeb applications","authors":"S. Sivasubramanian, G. Pierre, M. Steen","doi":"10.1109/AAA-IDEA.2005.4","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.4","url":null,"abstract":"Edge computing infrastructures have become the leading platform for hosting Web applications. One of the key challenges in these infrastructures is the replication of application data. In our earlier research, we presented GlobeDB, a middleware for edge computing infrastructures that performs autonomic replication of application data. In this paper, we study the problem of data unit placement for update-intensive Web applications in the context of GlobeDB. Our hypothesis is that there exists a continuous spectrum of placement choices between complete partitioning of sets of data units across edge servers and full replication of data units to all servers. We propose and evaluate different families of heuristics for this problem of replica placement. As we show in our experiments, a heuristic that takes into account both the individual characteristics of data units and the overall system load performs best","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125454601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Architectures for scalable and flexible Web personalization services","authors":"C. Canali, S. Casolari, R. Lancellotti","doi":"10.1109/AAA-IDEA.2005.2","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.2","url":null,"abstract":"The complexity of services provided through the Web is continuously increasing and issues introduced by both heterogeneous client devices and Web content personalization are becoming a major challenge for the Web. The content adaptation operations may be computationally expensive, requiring high efficiency and scalability in the Web architectures. Tailoring Web and multimedia resources to meet the user and client requirements opens two main novel issues in the research area of content adaptation and delivery. First, the characteristics of the content adaptation services have a significant impact on the possible mapping of the services over the nodes of the content adaptation infrastructure. Second, the relationship of the content adaptation system with the content provider has a fundamental impact on the architectural choices in the design of content adaptation systems. In this paper, we propose four novel distributed architectures for the efficient delivery of content adaptation services where the nodes are organized in two levels. We compare the performance of the four architectures to evaluate which architecture is the best and under which conditions the performance gain is more evident","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132871652","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"SOSIMPLE: A Serverless, Standards-based, P2P SIP Communication System","authors":"D. Bryan, B. Lowekamp, C. Jennings","doi":"10.1109/AAA-IDEA.2005.15","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.15","url":null,"abstract":"Voice over IP (VoIP) and instant messaging (IM) systems to date have either followed a client-server model or have required the use of clients that do not follow any VoIP or IM standard. We present SOSIMPLE - a fully decentralized, P2P, standards-based approach to communications. By building on the existing SIP/SIMPLE infrastructure for VoIP and IM, we support reuse of clients, network infrastructure, and open-source protocol stacks designed using current standards. By avoiding traditional centralized architectures, SOSIMPLE addresses corporate privacy concerns, eliminates dependency on constant Internet connectivity, and supports ad hoc groups. SOSIMPLE implements a DHT overlay based on Chord (Stoicha et al., 2001) using SIP messages, replicating location information for reliability. The DHT is used only for lookups, with actual communication passing directly between clients. We discuss important issues for security and authentication, as well as adaptations of conventional P2P routing for the social networks typical of personal communications. We are testing a prototype implementation of SOSIMPLE and anticipate a public release in the near future","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132558604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Stuart J. Norcross, A. Dearle, G. Kirby, S. M. Walker
{"title":"Stuart J. Norcross","authors":"Stuart J. Norcross, A. Dearle, G. Kirby, S. M. Walker","doi":"10.1109/AAA-IDEA.2005.16","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.16","url":null,"abstract":"This paper describes an infrastructure for the deployment and use of Web Services that are resilient to the failure of the nodes that host those services. The infrastructure presents a single interface that provides mechanisms for users to publish services and to find hosted services. The infrastructure supports the autonomic deployment of services and the brokerage of hosts on which services may be deployed. Once deployed, services are autonomically managed in a number of aspects including load balancing, availability, failure detection and recovery, and lifetime management. Services are published and deployed with associated metadata describing the service type. This same metadata may be used subsequently by interested parties to discover services. The infrastructure uses peer-to-peer (P2P) overlay technologies to abstract over the underlying network to deploy and locate instances of those services. It takes advantage of the P2P network to replicate directory services used to locate service instances (for using a service), Service Hosts (for deployment of services) and Autonomic Managers which manage the deployed services. The P2P overlay network is itself constructed using novel Web services-based middleware and a variation of the Chord P2P protocol, which is self-managing.","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127130348","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Design and Evaluation of Diffserv Functionalities in the MPLS Edge Router Architecture","authors":"Wei-Chu Lai, Kuo-Ching Wu, T. Hou","doi":"10.1109/AAA-IDEA.2005.5","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.5","url":null,"abstract":"Differentiated service (DiffServ) in combination with multiprotocol label switching (MPLS) is a promising technology in converting the best-effort Internet into a QoS-capable network. This paper describes the design and implementation of key DiffServ components, including classifier, meter/shaper, queue manager, and scheduler, in an MPLS edge router architecture on a network-processor platform. We describe how the DiffServ functionalities were realized and also analyze the performance of the system under different traffic patterns. Various factors that cause performance degradation in the architecture are observed and analyzed. These include receiving processing architecture, transmitting processing architecture, micro-engine processing power, memory access latency, and complexity of each DiffServ component. Among them, we found that traffic classification demands more processing resource and hence is a major factor in limiting the system throughput","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128809964","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Maarten Wijnants, Patrick Monsieurs, P. Quax, W. Lamotte
{"title":"Exploiting Proxy-Based Transcoding to Increase the User Quality of Experience in Networked Applications","authors":"Maarten Wijnants, Patrick Monsieurs, P. Quax, W. Lamotte","doi":"10.1109/AAA-IDEA.2005.6","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.6","url":null,"abstract":"In this work we describe how we extended the functionality of our previously introduced application and network aware proxy system with transcoding capabilities. Based on their compound awareness, our proxies devise a strategy for every connected client that intelligently distributes the client's available bandwidth over the different application data streams. The proxies subsequently put each computed bandwidth allocation strategy into effect by managing and transcoding data streams inside the network before they reach the client. We also present results from the integration of our work into an existing networked virtual environment. These results clearly indicate that our intelligent proxy, enhanced with its novel transcoding functionality, can increase the user quality of experience considerably in networked applications","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125520366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Towards Partially Synchronous Overlays: Issues and Challenges","authors":"J. Shamsi, Chunbo Chu, M. Brockmeyer","doi":"10.1109/AAA-IDEA.2005.17","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.17","url":null,"abstract":"The main advantage of synchronous systems over asynchronous systems is that timing and reliability guarantees can be established ensuring a strong programming model for many applications. These strong guarantees are not provided by the current model of the Internet. However the Internet possesses some synchronous properties which can be exploited to observe partial synchrony, leading to a stronger programming model. In this paper, we argue the importance of synchrony and describe mechanisms which can be used for the construction of partially synchronous overlays on the Internet","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130480320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extending WF^2 Q+ to Support a Dynamic Traffic Mix","authors":"P. Valente","doi":"10.1109/AAA-IDEA.2005.7","DOIUrl":"https://doi.org/10.1109/AAA-IDEA.2005.7","url":null,"abstract":"WF2Q+ is a packet scheduler providing optimal QoS guarantees at a low computational complexity. It allows a fraction of the total link capacity to be reserved to each packet flow to transmit, and it guarantees to each flow the minimum possible deviation with respect to its reserved service over any time interval. WF2Q+ has been defined assuming that the set of the packet flows to transmit is fixed and known at system design time. Unfortunately, such assumption is widely violated in many systems, such as Web servers or Internet routers. In this paper we propose a general scheme for extending WF2Q+ to support also the case where the set of packet flows to transmit is unknown beforehand and varies over time. The scheme preserves the service guarantees provided by WF2Q+, and allows different tradeoffs to be realized between computational complexity and system responsiveness to changing traffic mixes. After investigating the pros and cons of the possible solutions based on such general scheme, we present a simple and efficient algorithm for enabling WF2Q+ to support a dynamic traffic mix","PeriodicalId":415499,"journal":{"name":"First International Workshop on Advanced Architectures and Algorithms for Internet Delivery and Applications (AAA-IDEA'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121979106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}