Ntw 401i

Question 1

1.1) Adaptive clock recovery is required in order to transmit the synchronous data of conventional time-division multiplexing (TDM) services to another TDM network across an asynchronous packet switched network (PSN).

In this paper, we propose an adaptive clock recovery mechanism having dynamic frequency drift, which enables faster response with smaller residual variance, and buffer level control to reduce the required jitter buffer size with no buffer underflow or overflow

1.2) RSA is an algorithm for public-key cryptography.[1] It is the first algorithm known to be suitable for signing as well as encryption, and was one of the first great advances in public key cryptography. RSA is widely used in electronic commerce protocols, and is believed to be sufficiently secure given sufficiently long keys and the use of up-to-date implementations.

Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty. In this context, a computational problem is understood to be a task that is in principle amenable to being solved by a computer (which basically means that the problem can be stated by a set of mathematical instructions). Informally, a computational problem consists of problem instances and solutions to these problem instances. For example, primality testing is the problem of determining whether a given number is prime or not. The instances of this problem are natural numbers, and the solution to an instance is yes or no based on whether the number is prime or not.

Question 2

2.1) Adaptive routing describes the capability of a system, through which routes are characterized by their destination, to alter the path that the route takes through the system in response to a change in conditions[1]. The adaptation is intended to allow as many routes as possible to remain valid (that is, have...