So, we will start with now the issue of cross point complexity of rearrangeable as well as a strictly non-blocking class network, but this time what we will do is we will not actually compute this thing for a simple class network. Actually, I have done this thing for a simple strictly non-blocking class network earlier, but now we will do what we call recursive construction of these switches. We can actually further optimize and then we have to find out what is the most optimal configuration in that and actually it is very difficult to find out an optimal configuration, but since we are looking for a bound, any value is going to be fine. So, I am going to look at whatever minimum I can achieve, but there can still be better bounds. That room is still there, but whatever has been so far in the literature that is what we are going to look into. So, if you look at cross point complexity, this recursive construction, so first of all let us take rearrangeable network. So, there will be m 1 by n 1 and we will have some middle state switches and we already know the definition that by so far using slip and duvet theorem that your R 2 has to be greater than or equal to maximum of m 1 or m 3 that is the condition which has to be satisfied. What we will look is in this case, I am just going to change my variable, so that they have become consistent with my notes, but I think you should be able to understand this step. Now, instead of using m by n, I am going to use p by q. The idea here is that I am now worried about total number of 4 and I want an optimal configuration for this and this n can be now broken into two numbers which is p by q. Once I do this, so for a n by n switch because this dimension has to be kept fixed, I have to build up a reasonably non-blocking switch and find out what is the cross point complexity. That is the idea. So, in this case what we will do is I am also going to make an assumption. Let me change the dimension here. This p by q, so this actually means number of switches which will be present will be q, 1 to p. Now, each one of the inputs will be n by q, this has to be q and I am talking about n by n switch symmetric calculation. I am not worried about asymmetricity as of now because I am looking at a bound for n by n. For n by n cross bar, it is o n square. So, this is a typical configuration. So, this is again q number. This number is going to be p. So, this will also be n by p. So, q number of 4 which are coming out. So, number of cross points here will be pretty simple. It will be p into q will be number of cross points here and total p number of switches are there. So, it is p. This actually similar kind of structure gets repeated here. So, you multiply it by 2 plus the q switch is here. Each one of them will have p by p, p square. It is q into q. p cross n upon p. How many inputs are coming? n plus p cross n plus p should be there. I think I have to restructure it. I have actually reversed. This value I have made a mistake here. This is q by q. So, this has to be q square. This n by p is nothing but q inputs. So, q inputs q outputs. So, these are q square complexity and their p number of switches are multiplied by p and 2 times. Each switch is p by p switch here. So, it is p square q times. In my notes, it was actually reversed. That is why the confusion actually happened. In fact, I can draw this something like this. So, this is q by q each one of them 1, 2 and so on. And you have total p switches. So, I can just put the boards like this. So, there are q inputs and q ports are going on. Then I can create a cross connection and so on. So, it is 1, 2, q each one of them is p by p. So, these are q ports coming out and here q ports going in. So, you can actually look into this kind of structure. So, I am doing exactly this in three-dimensional space. This cross is you need not remember. And for strict sense non-blocking, I can also draw the same diagram. Except in this case, now what will happen is the condition is r 2 has to be greater than or equal to m 1 plus n 3 minus 1. And since I am looking into the p by q kind of split, this value will be how much? Number of ports are q. So, 2 q minus 1. So, if you make the equivalent figure, just for memory sake, you are expanding actually. So, 1, 2, 3 and you will have total p switches going here. Number of switches which are stacking here, 1, 2 and so on. And the last one will be 2 q minus 1 and this will be a p by p switch. And this will be an expansion of 2 q, 2 inputs and 2 q minus 1 output. Same is going to be 2 here on this side. 2 q minus 1 input and 2 output. So, that is a strict non-blocking switch. This switch is a n by n switch. I am now factorizing into p by q. Some numbers, see I have to factorize then only I can create a strict non-blocking switch. And then of course, once I do this p by q, I have to find out what is the cross-pointing complex. I am trying to identify, get a hint how I should divide p and q. What value of p I should, I can take, there are many options of factorizing. Which option I should take, which will give me the least value, minimum value of this cross-point, number of cross-points in this whole switch matrix. So, if I take n by p is equal to q actually as per this. So, it is a q by q switch. I only require q by q here for rearrangeably non-blocking configuration. If it is a strictly non-blocking configuration, this will be 2 into q minus 1. So, this switch is equivalent to this sum. When you want to draw equivalent to this one, you will make a change and in that case, this will be 1, this will be 2 and so on, this will be 2 q minus 1. So, I am drawing with a different color. So, this color corresponds to a strictly non-blocking configuration. So, this value instead of this will be 2 q minus 1. This value also will be 2 q minus 1. This still remains same. Only this will change to 2 q minus 1. Rest everything remains same. So, in that case also, you can find out a cross-point complexity. This is a cross for rearrangeably. This is a cross for strictly non-blocking. So, for this, what will be the value? So, here the cross-point complexity is 2 into 2 q minus 1. This happens t time. The two stages are symmetric and you have t square to q minus 1, but I have not chosen a recursive construction. In fact, each one of these blocks can be further reconstructed by again using a three-stage network and we always know if I go to a three-stage network from a single cross-bar, I reduce some cross-point. So, number of cross-points will get further reduced with each one of these stages, each one of these switching elements is further broken down into fundamentally. That is a recursively I will keep on doing it. So, I have to just find out a formula and do the recursive solution. It will form a series and we will get a solution from there. Now, coming back to first of all strictly non-blocking, here you can see what will be the form. So, maximum contribution comes from this thing. So, I would like to have q as small as possible. If I keep q as small as possible, my cross-point will be less. This is clear and when I recursively take each element and further break it, it will because I am anyway taking it. So, every time I will keep on doing it, it will be minimizing. So, I know what is going to be a minimum value. Here it is not very straightforward what will be the minimum value. Here we will come later on because if I try to minimize on this, other side actually expands. So, number of cross-points optimum does not happen when q is minimum. Here it is going to happen that way actually. So, that is a hint and then from there we can further solve it. So, in this case, so you can always take q as 2. So, once q is taken as a 2, what will be value of q n by 2? 2 is the minimum value possible and I am taking n as 2 raise power i. That is usually is the simpler thing to do is that n is always assumed to be 2 raise power i, where i is an integer. In fact, i should be a natural number. I should not even call it an integer. So, that is the condition which usually will be taken. So, in this case, so what will be the cross-point complexity? Now, this q can be, this p can be further broken down and I will get 2 into n by 4 configuration. So, I can keep on doing it actually this way. So, for example, say let us I want to build up a 8 by 8 switch. How I will do it actually? So, 8 by 8 is, if I take q is equal to 2 and q is equal to 8 by 2, which is 4, which actually means the switch will be of this kind and I have got now 4 by 4 switches here. So, can you remember from something from this? I have talked about this earlier in one of the lectures. Yes, here I essentially going to that. I can now further do this 4 by 4 can be broken. This is strict, this is rearrangeable non-blocking. So, if I represent, I also make 4 by 4 by a rearrangeable non-blocking switch will remain rearrangeable non-blocking. In earlier construction what I have done was, I did something, I never told you that I just only stated rearrangeable non-blocking, but now you know why it is going to be rearrangeable non-blocking. What is the reason? Because that condition is always going to be satisfied that R 2 has to be greater than or equal to maximum of m 1 and m 3. So, this 4 by 4 further can be actually done and I can replace this by and the three stage network. So, this is it and same thing will go here, same structure. This is a recursive construction. So, every time in the end how many stages will be there? If I keep on doing it and from there I can find out the cross point complexity. So, in this case you will find out, you will require 2 log 2 n minus 1 these many stages, if you count each one is a 2 by 2 and assuming n is equal to 2 this power i. The reason for this is when I did first division, I got first stage and last stage, middle stage was a larger switch. So, I got two stages plus first middle one. I further break it, two more stages will come out a middle one. Ultimately in the end the middle one will be nothing but a 2 by 2 in the end. So, first time two stages came out, next time two stages came out and the middle one, the last stage. This will keep on happening till log 2 n time. Then ultimately you go to 2. When it is 2 by 2 you simply. So, it has actually 2 log 2 n because here I am not getting 2, but only 1. So, I am subtracting 1 actually. In the end I will get 2 by 2 which is equal to 1. So, that has to be subtracted. I am not getting 2 in the last one. So, I am subtracting that. Now, I know that how many switches will be there. These are going to be n by 2 switches of 2 by 2. So, cross point complexity in this case will be whatever the cross point complexity of a 2 by 2 switch. This is basic element. This cannot be further broken. It is not possible. It has to have either cross or bar state. So, it requires 4 cross points. So, I can write that cross point number directly here. So, I can write this 4 is for a 2 by 2 switch. Number of switches are n by 2 and number of stages are 2 log 2 n minus 1. So, which gives the cross point complexity as 2 n, but this exact number of cross point is not complex. So, lower order terms can be removed actually. So, there are two terms here. One is going to be 4 n log 2 n minus 2 n. So, 2 n is having lower order than the first term which is being subtracted. So, I am looking at a bound. So, this is going to be order of n log 2 n. So, as n grows, how the number of cross points grows? In this case, that is what you can estimate from here for this recursive construction. I think this is the number of steps. 2 log 2 n minus 1 is number of stages. Yes. So, each stage we have n by 2 switches. Right. Each stage will be n by 2 of those stages. Well, the recursively constructed reagent and non-blocking switches are far simpler. Because each 2 by 2 elements, this cannot be broken further. This requires 4 cross points. It is not, complexity always means, if I am changing my dimension or size, complexity essentially deals with that. It does not deal with the exact number. So, for example, if my class, simple example I am taking, if my class size is n, n number of strings, number of questions which will be asked in 1 hour. How it grows as my n grows? So, I can do kind of a theoretical, basically an experimental observation based on that I figure out, if my n grows, n is here. How my number of questions grows? If this grows like this, there is a problem actually. Complexity is 2-1. If it grows like this, this is a different scenario. It can grow linearly. That is also a problem. But usually by experience we know, this is always going to be, initially it grows like this, then it goes down. It is not even like this. Slope is all usually less than 1, because 10 strings will never ask 10 questions per hour. It is usually less than that. Slope is always less than 1 and it saturates. So, because what happens, most of the strings will actually have common questions. So, the first guy who asks, he gets the answer. Other people also get the answer. So, intuitively I know, this is going to be of this kind. So, idea is how the growth happens. So, essentially what I am not worried about is not the exact value. Exact value can always be computed, but what I am worried about as n grows, what happens? So, it is not linear. So, remember what we had n square. N square is a curve of this kind. And there is, in fact, this has been drawn wrongly. If it is going to be the same scale, it will be something like this. n is equal to 1 will be something like this. N log n will be something like this, which will cross over. That is what your, this is a cross path. This is going to be your, this will be your rearrangeably non-blocking switch. A shape is going to be like this, but I am not sure whether this n log 2 n 1, a slope I think also has to be like this. It has to be something like this, n log n, not the upper one. This has to be like this. But remember this is rearrangeably non-blocking. This is strictly, this is o n, complexity is not there. n log 2 n, no, I think o n log 2 n has to be higher. This cannot be lower. This has to be higher. I was correct. This one is strictly non-blocking. These are not up to scale. If you put it on same scale, this always at larger dimension, this is not good actually. It is strictly non-blocking. Lower dimension is strictly non-blocking is fine, but I am not using integers because switching means all values are discrete. Number of input ports changes 1, 2, 3, 4. You cannot have 1.5 input ports. So, these are just for notational purpose actually. The question is, this kind of complexity is better n log n because it is not exploding. The number is not exploding actually, it will be larger. Yeah, o n is a complexity of 3 by 2 also. Yeah, o n 1.5. So, which is going to be somewhere in between these two. So, I have not plotted exactly. I am just by intuition drawing it here. These need to be verified. So, let us go for a strictly non-blocking which how we will compute for that. Of course, as I stated earlier, this is a base line, this is a Benz network. If you break this, these are the output, taken as output ports, they say base line network. If I take these are the input ports and these are output ports, these are inverse base line network. So, they actually come in the category of Banyan networks. Banyan networks has a property where there is exactly one path between each input and output port. These are required for self routing which is actually, for packet switching systems. So, coming to now strictly non-blocking configuration, how that will be achieved? That is not recursive construction. We just did the break up. That was not for recursive construction. So, now we will go to the recursive construction. So, idea is this. You remember these red ones now. That is a configuration and with these red ones, this has to be now recursively constructed. The question is what should be P and Q? First question always comes to this. There in fact, it does not matter what way I do the break up. I can always do 2 raise power k into 2 raise power j kind of break up and keep on breaking it further. You will always get 2 log 2 and minus 1 stages. You may not end up in getting the same Banyan network kind of thing. But here, this choice is very crucial because in this case, your cross point complexity actually is 2 into Q, 2 Q minus 1 plus and this can be now approximated as 4 Q square. I can forget, for example, this minus 2 Q is a very small element. I can add that. I am only increasing my cross points because I am worried about the actually bounds, not about the exact estimate. So, this can always be done, this kind of approximation. So, I can estimate this thing as 4 Q square. Yeah, you are right. I will put a P here, 4 Q square plus P and this will be 2 and this can be written as and what we can do is, in fact, over 3 by 2 when we computed and 3 by 2 complexity. We have to break this down. Now, question is this value, whatever I do, I do not know the optimum. For optimum, it is going to be difficult. I have to first of all optimize, take the derivative of this and then, of course, try to compute. We got some value actually earlier, it was I think root n by 2. So, what we want is just create a bound. So, if I actually keep it P and Q both equal and make it root of n, it is going to be simpler to compute and whatever I compute will be a bound. Actual estimate will always be lower than this. Can we make lower than this, if you can carefully build up that? So, we will do with that P is equal to root of n and Q is equal to root of n. So, from here also, I think you can try it out. I think it will say root of n by 2 will actually come, n by 2 square root will come from here also. But I am not going to do with that, I am going to take P is equal to root of n and Q is equal to root of n. So, that will place a number of restriction number of quotes incoming. No, incoming quotes is n. This is only break up, which I am taking here. n is fixed. n clearly has to be integers per set. So, you have to choose, there is a restriction on n in that sense. But I am not worried about now exactly those restrictions. I am just trying to create an expression. This is kind of not exact thing, but it gives an idea. So, again for convenience sake, I can take n is equal to 2 raise power n and I can take this, sorry 2 raise power n and this n is nothing but 2 raise power l, where l is a natural number, where l is an integer actually, positive integer. So, under I am further restricting this, because that is how I can compute, otherwise it is going to be difficult to compute. If I take for example, this Q is equal to 3, this becomes a different situation. So, I am usually restricting to only 2 raise power i kind of situations, which are built that way. The reason being because you optimally use your address space. We are working mostly with binary systems and easily there is a wire, if it is on and on, it gives 0 and 1 and for through multiple buses, multiple wires in a bus, I am trying to generate addresses. Each port has to be addressed for controlling. So, you will never build up a 3 by 3 switch usually, you will always make 4 by 4, 3 by 3 also requires 2 control lines and 4 by 4 also require 2 control lines, 5, 6, 7 does not matter, next is 8 actually, it requires 3 control lines. So, control space you are always trying to optimize. So, that is the reason why 2 raise power i, 2 raise power n actually is used, but I am further putting up these restrictions in this case, because I have to do square root, because of that this has been done. So, what will happen is now, the first element I can write this is 2 raise power. So, number of this switches are q. So, q will be now n is this, you take the square root 2 raise power n minus 1, n by 2. How many middle stress switches are there? 2 into n by 2 multiplied by 2 minus 1, this is also equal to p, number of middle stress switches are q, which is going to be, because 2 q this has to be 2 q minus 1, first non-blocking configuration. And what is the size of this middle stress switch? p by p. So, switches of size 2 raise power n by 2 by 2 raise power n by 2. So, I know that the middle stress configuration here, I am just going to replace by this number. So, there are this number of switches is 2 2 raise power, these 9 number of switches 2 raise power n by 2 by 2 raise power n by 2 is the switch dimension in the middle stage, input stage. You have these many, 2 raise power n by 2 as the input ports, number of switches are also 2 raise power n by 2, outgoing ports here has to be this much. This is not an optimum value, but I am estimating around, I can take anything, actual estimate will always be lower than this, in terms of cross point. But this is very close to optimum. So, we are considering under root 1, under root n, why because we are. We can easily compute. Computer is recursively constructed. Recursive construction also is possible. See, I have not just told how it will be recursively constructed, there is a problem here. There is a minus 1 sitting, how you will construct a switch, this switch, how you will construct recursively. So, I will make an assumption here, because I am estimating around, I will estimate slightly higher. This minus 1 I will forget actually, in the number of switches here. Here also I will forget, then I will prove that each one of these switches switching elements can be done by 2 raise power n by 2 by 2 raise power n by 2. So, I know that 2 raise power n by 2 raise power n by 2 raise power n. So, idea is 2 raise power n by 2 raise power n switch. Can you make with some number of 2 raise power n by 2 by 2 raise power n by 2 switch? How many number? This is what we need to find out. So, I have gone from this switch to this switch and this is recursion. So, I can put this thing here, I can find out 2 raise power n by 4 by 2 raise power n by 4. I can keep on doing it till I get 2 by 2 and 2 by 2, I know the complexity is 4 or number of cross points is 4. Just put all those values, do the solution and you will get the complexity expression. That o n log 2 n to raise power point 2.58, that value will come from there actually. So, similarly on this side, this value is 2 raise power n by 2. So, for this, it is clear that how many switches are there, these many switches are there, 2 raise power n by 2 by 2 raise power n by 2 switch. Here, I do not know. So, what we will do is, we have to make an, I can forget this minus 1 actually. Let my output be larger, how does it matter? I can make, I can use 2 raise power n by 2 by, I can use this switch also. Does not matter and so far, it is strictly non-blocking, it is fine with me. Now, how to build up this kind of strictly non-blocking switch? Usually, you will try to see that, let me make a cross bar whose output ports are more. I can do something smarter actually, the number of inputs are 2 raise power n by 2. I can just duplicate each one of these wires, use one switching element 2 raise power n by 2 by 2 raise power n by 2, take another switching element of same size. Is this strictly non-blocking switch? I can take any input, these are strictly non-blocking. So far, an output port is free, input port is free, I can always set up a connection. Each element is strictly non-blocking and that is a parallel configuration. So, each one of these blocks can be implemented by this configuration. So, this actually means, how many switches will be required in the first stage? How many 2 raise power n by 2 by 2 raise power n by 2 switches will be required in first stage? 2 for implementing each switch. So, you require 2 into first stage, these many switches will be required. Second stage, this minus 1 again I am doing away with, I am using one higher number actually, that is what I did here. So, this also minus 1 has to go. So, second stage also required 2 raise power n by 2 into 2, whatever I did for first stage, I do inversion of that. Third stage also required these same. So, how many require is 6 into 2 raise power n by 2 switches of size 2 raise power n by 2 and this can be used to create this much size of a strictly non-blocking switch. So, I can now write the recursive relation actually from here. So, I call it F. So, F which is the cross point for this is nothing but 6 into 2 raise power n by 2, sorry this is 2 raise power n. F is a function which gives you the cross points, number of cross points. So, number of cross points is a bound on the cross points, number of cross points actually. So, I can recursively now solve it, I have got a recursive relation. So, the cross points which are required for 2 raise power n, say it is than the minimum, more than the minimum required, because I have added one more. You see, it is not 2 into q minus 1, it is actually 2 q which I have been using. So, I can go with the recursion with this and then solve it. So, I think I will stop now because you have to actually go for another class. So, I will take up from here, you can try on your own now. Anyway, it is also given in the notes, but I still feel that you should try on your own and try to get the expression. So, next lecture we will actually solve it and then we will go for still better switch, because this is not the exact value I can get even better bound. I can still get a spin on blocking switch with a different configuration which is going to have lower cross point complexity, that is the counter network. So, this is where I am leaving now. There is no rearrangement required. It is a strictly non-blocking configuration. Only thing is that important thing is to get this recursive relation. You should appreciate and understand this. See, it is important consecutive to understand how you arrive at this expression. Solving it after this is all, then it is kind of a normal routine Can you explain this point? How do you get duplication of… Actually, I have to create a switch which is having to restore n by 2 inputs, q into 2 q minus 1. So, instead of 2 q minus 1, I put 2 q. That is okay, sir. But then how to create it was the issue. I want to convert everything to to restore n by 2 by to restore n by 2. Everything I am trying to break down. So, if I take this configuration, I am able to create this matrix. Two of them I put together. Any input you take, I should be able to connect to every output. This whole box is giving you this simulation. It is acting like this. This is the basic building box. But this is the trick. Usually people will get stuck only at this point. Once you know this, you can do it. What you are getting is 4 times, not 2 times. No, no. What is this output? Number of ports here. 2 is power n by 2. 2 is power n by 2. So, 2 times 1 and 2. So, I can, in general, I can actually create a cascade. I can take all these parallel lines and I can create 2 n by 2 by some number i into 2 is power n by 2 is possible. You require i such switches. All inputs are parallel connected to all of them. Only your bus size or wires required will be higher. Basically, we are answering that we have to implement q into 2 q. That is why we are doing a duplication. So, that is why you required 2 q elements in the second stage. You also required 2 q elements also in the first stage, as well as in third stage also. It becomes 6 times because of that. And because number of switching elements is this, 6 into this. And that is what actually now follows further from here. Thank you.


