University of Pacific

Displaying 1-22 of 22 results

  • White Papers // Oct 2013

    Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles

    The authors present a new technique to realize Attribute-Based Encryption (ABE) schemes secure in the standard model against Chosen-Cipher-text Attacks (CCA-secure). Their approach is to extend certain concrete Chosen-Plaintext Attack secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. They restrict...

    Provided By University of Pacific

  • White Papers // Jul 2013

    CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System

    The authors consider the problem of managing a dynamic heterogeneous storage system in a distributed way so that the amount of data assigned to a host in that system is related to its capacity. Two central problems have to be solved for this: organizing the hosts in an overlay network...

    Provided By University of Pacific

  • White Papers // May 2013

    The Legal Classification of Identity-Based Signatures

    Identity-based cryptography has attracted attention in the cryptographic research community in recent years. Despite the importance of cryptographic schemes for applications in business and law, the legal implications of identity-based cryptography have not yet been discussed. The authors investigate how identity-based signatures t into the legal framework. They focus on...

    Provided By University of Pacific

  • White Papers // Jan 2013

    Locally Self-Adjusting Tree Networks

    This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern. The authors present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found...

    Provided By University of Pacific

  • White Papers // Nov 2012

    Towards Dynamic Scripted pNFS Layouts

    Today's network file systems consist of a variety of complex sub-protocols and backend storage classes. The data is typically spread over multiple data servers to achieve higher levels of performance and reliability. A metadata server is responsible for creating the mapping of a file to these data servers. It is...

    Provided By University of Pacific

  • White Papers // Oct 2012

    Content, Connectivity, and Cloud: Ingredients for the Network of the Future

    A new network architecture for the Internet needs ingredients from three approaches: information-centric networking, cloud computing integrated with networking, and open connectivity. Information-centric networking considers pieces of information as first-class entities of a networking architecture, rather than only indirectly identifying and manipulating them via a node hosting that information; this...

    Provided By University of Pacific

  • White Papers // Sep 2012

    Profitable Scheduling on Multiple Speed-Scalable Processors

    The authors present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, they provide a tight analysis of the algorithm's competitiveness. Their results generalize and improve upon work by the researchers, which considers a single speed scalable processor. Using significantly different techniques, they can not only extend...

    Provided By University of Pacific

  • White Papers // Aug 2012

    On the Spanning Ratio of Partial Delaunay Triangulation

    Partial Delaunay Triangulation (PDT) is a well-known sub-graph construction that has already been used for years in the context of geographic routing and topology control. So far, it has been unknown if partial Delaunay triangulation is a network spanner. Network spanners are those sub-graph constructions which maintain the length of...

    Provided By University of Pacific

  • White Papers // Mar 2012

    Energy Efficient Clustering Using a Wake-Up Receiver

    The authors present a new energy-saving method for creating node clusters with similar sensor readings. The idea is to wake up a node/main transceiver only when data correlated to the node's own data is transmitted. This is achieved by encoding relevant parts of local data in a wake-up receiver's data...

    Provided By University of Pacific

  • White Papers // Aug 2011

    General Lower and Best Case Upper Bounds on Energy Optimal Multicasting in Wireless Ad Hoc and Sensor Networks

    Wireless ad hoc and sensor networks consist of small battery driven devices which communicate wirelessly without using a pre-installed network infrastructure. Regulatory and physical constraints prevent nodes from reaching all other nodes in one single communication hop. Moreover, multi-hop communication can be useful when the total energy consumed should be...

    Provided By University of Pacific

  • White Papers // May 2011

    Multihop Performance of Cooperative Preamble Sampling MAC(CPS-MAC) in Wireless Sensor Networks

    Cooperative Communication (CC) is a promising technique to combat fading in a wireless environment. In the authors' previous work, they proposed Cooperative Preamble Sampling (CPS)-Medium Access Control (MAC) protocol which highlighted the benefits of using CC in Wireless Sensor Networks (WSN). Initially, CPS-MAC performance was evaluated in a 3-node network...

    Provided By University of Pacific

  • White Papers // Oct 2010

    Segment-Based Packet Combining in a Cluster: To Combine or Not to Combine?

    Transmission schemes based on cooperative diversity, promise to increase transmission reliability by using cooperating single-antenna nodes. Examples of cooperative schemes include relaying and cooperative MIMO schemes. A key feature of cooperative diversity schemes is that the receiver of a packet is offered the opportunity to combine different copies of this...

    Provided By University of Pacific

  • White Papers // Jul 2010

    Concept and Prototype for a Real-Time Enabled Publish/Subscribe System

    Distributed computing systems often strive to decouple their communicating components (threads on a single node, or nodes in a network) from each other with respect to time, space/location, or flow/synchronization, so that they can operate as independently of each other as possible. One approach to let components in a distributed...

    Provided By University of Pacific

  • White Papers // Mar 2010

    Detection of Semantically Equivalent Fragments for Business Process Model Change Management

    Modern business process modeling environments support distributed development by means of model version control, i.e. comparison and merging of two different model versions. This is a challenging task since most modeling languages support an almost arbitrary creation of process models. Thus, in multi-developer environments, process models or parts of them...

    Provided By University of Pacific

  • White Papers // Feb 2010

    Dynamic Computation of Change Operations in Version Management of Business Process Models

    Version management of business process models requires that changes can be resolved by applying change operations. In order to avoid user intervention and enable the user to follow an arbitrary order when resolving changes, position parameters of change operations need to be computed dynamically. In such an approach, change operations...

    Provided By University of Pacific

  • White Papers // Aug 2009

    Improving Network Coded Cooperation by Soft Information

    Bit-wise XOR network coding has been shown to perform well in cooperative wireless transmission because of its simple coding operation and overall robustness increase due to combining of several messages. The authors' aim is to develop a cooperation protocol that uses basic and easy to implement operations but still combines...

    Provided By University of Pacific

  • White Papers // Jul 2009

    Ensuring Quality in Business-Driven Development of IT Systems Using Workflow Patterns

    Business driven development is a methodology to model IT solutions that directly satisfy business needs. Business process models become its central design artifacts. In order to fully leverage the potential of this approach the model quality must be as high as possible. This paper presents the common refinement steps from...

    Provided By University of Pacific

  • White Papers // Jan 2009

    Modeling Obstacles in INET/Mobility Framework: Motivation, Integration, and Performance

    Wireless network protocols are commonly evaluated through simulations. The achieved results may vary significantly with the modeled propagation environment. Protocols that use carrier sensing for collision avoidance may not operate properly in the presence of obstacles (e.g. buildings) that shield hosts from each other. These failures may not be recognized...

    Provided By University of Pacific

  • White Papers // Jun 2008

    Detecting and Resolving Process Model Differences in the Absence of a Change Log

    Business-driven development favors the construction of process models at different abstraction levels and by different people. As a consequence, there is a demand for consolidating different versions of process models by detecting and resolving differences. Existing approaches rely on the existence of a change log which logs the changes when...

    Provided By University of Pacific

  • White Papers // Mar 2008

    A Tool for Process Merging in Business-Driven Development

    The field of business process modeling has a long standing tradition. Recently, new requirements and opportunities have been identified which allow the tighter coupling of business process models to its underlying IT implementation: in Business-Driven Development (BDD), business process models are iteratively refined, from high-level business process models into models...

    Provided By University of Pacific

  • White Papers // Sep 2007

    Assuring Consistency of Business Process Models and Web Services using Visual Contracts

    Business Process Models describe workflows by a set of actions together with their ordering. When implementing business processes within a Service-Oriented Architecture, these actions are mapped to existing IT (web) services, which are then to be executed in the order specified by the business process. However, the execution of a...

    Provided By University of Pacific

  • White Papers // Mar 2007

    Verification of Business Process Quality Constraints Based on Visual Process Patterns

    Business processes usually have to consider certain constraints like domain specific and quality requirements. The automated formal verification of these constraints is desirable, but requires the user to provide an unambiguous formal specification. In particular since the notations for business process modeling are usually visual flow-oriented languages, the notational gap...

    Provided By University of Pacific

  • White Papers // Nov 2012

    Towards Dynamic Scripted pNFS Layouts

    Today's network file systems consist of a variety of complex sub-protocols and backend storage classes. The data is typically spread over multiple data servers to achieve higher levels of performance and reliability. A metadata server is responsible for creating the mapping of a file to these data servers. It is...

    Provided By University of Pacific

  • White Papers // Aug 2009

    Improving Network Coded Cooperation by Soft Information

    Bit-wise XOR network coding has been shown to perform well in cooperative wireless transmission because of its simple coding operation and overall robustness increase due to combining of several messages. The authors' aim is to develop a cooperation protocol that uses basic and easy to implement operations but still combines...

    Provided By University of Pacific

  • White Papers // Aug 2011

    General Lower and Best Case Upper Bounds on Energy Optimal Multicasting in Wireless Ad Hoc and Sensor Networks

    Wireless ad hoc and sensor networks consist of small battery driven devices which communicate wirelessly without using a pre-installed network infrastructure. Regulatory and physical constraints prevent nodes from reaching all other nodes in one single communication hop. Moreover, multi-hop communication can be useful when the total energy consumed should be...

    Provided By University of Pacific

  • White Papers // Aug 2012

    On the Spanning Ratio of Partial Delaunay Triangulation

    Partial Delaunay Triangulation (PDT) is a well-known sub-graph construction that has already been used for years in the context of geographic routing and topology control. So far, it has been unknown if partial Delaunay triangulation is a network spanner. Network spanners are those sub-graph constructions which maintain the length of...

    Provided By University of Pacific

  • White Papers // Mar 2012

    Energy Efficient Clustering Using a Wake-Up Receiver

    The authors present a new energy-saving method for creating node clusters with similar sensor readings. The idea is to wake up a node/main transceiver only when data correlated to the node's own data is transmitted. This is achieved by encoding relevant parts of local data in a wake-up receiver's data...

    Provided By University of Pacific

  • White Papers // May 2011

    Multihop Performance of Cooperative Preamble Sampling MAC(CPS-MAC) in Wireless Sensor Networks

    Cooperative Communication (CC) is a promising technique to combat fading in a wireless environment. In the authors' previous work, they proposed Cooperative Preamble Sampling (CPS)-Medium Access Control (MAC) protocol which highlighted the benefits of using CC in Wireless Sensor Networks (WSN). Initially, CPS-MAC performance was evaluated in a 3-node network...

    Provided By University of Pacific

  • White Papers // Oct 2010

    Segment-Based Packet Combining in a Cluster: To Combine or Not to Combine?

    Transmission schemes based on cooperative diversity, promise to increase transmission reliability by using cooperating single-antenna nodes. Examples of cooperative schemes include relaying and cooperative MIMO schemes. A key feature of cooperative diversity schemes is that the receiver of a packet is offered the opportunity to combine different copies of this...

    Provided By University of Pacific

  • White Papers // May 2013

    The Legal Classification of Identity-Based Signatures

    Identity-based cryptography has attracted attention in the cryptographic research community in recent years. Despite the importance of cryptographic schemes for applications in business and law, the legal implications of identity-based cryptography have not yet been discussed. The authors investigate how identity-based signatures t into the legal framework. They focus on...

    Provided By University of Pacific

  • White Papers // Oct 2013

    Direct Chosen-Ciphertext Secure Attribute-Based Key Encapsulations without Random Oracles

    The authors present a new technique to realize Attribute-Based Encryption (ABE) schemes secure in the standard model against Chosen-Cipher-text Attacks (CCA-secure). Their approach is to extend certain concrete Chosen-Plaintext Attack secure (CPA-secure) ABE schemes to achieve more efficient constructions than the known generic constructions of CCA-secure ABE schemes. They restrict...

    Provided By University of Pacific

  • White Papers // Jul 2013

    CONE-DHT: A Distributed Self-Stabilizing Algorithm for a Heterogeneous Storage System

    The authors consider the problem of managing a dynamic heterogeneous storage system in a distributed way so that the amount of data assigned to a host in that system is related to its capacity. Two central problems have to be solved for this: organizing the hosts in an overlay network...

    Provided By University of Pacific

  • White Papers // Sep 2012

    Profitable Scheduling on Multiple Speed-Scalable Processors

    The authors present a new online algorithm for profit-oriented scheduling on multiple speed-scalable processors. Moreover, they provide a tight analysis of the algorithm's competitiveness. Their results generalize and improve upon work by the researchers, which considers a single speed scalable processor. Using significantly different techniques, they can not only extend...

    Provided By University of Pacific

  • White Papers // Oct 2012

    Content, Connectivity, and Cloud: Ingredients for the Network of the Future

    A new network architecture for the Internet needs ingredients from three approaches: information-centric networking, cloud computing integrated with networking, and open connectivity. Information-centric networking considers pieces of information as first-class entities of a networking architecture, rather than only indirectly identifying and manipulating them via a node hosting that information; this...

    Provided By University of Pacific

  • White Papers // Jul 2010

    Concept and Prototype for a Real-Time Enabled Publish/Subscribe System

    Distributed computing systems often strive to decouple their communicating components (threads on a single node, or nodes in a network) from each other with respect to time, space/location, or flow/synchronization, so that they can operate as independently of each other as possible. One approach to let components in a distributed...

    Provided By University of Pacific

  • White Papers // Jan 2009

    Modeling Obstacles in INET/Mobility Framework: Motivation, Integration, and Performance

    Wireless network protocols are commonly evaluated through simulations. The achieved results may vary significantly with the modeled propagation environment. Protocols that use carrier sensing for collision avoidance may not operate properly in the presence of obstacles (e.g. buildings) that shield hosts from each other. These failures may not be recognized...

    Provided By University of Pacific

  • White Papers // Jan 2013

    Locally Self-Adjusting Tree Networks

    This paper initiates the study of self-adjusting networks (or distributed data structures) whose topologies dynamically adapt to a communication pattern. The authors present a fully decentralized self-adjusting solution called SplayNet. A SplayNet is a distributed generalization of the classic splay tree concept. It ensures short paths (which can be found...

    Provided By University of Pacific

  • White Papers // Jun 2008

    Detecting and Resolving Process Model Differences in the Absence of a Change Log

    Business-driven development favors the construction of process models at different abstraction levels and by different people. As a consequence, there is a demand for consolidating different versions of process models by detecting and resolving differences. Existing approaches rely on the existence of a change log which logs the changes when...

    Provided By University of Pacific

  • White Papers // Mar 2008

    A Tool for Process Merging in Business-Driven Development

    The field of business process modeling has a long standing tradition. Recently, new requirements and opportunities have been identified which allow the tighter coupling of business process models to its underlying IT implementation: in Business-Driven Development (BDD), business process models are iteratively refined, from high-level business process models into models...

    Provided By University of Pacific

  • White Papers // Jul 2009

    Ensuring Quality in Business-Driven Development of IT Systems Using Workflow Patterns

    Business driven development is a methodology to model IT solutions that directly satisfy business needs. Business process models become its central design artifacts. In order to fully leverage the potential of this approach the model quality must be as high as possible. This paper presents the common refinement steps from...

    Provided By University of Pacific

  • White Papers // Mar 2010

    Detection of Semantically Equivalent Fragments for Business Process Model Change Management

    Modern business process modeling environments support distributed development by means of model version control, i.e. comparison and merging of two different model versions. This is a challenging task since most modeling languages support an almost arbitrary creation of process models. Thus, in multi-developer environments, process models or parts of them...

    Provided By University of Pacific

  • White Papers // Feb 2010

    Dynamic Computation of Change Operations in Version Management of Business Process Models

    Version management of business process models requires that changes can be resolved by applying change operations. In order to avoid user intervention and enable the user to follow an arbitrary order when resolving changes, position parameters of change operations need to be computed dynamically. In such an approach, change operations...

    Provided By University of Pacific

  • White Papers // Sep 2007

    Assuring Consistency of Business Process Models and Web Services using Visual Contracts

    Business Process Models describe workflows by a set of actions together with their ordering. When implementing business processes within a Service-Oriented Architecture, these actions are mapped to existing IT (web) services, which are then to be executed in the order specified by the business process. However, the execution of a...

    Provided By University of Pacific

  • White Papers // Mar 2007

    Verification of Business Process Quality Constraints Based on Visual Process Patterns

    Business processes usually have to consider certain constraints like domain specific and quality requirements. The automated formal verification of these constraints is desirable, but requires the user to provide an unambiguous formal specification. In particular since the notations for business process modeling are usually visual flow-oriented languages, the notational gap...

    Provided By University of Pacific