{"title":"On the flow fairness of aggregate queues","authors":"Addisu Eshete, Yuming Jiang","doi":"10.1109/BCFIC-RIGA.2011.5733222","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733222","url":null,"abstract":"This paper presents S-SFQ which is a single queue design and implementation of the well-known Start-time Fair Queueing (SFQ). This aggregate queue orders packets based on their timestamps rather than order of arrivals. Through simulation, we show the performance gains of S-SFQ over other default single-queue schemes such as RED and FIFO in terms of link utilization and flow fairness. When sources implement end-to-end (e2e) congestion control, S-SFQ can fairly approximate the fairness, both simple and weighted, of per flow queues. In addition, we discuss in detail the adverse effect of packet loss synchronization problem common in such aggregate queues. The qualities of aggregate queue based router scheme may easily and single-handedly be taken away by this problem. Loss synchronization may surface during overloaded (rather than early) drops when the buffer becomes full (e.g., FIFO) or certain (upper) buffer thresholds are exceeded (e.g., RED).","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121558774","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":"Runtime verification of location-dependent correctness and security properties in Ambient Intelligence applications","authors":"A. Coronato, Alessandro Testa","doi":"10.1109/BCFIC-RIGA.2011.5733231","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733231","url":null,"abstract":"Ambient intelligence is an emerging discipline that brings intelligence to our everyday environments and makes those environments sensitive to us. Ambient Intelligence technologies are more and more frequently adopted in scenarios, like healthcare, crisis management, remote monitoring and control, which are critical for human safety. This requires that such a kind of applications be designed taking into account stringent dependability requirements. This paper presents a technique of runtime verification of location-dependent correctness and security properties for safety critical Ambient Intelligence applications; that is, a technique by means of which it is possible to continuously monitor and check the running system against security properties defined at design time.","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121520123","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":"Internet traffic description on a base of Markov-Additive Process of arrivals","authors":"A. Andronov, A. Latkov, Jelena Revzina","doi":"10.1109/BCFIC-RIGA.2011.5733236","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733236","url":null,"abstract":"The use of the Markov-Additive process of arrivals allows to take into account various classes of the arrived calls, the arrivals by batches, the dependence of arrival rate on the state of the random environment and so on. This probabilistic framework is used for the traffic description in the individual network channel having a certain capacity. The main considered aim is to determine the quotas of this capacity, those being given to each class of the arrived calls. The quotas must satisfy the condition when the channel load during fixed time interval did not exceed the limit level with the appointed probability. The Quadratic Penalty Method is used for the optimal quota assignment. The numerical example is considered too.","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130194780","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":"An Underwater Convergence Layer for Disruption Tolerant Networking","authors":"D. Merani, A. Berni, J. Potter, R. Martins","doi":"10.1109/BCFIC-RIGA.2011.5733227","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733227","url":null,"abstract":"Delay and Disruption tolerant networking (DTN) embraces the concepts of occasionally-connected networks that may suffer from frequent partitions and that may be comprised of more than one divergent set of protocols or protocol families. Since DTN was conceived to relax most of the assumptions associated with Internet protocols, the most important of which is the availability of an end-to-end path between source and destination for the duration of a communication session, it is possible to envision the application of DTN concepts to under-water acoustic networks, where the bandwidth-limited acoustic channel suffers frequent disruptions due to environmental factors. This paper presents the design and implementation of an Underwater Convergence Layer (UCL) for the DTN2 Reference Implementation, which provides DTN support for the WHOI Micro-Modem. UCL was tested in the field during the Acommsnet10 sea trial, in a heterogeneous context comprising underwater nodes communicating acoustically and surface nodes communicating with radio frequency. Initial results and lessons learned from field testing are also presented. The principal value of this development resides in the delivery of new capabilities towards the application of DTN concepts to the maritime domain, to enable functionalities like multi-hop acoustic communication, data mule using autonomous vehicles and gateways between different transmission media (e.g. between underwater acoustic communications and above water radio/satellite).","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125938012","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":"Interference resistance of Adaptive Multiuser Detection in asynchronous Detect and Forward relaying CDMA networks","authors":"A. Qureshi, T. Kanakis, P. Rapajic","doi":"10.1109/BCFIC-RIGA.2011.5733225","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733225","url":null,"abstract":"The uplink of an asynchronous Detect and Forward CDMA wireless network interference tolerance is investigated in this paper where relays and base station use Adaptive Multiuser Detection to detect incoming signals. Relays exchange data and channel information with the base station to achieve diversity gains. Due to non orthogonality of random spreading waveforms, Multiple Access Interference occurs, at both the relays and base station. In order to mitigate Multiple Access Interference, Adaptive Multiuser detection is been used by fractionally spaced linear transversal bank of filters. It is shown that Adaptive Multiuser Detection enables asynchronous cooperative communications while it is extremely effective with mitigating channel interference. It is also shown that the BER and Capacity performance of the scheme proposed in this paper is arbitrarily close to non linear MLSE theoretical upper bound results in a channel interference free operation. However, in the presence of channel interference our scheme outperforms the theoretical upper bound approach by nearly 9 dB at a BER of 10−3 and by 17 bits/s/Hz in Capacity at a SNR of 30dB.","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129761510","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":"Optimizing message delivery in mobile-opportunistic networks","authors":"Muhammad Arshad Islam, M. Waldvogel","doi":"10.1109/BCFIC-RIGA.2011.5733212","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733212","url":null,"abstract":"The big challenge of routing in opportunistic mobile networks, overlooked by most researchers, is to not only find any path to the destination, but a path that is stable and powerful enough to actually carry the message. Few attempts addressed this problem, all of them under controlled scenarios, avoiding the complexity of real-world connectivity. As a result of our comparison of selected networks under a wide variety of realistic scenarios, we have not only been able to identify and describe favorable traits of protocols, but also necessary relationship of successful MON protocols with QoS routing in wired networks. We present a novel protocol, Nile1, that performs both in dense as well as sparse networks. Nile is the first autonomous “controlled Hooding” protocol that keeps the link loads in check, to push replicas only on those paths that are both promising and may sustain more load. It is a multi path protocol that deploys replication based on heuristic for disjoint path calculation. Other protocols' performance, when simulated in real-world traces, highly depends on parameter choice. Nile, however, consistently performs among the top protocols without any external tuning and exerts far less overhead than other replication protocols.","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114259244","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}
S. L. Kiani, Boris Moltchanov, M. Knappmeyer, N. Baker
{"title":"Large-scale context-aware system in smart spaces: Issues and challenges","authors":"S. L. Kiani, Boris Moltchanov, M. Knappmeyer, N. Baker","doi":"10.1109/BCFIC-RIGA.2011.5733229","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733229","url":null,"abstract":"Smart spaces are characterised by availability of information from digital artifacts embedded in the environment and network services that unobtrusively enhance our interaction with the digital world. User and environment context plays a vital role in deciding the usability of information services available in a smart space. Making this context available and coordinating it across the network, geographic and administrative boundaries of individual smart spaces are significant challenges that have not been adequately addressed in existing context-aware systems. We discuss various facets of this challenge and present an architecture based on federation of context brokers for large-scale context dissemination in smart spaces.","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123320385","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":"Simulation of typical behavior user using Markov models","authors":"P. Osipov, Arkādijs Borisovs","doi":"10.1109/BCFIC-RIGA.2011.5733241","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733241","url":null,"abstract":"described the problem of modeling the behavior of a typical user of an electronic information system to detect the fact of use of his account by another person. Investigated method that allows presenting the typical behavior of a user in the form of Markov model and further assessing the target user's behavior compared with the pattern presented in the corresponding model. In the process of research an experimental system was developed that allows evaluating the possibility of using Markov models to solve this problem and the statistical properties of the created model. The results of the initial experiments show good suitability of this approach.","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128430584","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}
S. Andreev, Y. Koucheryavy, Luis Filipe Dias de Sousa
{"title":"Calculation of transmission probability in heterogeneous Ad Hoc Networks","authors":"S. Andreev, Y. Koucheryavy, Luis Filipe Dias de Sousa","doi":"10.1109/BCFIC-RIGA.2011.5733238","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733238","url":null,"abstract":"This paper addresses the problem of MAC performance evaluation of a contemporary IEEE 802.11 WLAN. The network is observed under saturation conditions and the packet transmission probability analysis is conducted with the novel regenerative approach. The proposed model accounts for collision resolution protocol parameters, packet retry limit, coexistence of unicast and broadcast traffic, and heterogeneous QoS environment. Our analytical model is a generalization of several well-known models extensively used in the field. The obtained results are verified to demonstrate perfect agreement with ns-2 simulations.","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124272965","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":"A novel model for social networks","authors":"Sreedhar Bhukya","doi":"10.1109/BCFIC-RIGA.2011.5733213","DOIUrl":"https://doi.org/10.1109/BCFIC-RIGA.2011.5733213","url":null,"abstract":"A number of recent studies on social networks are based on a characteristic which includes assortative mixing, high clustering, short average path lengths, broad degree distributions and the existence of community structure. Here, a model which satisfies all the above characteristics is developed. In addition, this model facilitates interaction between various communities. This model gives very high clustering coefficient by retaining the asymptotically scale-free degree distribution. Here the community structure is raised from a mixture of random attachment and implicit preferential attachment. In addition to earlier works which only considered Neighbour of Initial Contact (NIC) as implicit preferential contact, we have considered Neighbour of Neighbour of Initial Contact (NNIC) also. This model supports the occurrence of a contact between two Initial contacts if the new vertex chooses more than one initial contacts. This ultimately will develop a complex social network rather than the one that was taken as basic reference.","PeriodicalId":428618,"journal":{"name":"2011 Baltic Congress on Future Internet and Communications","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-03-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116042327","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}