Bela's currently asleep. I'm gonna be doing getting sick in the middle of the night Right you need to talk to me, please talk to me. I feel like I'm getting sick now What is good mom squad and welcome back to our channel Bela's currently asleep. It is actually 6 a.m I thought it was a perfect idea to do this prank now because we still have a few hours sleep We usually wake up at 9 a.m. As you guys know the title I've been doing getting sick in the middle of the night And what is crazy is I actually am sick like I don't feel good at all. I've had a headache. I'm congested I body hurts. I feel really weak So I feel like it's a perfect time to do this video But basically what I'm gonna do is I'm gonna set up the camera And I'm just gonna like start feeling like like coughing and act like I'm throwing up on the toilet and like just start like Freaking out calling his name and getting his reaction. I think it's gonna be super funny Make sure to give this video a big thumbs up if you guys are not already subscribed We should go hit that subscribe button and join the Marvel squad because we post every Wednesdays Fridays and Sundays And you don't want to miss out any single one of our videos plus you do 20,000 likes we guys were guys We're always crushing it and I know you guys have been requesting this video for the longest time and finally we're doing it I thought it was a perfect timing to do it since I am sick And I'm not feeling good at all like I literally cannot wait to go back to sleep That's how freaking tired I am and how sick I feel and hopefully I recover soon So being sick is not fun. And what's crazy? It is this so warm out this week It's gonna be 60 70 degrees and I'm freaking sick. Let's get this video on a roll I am excited this usually actually he's probably gonna be like super drowsy and sleepy because he is Passed out right now. So he might have a video the process.  I am overheating right now. So I'm gonna open up the door and listen to the camera And then I will be back in just a minute. All right guys So I just want a perfect spot to hide the camera now It's time to start coughing and calling the name and just being super sick. Let me open up the door Babe No I don't feel good I feel like throwing up. I need you No Don't feel good. What happened? You know how I went to bed really sick I woke up like I'm about to I feel like I'm about to I already have a water, baby. I don't feel good Yeah, what do you need work?  No, I feel like I'm gonna throw up. What do you need me? Yeah, I can't even sit by me. Are you okay? Don't make me do anything. Babe I don't feel good, babe I feel so sick. Do you have a ponytail or something? No Are you okay? You can throw up if you want. It'll probably make you feel better. I can't. I got dry feet. I don't know how to do this. That probably works. You okay? No. What do you need? I just want you to sit by and by me Okay, okay. I don't feel good, babe. I'm gonna open up the toilet so you don't get sick. Okay, it's okay. I can't. It's not coming out. Let me grab another towel.  I'm tired. I know. I don't feel good, baby Okay, stop. I can't. I'm not letting me. I'm body hurts. I feel really dizzy. Why did this happen? How long have you been up? For like the last 10 minutes. I didn't want to wake you up, but I don't feel good. Are you serious though? Yeah.  Come on, I'll be right back. I'm sick, so it's believable. I already took medicine this morning. Baby, I already took medicine. I already took, I know, but I already took some of that earlier. Drink this. Drink as much water. You need to drink warm water. I know. No, I don't want, I don't want water. I already had, I don't want water. You have to take a sip, babe. No, I have to wait 30 minutes. I have to check my temperature. Oh my gosh. Well, you obviously are sick, so there's no point in waiting. Yeah, but I don't feel good. Snaps in here. It's okay. Yeah. All right, don't worry.  Let it out. Are you going to the toilet? No, I don't know. How do you feel? What hurts most? I don't know. Snabby, come here. I feel good. I'm already here. I don't feel good. You're going to take a shower? I don't feel good. Right. You need to talk to me, please. You need to talk to me. It's not coming out, babe. I don't know what you're going to do, babe. I don't know. I'm so tired. I'm sorry. I don't want to feel good. What did this start, though? Are you going to pass out? Like 10 minutes ago. I don't know. Okay. Well, don't pass out. If you pass out. I just really don't freaking feel good. You need a wipe from home. Do you throw up at all? No, I can't. It's just nausea. Stick your fingers down my throat. It's just nausea and I feel like I can't. I'll stick my fingers down. No, stick your fingers down my throat. It'll make you feel all right. I don't want to throw up. I don't want to throw up. Then you do it.  No, I'm not sticking my fingers down my throat. It'll make you feel so much better. No, I want to let it come out naturally. Do you feel like you're going to pass out? Do I feel hot? A little bit.  Okay, what do you need? I don't know. I just need you nicely. I'm going to fall asleep. What do you need? I don't know. I just really don't feel good. I don't know what you want me to do. I don't know. You're so weird to be with me, though. Are you okay? Yeah. I'm sorry.   Why? I'm sick, but I was just pranking you. Huh? Don't be rude. Babe, I'm so tired. I know you're freaking tired, but are you kidding me?  I had to. But I really am sick and you know that. Babe, it is so early in the morning we're going to be doing this. I don't know what's really early in the morning, but I had to prank you. I don't even know what you have. Because I feel sick right now.  No, I do.  Yeah, I do. Oh no. I had to prank you. I know it's 6 am. I know and we're really tired, but I thought it would be a perfect idea to pull this on you. I'm going back to bed too.  I had to get up and prank you, but I could easily pass right back out. Okay, but yeah, it's just so annoying, babe. I can't stop getting bullfrapped. How should I get Team Mariah in the comment section? Mariah has literally, oh my god, I look like terrible right now. We both look terrible. I'm literally wearing my glasses. Mariah has literally been taking over with pranks and I do not want you to think that's how it's going to be for our whole channel. And listen to this. I'm freaking sick.  Oh my god. I feel like I'm getting sick now. You do? I feel like you're made me sick. I'm like feeling dizzy now. Are we stuck bunnies together? Wait, what? That's not funny. Ew, I almost gagged. Really? Yeah. You thought I was going to throw up on you? Yeah. What about it? What about it like a backbite on you? Anyways guys. I thought it was so cute that Snap came in there and they knew I didn't feel good. He was meowing when I woke up. He was meowing.  He was stuck out in the hallway. He was? Yeah. That's why he was meowing. I was like, why is he outside? Look, he's so cute. Did you go out there then? Anyways guys, don't think that Mariah rules this channel. I'm going to tell you right now. Team Bill is such a big strong team. And you guys love my pranks and my challenges and videos. So get ready because Team Bill is going to come back pretty soon. No, it's Mariah. I'm tired. I can't think straight. So Marvel Squad. It is 6 a.m. but in a few hours, my sister and Taco, if you guys remember Taco, which would be really good because we can reunite you guys. We're reunited or we're putting together Taco and Snap. It's we're tired so bear with us here. Before you click on the video, get ready because our cat Snap is going to be meeting our old cat, Taco for the first time. And they're going to come over and Megan and Taco. We're going to see how it goes. I'm hoping they get along. Hopefully they don't like start scratching each other. No, but we're going to slowly ease into it. But you guys will see Taco. So get ready. It's going to be really fun and exciting for you guys to see. First reaction about how they're going to be. I cannot wait. I can't wait either. And you guys get to see Taco. I know many of you guys were like, Oh my God, where's Taco? Where's Taco? I don't know how Snap is going to be. Snap hasn't seen another cat and like. I don't know. Because Taco lives with a dog. So Taco, I feel like we'll be fine. We'll see. We'll see you guys. It's really tiring right now. Sorry. We're going to go back to bed. If I'm not in my hundred percent. But just get ready for team vote. Preparation is to come. We're going to go back to bed and get some sleep. And we will see you guys in a couple seconds.  So see you soon. All right guys, this is the moment. Snap's right here. We have Taco over here. They do not see each other. But I think Snap heard Taco cry because he's like meowing in there. So here we go. Look at first reaction. Ready? Oh my god. Look, you don't even see it. I think they like each other. I've never seen Taco. Taco is so confused. That is Snap. Look at Snap actually likes him. Snap actually likes him. Taco is just like. I've never seen Taco like that though. This is actually crazy. I did not think this was going to happen. I've heard like that meeting, but they're meeting today. And Taco is kind of, I think he's been in the cage for the past like half hour driving. He's just nervous. Look at Snap.  So Snap and Taco are slowly getting along. Say hi to the Marvel Squad. You haven't seen the Marvel Squad in forever. He lives with Megan now. But then we have our new cat Snap. They've been doing better and better. Taco's been opening up. They've been a hissing war. It has been a little bit of a hissing war. But they haven't, they've been getting closer and closer to each other. And they've been doing really good. So I am really proud of them, right? The Marvel Squad misses you. Excuse our messy house. They have cat toys everywhere. Snap really wants to play. So just give them a few more hours and they'll be best buddies, right? Because Snap really wants to play with them. Aw, look at the bug. I miss you. Look at him. He's like, yep, I'm the boss of this house now. I was kidding. And then there's Snap. Taco was so excited. Oh, here they go. Let's see what happens here. Taco, I love you. Marvel Squad missed you. All right guys, last thing with them. So this is where we're at right now. Snap is over here, right? Taco's over here. They're both laying down just looking at each other. Ryan, what do you think about this? It takes a few days for cats to, like, especially when you meet them for the first time. They used to be on like, you know, but they've been doing pretty good. They've been doing awesome. And considering like they started to play and everything, they're still one side there, like having a standoff right now. So we're just going to let them be, let them enjoy their time. They're going to like keep playing with each other and stuff. But I'm so glad that they didn't like try to kill each other right when we got them out. I know. Our main goal is to just get them to meet for the first time and everything. But guys, before we end this video, we have to show you, look, they're playing right now. Taco's over here, Snap. What are you doing? Are you chasing them? Take it easy on the dude.  But Snap has like been like showing like dominance. Showing him who's dominance. Yeah, who's dominance. Like showing him who is the boss. And like, it's funny because when we first got him, he didn't have his like ground here yet. So he didn't feel tough. So now he feels tough. He feels really tough. He does feel really tough. I love it. But we're going to show you really quick what we got in our last PO box opening. Someone literally got Snap a freaking cat toy and some cat treats that I'm going to show you right here. It's insane guys. Like what you guys send us in our PO box, it's just crazy and the amount of support, the amount of letters. We still have all of these to open. But Mariah, where is it? Oh, look at this. And then cat treats that are in here. This is Snap's new favorite toy, by the way. I don't know if he's going to play with it right now. It's a $5 bill guys. You guys do not have to send us money. Oh, there you go. He loves it. He loves it. Wait, she gave us five bucks? I know, isn't it cute? She gave us five dollars too? Yes. Oh my God. You are so sweet. Thank you so much for all the love. Someone freaking drew us. Oh my God. It's Snap. Someone got Snap. That is crazy. That is insane. Everyone, look, we got a red car right here. Kind of matches the Corvette color. I love that. We got a lot of notes from a lot of people that we're going to be opening. John DeSky, Christian, Ethan, Jonathan. Oh my gosh. All of you guys. That's there. Janelle, Taylor, Minerva, Lainey.  Everyone, if you want to send us some stuff in our P.O. box, whether it be any of these cat toys, letters, just anything that you want to send us, our P.O. box link is right here as we always do shout it out. We never know what to expect from all of you guys. Look at this. Ryan, did you even see these scrunchies? Look it. Yeah, someone literally made custom scrunchies. I don't know if she made them like herself or she bought them, but I love these. That's insane. But yeah, that is our P.O. box opening for this week. Like I said, we're going to be going through the letters and maybe even calling some people if you left a phone number on there. We'd love to give it back to you guys, just like you guys give back to us all the time. We hope you enjoyed the video. I'm still kind of salty that Mariah did prank me, but don't worry, Marvel Squad. I will be getting her back. I do feel a little better now, but I think I am getting sick. Me and Mariah, I think me and Mariah both are getting sick now. A cold. So we'll see. Wish us luck, Marvel Squad. Comment down below. Just wish us luck because I don't want to get sick. I don't want to get sick either. I need a film. We have a cold. We need a film for our Marvel Squad. It's just a cold, guys. Don't worry. It's nothing serious. We just, it's our weather here. It was just four degrees. Now it's 70. Yeah. Like so. Chicago weather literally can go from 30. No, it was 32. Two days ago. Now it was 70 yesterday. Crazy. But anyways. I'm just going to rest it out. Oh, here they go again. Where are they? Is he sneaking around? Uh-oh. Chill. Snap is in this freaking snap. That's not your little box. Yeah. No. Look at them. Taco's a little baby. But anyways, guys, we're going to end out the video right here. Thank you guys so much for watching. Make sure to give this a thumbs up, everyone. Give it a thumbs up right now. For them meeting for the first time. And seeing Taco. I know you guys were so concerned about him. It's been a while since we had him on our channel. Yes, we have. It's he's safe with Megan. Everything's good. They're running all around him. It's so funny. Before we end the video, we have to do our post notifications. Shout out. And today's shout out goes to Walther Craft. Walther Craft. Thank you so much for having your post notifications on. After subscribing to our channel. We love you. And question of the day. Comment down below if you guys remember us getting Taco. Yes. And he was like the OG cat when we first got him. So comment down below if you guys were a part of our channel then. And get ready because team bill is going to be coming back pretty soon. Just saying. All right. We love you guys. We'll see you in the next video. But until then. Peace. Bye guys.


