The flexibility and the wide deployment of IP technologies have driven the development of IP-based solutions for wireless networks, like IP-based Radio Access Networks (RAN). These networks have different characteristics when compared to traditional IP networks, imposing very strict requirements on Quality of Service (QoS) solutions, such as fast dynamic resource reservation, simplicity, scalab...

Pricing is regarded as a solution to congestion control in telecommunication networks. Most mathematical models involve a so-called utility function accounting for the users’ willingness to pay. However, this utility function is unknown in practice in terms of shape and important arguments. We propose here to limit this degree of uncertainty by aggregating all arguments in one quantity, the per...

This paper investigates the use of an efficient bandwidth management scheme by implementing cross-layer M/M/1 queuing model. Strict Open System Interconnection (OSI) layer to layer communication problem is solved by introducing a common database that automatically synchronizes the status of each OSI layer to all the other layers. First-In-First-Out (FIFO) queuing data structure and Priority Que...

In this paper, we discuss and compare several policies to place replicas in tree networks subject to server capacity. The client requests are known beforehand, while the number and location of the servers are to be determined. The standard approach in the literature is to enforce that all requests of a client be served by a single server in the tree (Single). One major contribution of this pape...

Abduction is usually defined in terms of classical logical consequence. In this paper we substitute this ’inferential parameter’ by the notion of strict implication. By doing so we hope to put more of the intended meaning of the abductive explanative relation into the background theory. By using strict rather than material implication static domain knowledge for abductive tasks can deal with so...

We present a proof procedure for functional first-order logic programs. The programs we consider allow first-order goals (including disjunctions, conjunctions, negations, and quantifications on elements of the domain). Atoms are either built-in statements or reduction statements of the form t → s, meaning that t is reducible to s. Call-time choices are used and the functions are non-determinist...

This paper investigates the use of an efficient bandwidth management scheme by implementing cross-layer M/M/1 queuing model. Strict Open System Interconnection (OSI) layer to layer communication problem is solved by introducing a common database that automatically synchronizes the status of each OSI layer to all the other layers. First-In-First-Out (FIFO) queuing data structure and Priority Que...

This paper investigates the use of an efficient bandwidth management scheme by implementing cross-layer M/M/1 queuing model. Strict Open System Interconnection (OSI) layer to layer communication problem is solved by introducing a common database that automatically synchronizes the status of each OSI layer to all the other layers. First-In-First-Out (FIFO) queuing data structure and Priority Que...

This paper investigates the use of an efficient bandwidth management scheme by implementing cross-layer M/M/1 queuing model. Strict Open System Interconnection (OSI) layer to layer communication problem is solved by introducing a common database that automatically synchronizes the status of each OSI layer to all the other layers. First-In-First-Out (FIFO) queuing data structure and Priority Que...

This paper investigates the use of an efficient bandwidth management scheme by implementing cross-layer M/M/1 queuing model. Strict Open System Interconnection (OSI) layer to layer communication problem is solved by introducing a common database that automatically synchronizes the status of each OSI layer to all the other layers. First-In-First-Out (FIFO) queuing data structure and Priority Que...