Known as Teflon Don and sometimes even Dapper Don, fame mobster John Gotti shot to fame in the 1980s as the head of the Gambino crime family, one of the most powerful mafia clans in all of America at the time. Gotti was eventually jailed in 1992 and sentenced to life in prison without parole. After being charged with five murders, conspiracy to commit murder, racketeering, obstruction of justice, tax evasion, illegal gambling, extortion, and loan-chirking. 10 years into his sentence, he'd die from throat cancer in prison at the age of 61 years old. Prior to his downfall, Gotti was never shy about flaunting his wealth. He not only liked to splash his money on nice cars and fancy clothes, he also funneled a whole bunch of it into an old, Westbury, New York property, the long-time Gotti family home that was heavily featured on his daughter Victoria Gotti's reality TV series, Growing Up Gotti. Victoria inherited this mansion from her father and then called it home alongside her three sons, John, Carmine, and Frank, filming her own series for three seasons until the mid-2000s. Then, 10 years later, the FBI would raid the family's property as well as their auto parts business. The reasons for these searches weren't entirely clear at the time, but it would later come to light that the feds were investigating accusations of tax fraud involving Victoria's three sons. Since that 2016 raid, the family's multi-million dollar mansion was foreclosed on after Victoria failed to make good on $650,000 in mortgage payments. Now, the Gotti family home is a glorified ghost town that one YouTuber was brave enough to venture into. But before I show you the horrendous state this home is now in, first, I wanna take you back to its heyday when it was still being used by one of America's most notorious crime families. Formerly described as a majestic site with more than four acres of manicured lawns and towering trees, the Gotti family home located in the Long Island village of Old Westbury once boasted an exquisite custom brick exterior with a ton of old world charm and further elaborate details. Originally built in 1993, the land the home rests on was bought in 1989 for $175,000. The family then built a two-story, five-bedroom, five-bathroom home on the property with over 5,000 square feet of space. The estate backs up to the service road of the very busy and loud Long Island expressway, which is kind of unfortunate. So to make up for that, the home includes double drive gates, a dark bottom swimming pool, a number of tile patios, long stretches of lawn or stables and paddocks, children's playground, a tennis court, a gazebo on a small island, and even a go-kart track. That might sound like one busy exterior, but the inside is even more curious. Upon arrival at the family home, guests are immediately greeted by an entrance hall with a two-low ceiling and twin curving staircases that were no doubt used for a dramatic entrance or two by Victoria throughout the years.  Over in the dining room, you'll discover a ceiling that's been stenciled with flowers, much like the living room. Alongside some inlaid wood floors and morose-colored drapes. As for the kitchen, it's tiled floor and mirrored built-in buffet display cabinet kinda stick out like a sore thumb. There are also a few iron stools around a pill-shaped work island. Also located on the main floor, you'll find an office with a fireplace and black walls that might be the sheikest-looking space in the whole house. Unfortunately, the opposite might be said about Victoria's former master bedroom, which is draped in gauzy textiles over her four-poster bed, which sits on a literal pedestal. Then there's her rose and gold-colored bathroom, which has been overloaded with silk and plastic floral arrangements and baseboard heating elements. All in all, you were probably expecting this place to be a lot more elegant, weren't you? After the family's legal problems cropped up in the late 2010s, Victoria would try to sell this home, but to no avail. Instead, the estate was foreclosed on and the bank would snatch this property in October 2022 for $2.65 million. But about a year prior, one YouTuber ventured onto the former Gaudi property and wound up shocking historians all around the world with what he found. In October 2021, YouTuber Kyle McGrann explored the Gaudi crime family's deserted estate and what he found was incredible. The eerie footage he captured there showcased a home that had fallen into a state of disrepair in the years since the FBI originally raided the property. Not only were old vehicles left all over the exterior grounds stashed among the estate's overgrown shrubs, but the pool and hot tub combo with a swim-up bar have long been left in a dirty state of abandonment. Inside, clothes shoved into garbage bags were left weirdly in the middle of the home's front foyer alongside an empty fish tank. As for the kitchen, cups as well as other dishware and utensils were found scattered across the granite countertops, and the dining room was left largely alone with most of its furniture still standing. Elsewhere, some Gaudi family suits are still hanging in one of the bedrooms, while the nearby study holds shelves that are jam-packed full of dust-covered books. There's even a guest house in the property that was left with a fully set kitchen table and all-black bathroom and strangest of all an abandoned safe. But the craziest thing that Kyle managed to discover was a secret room hidden behind a bookshelf on the upper floor of the guest house. Inside that space, Kyle found shirts on coat hangers and pile of clothes as well as photos, including a hand-written card from Victoria. It's not entirely clear what Gaudi might have used this space for, although based upon what was discovered inside of it, the likelihood is that it was simply an extra storage space. In a sense, this state of this property is an accurate representation of the family that once called it home. Ever since 2016, the Gaudi crime family has more or less disappeared from the limelight. Now, the only member of the family-making news is Gaudi's grandson, John Gaudi, the third who you might have heard of after he got involved in a post-match brawl with his boxing opponent, Floyd Money Mayweather. I guess the Gaudi family reputation for extreme violence is still being upheld to this day just in a different type of way. If you wanna learn more about that story, be sure to check out our famous news feed on Instagram. All right, everyone, that's gonna bring this latest house tour to a close. Thanks so much for watching, and before you head out, consider answering the following question. Have you ever been brave enough to explore an abandoned building? If so, let me know what you found there in the comments below. Otherwise, like, subscribe, and turn on those notifications to make sure you never miss a video. My name is Kara, and if you feel like checking out another celebrity abode, then stay tuned because coming up, I'm gonna be taking you inside the homes of different types of criminals entirely. The recently incarcerated Danny Masterson. I'll see you next time. Bye. Former That 70s Show actor Danny Masterson was convicted on two counts of sexual assault on May 31st, 2023. Hollywood convicted of rape. Danny Masterson, who starred on That 70s Show, was just found guilty on two counts of forcible rape involving two different women. Jurors were deadlocked on a third count. After a lengthy criminal proceeding, that would see three women accuse him of taking advantage of them from the confines of his former Los Angeles home. This ended a years-long battle that lasted two trials. Back in 2022, the jurors found themselves hung on all counts against Masterson with mostly leaning towards an acquittal. But prosecutor's soldery trial and in their second attempt, they focused on not only the drugs Danny used, the women, but how he isolated them at his home to make them feel more vulnerable. I'll put that in the present. Yes, sir. We go over the top three moments from week one of actor Danny Masterson's rape trial. Journalist Tony Ortega comes back on to explain it all. After a week of deliberations, the jurors returned to convict Danny at assault to two of the three women while being hung on the third count stemming from allegations made by Chrissy B. Masterson's former longtime girlfriend. As you might imagine, the formerly popular actor hasn't appeared on TV for quite a while. And it's been rumored that he's been hiding out in the semi-remote town of Sant'e Nes with his wife actress Biju Phillips by his side. Now Masterson is facing potentially as many as 30 years behind bars and he's due back in court at the beginning of August to learn his sentencing. Needless to say, this is one demoralizing story made all the more unusual because of how Danny used his own home to shield himself while perpetrating some awful crimes. If you wanna hear more about what happened behind Danny Masterson's walls, then keep watching. But I'll warn you, this story isn't for the faint of heart. Danny picked up his longtime Los Angeles home back in July 1998 for just $560,000. Boasting a Spanish design with amazing views, vintage craftsmanship, and a whole bunch of character from its dramatic front door to its marble and gold fireplace, this place, was an architectural lender. Danny would spend much of the next decade culling this place home, taking full advantage of the property's master suite with a retractable projection screen, large kitchen, as well as its multi-terrace yard with a pool and jacuzzi, turning the whole estate into something of a social hub. But that's not all he turned it into. According to a tipster who once spoke with Herb Los Angeles back in 2007, Danny's house had a few other notable details as well. For one, nearly 25% of the art in the home was said to be drawings, photos, or sketches of himself. But the strangest and creepiest extra he had installed were 17 interior cameras, planted club style and smoked glass orbs that monitored every room of his home. Danny could even watch the footage from the control grid in his master closet. So is it any wonder that according to his accusers, this became the scene of all three crimes he's now been found guilty of? Danny's first accuser claims that she went to his house to pick up a pair of keys from him sometime around April 2003 when she got there. She saw Danny was entertaining guests and decided to join in on the fun with some mutual friends. But about 20 minutes after she received a mixed drink from Masterson, her vision became blurry and the actor pushed her into the jacuzzi. Afterwards, Danny brought the woman upstairs and proceeded to assault her by washing her off in the shower and then putting her in his bed in the master suite. At that point, she was too weak to fight him off and he threatened her with a gun after she tried to pull away. Danny's second accuser claimed that she was also drugged and then assaulted by the actor in November 2001, five years into their relationship together. After angering Danny by yanking hard on his hair in an attempt to get him to leave her alone, a month later, he attacked her while she was asleep in bed and unable to defend herself. The third accuser, who would speak at Danny's trial, told a strikingly similar story. One night, Danny demanded that she come over to his house. When she arrived, he told her to remove her clothes and not wanting any possible violence to take place in retaliation. She listened. Afterward, she was afraid to go to the authorities due to her membership in the Church of Scientology, the same faith that Danny's also part of. The last of these incidents took place in 2003. Four years later, Danny would list this property for $1.59 million before eventually finding a buyer. Afterwards, Danny would distance himself from the scene of his former crimes by moving into a new home in the Hollywood Hills. Believe it or not, but in a strange twist to fate, the new home Danny Masterson moved into had merely as shady a reputation as the one he left. That's because Danny's new estate was previously owned by none other than Chuck Berry. Originally constructed in Los Angeles, quiet, bronze and canyon neighborhood back in 1923, Chuck Berry lived in this house for years, throughout both the 80s and the 90s before a series of sexual harassment charges and assault allegations would hit the musical superstar. These eventually led him to selling the property in 2000 for only $570,000. Seven years later, the property was bought by Danny Masterson and his wife Bijou Phillips for much more than that. $3 million to be exact. Secured behind spiked gates and high hedges, not to mention some equally dense greenery, Masterson sure lices privacy, huh? Anyways, this circular estate spans two thirds of an acre. The property boasts a sprawling four bedroom, three bathrooms Spanish revival style main house with close to 4,600 square feet. It might have been built a hundred years ago, but to this day, the home still maintains much of its original architectural details, including a colonnaded front porch, a carved wood front door set into a pointed archway and well-preserved woodwork antique fireplaces as well as semi-circular windows. Upstairs, the guest bedrooms are ample in size while the primary suite includes a private sitting and dressing room as well as a sun flooded bedroom with an updated vintage style bath and access to a gigantic terrace. Downstairs, each room flows from one living or entertainment space into another. For instance, the living room with its carved stone fireplace also features coffered ceilings while the formal dining room is surrounded by glass doors and links to the gray Eden kitchen by way of a butler's pantry. Outdoors, lush landscaping surrounds serene gardens as well as a swimming pool and a tennis courts. There's also a separate gated driveway that divides the main house from the detached garage that's been converted into a studio style guest apartment with kitchenette, bath, and a soundproof two room recording studio. Pretty gorgeous, right? Well, once the accusations against Danny were brought to light, he'd lose an unrelated lawsuit against his mortgage holders which left him on the hook for nearly $2 million out on this property. That forced him to list the home for $7 million. Property was later taken off the market before being sold in 2021 for $6.2 million. Given Danny's lack of film and TV appearances over these past few years, not to mention his wife's too, it seems that likely whatever profit they made off the sale will have to last them a while. But with Danny's no doubt expensive legal fees now coming due, how much Biju will be left with once Masterson is officially serving a sentence is anyone's guess. Usually these house doors are pretty lighthearted but there was just no way I was gonna be able to tell you this story without taking it as seriously as it deserves. I have no idea what's gonna happen to Danny Masterson now but by all accounts, whatever it is, he'll deserve it. And his days of living in the lap of Hollywood luxury are clearly over. Thanks for watching today's tour and before you head off, consider answering the following question. Knowing what you do about Danny, will you ever go back and watch old episodes of that 70's show now? Let me know in the comments down below. Otherwise, like, subscribe and turn on your notifications to make sure you never miss a video. My name's Kara, if you'd like to check out more celebrity homes before you're done, then stay tuned to our look and say the properties of Laura Preppin. Bye.